Search

Your search keyword '"Kamel Aissat"' showing total 7 results
Start Over Author "Kamel Aissat" Topic computingmilieux_miscellaneous
7 results on '"Kamel Aissat"'

1. Meeting Locations in Real-Time Ridesharing Problem: A Buckets Approach

Author

Ammar Oulamara, Kamel Aissat, OPTImisation Methods for Integrated SysTems (OPTIMIST), Department of Networks, Systems and Services (LORIA - NSS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Set (abstract data type), Flexibility (engineering), Matching (statistics), Traffic congestion, Operations research, Computer science, Heuristic (computer science), 11. Sustainability, Shortest path problem, Cost sharing, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Operating cost, ComputingMilieux_MISCELLANEOUS
Abstract

Improving transportation efficiency without increasing urban traffic congestion, requires to carry out new services such as ridesharing which contributes to reduce operating cost and to save road resources. In this paper, we provide users of a ridesharing system greater flexibility: given a set of drivers’ offers already in the system, and a new rider’s request, we determine a best driver, a best pick-up and drop-off locations, and a sharing cost rate between rider and driver for their common path. The main idea of our approaches consists in labelling interesting nodes of a geographical map with information about drivers, in so-called buckets. Based on the information contained in these buckets, when a rider enters the system we determine a best driver, as well as a best pick-up and drop-off locations that minimize the total travel cost of rider and driver. Exact and heuristic approaches to identify a best driver, as well as a best pick-up and drop-off locations are proposed. Finally, we perform a comparative evaluation using real road network of the Lorraine region (FR) and real data provided by a local company. Experimental analysis shows a running time of a few seconds while improving participants’ cost-savings and matching rate compared to the recurring ridesharing.

Published
2015
Full Text
View/download PDF

2. The round-trip ridesharing problem with relay stations

Author

Ammar Oulamara, Kamel Aissat, Operations research for Complex HybrId Decision Sytems (ORCHIDS), Department of Networks, Systems and Services (LORIA - NSS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Laboratoire de Conception, Optimisation et Modélisation des Systèmes (LCOMS), Université de Lorraine (UL), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria), and Oulamara, Ammar

Subjects
050210 logistics & transportation, Matching (statistics), 021103 operations research, Operations research, Computer science, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, 05 social sciences, 0211 other engineering and technologies, Travel cost, 02 engineering and technology, [INFO] Computer Science [cs], law.invention, Comparative evaluation, Work (electrical), Relay, law, 0502 economics and business, 11. Sustainability, TRIPS architecture, [INFO]Computer Science [cs], Dijkstra's algorithm, ComputingMilieux_MISCELLANEOUS, Dependency (project management)
Abstract

In this work, we investigate the potential benefits of introducing relay stations in the round-trip ridesharing problem. In the classical round-trip ridesharing system, the pick-up and drop-off locations for the rider don’t differ from his origin and destination, respectively, for both outgoing and return trips. This system is straightforward but inflexible and unbalanced as it puts the whole detour effort on the driver’s shoulders. In this paper, we propose to consider a meeting location as flexible and to determine its optimal position minimizing total travel cost for the round-trip. The meeting locations correspond to relay stations in which riders find ridesharing vehicles. The introduction of relay stations in the round-trip ridesharing problem creates dependency between the outgoing and return trips, in the sense that the relay stations must be chosen in such a way as to minimize the combined travel cost of the outgoing and return trips. In this setting, the rider is supposed to drive to the relay station with his private car and to park it there, so the return trip has to drop him there to get his car back. We present efficient algorithms to solve this problem and, finally, we perform a comparative evaluation using a real road network and real dataset provided by a local company. Our numerical results show the effectiveness of our system, which improves participants’ cost-savings and matching rate compared to the classical round-trip ridesharing system.

Published
2015

3. Multi-modal Transportation with Public Transport and Ride-sharing - Multi-modal Transportation using a Path-based Method

Author

Sacha Varone, Kamel Aissat, Haute Ecole de Gestion de Genève (HEG), Operations research for Complex HybrId Decision Sytems (ORCHIDS), Department of Networks, Systems and Services (LORIA - NSS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Oulamara, Ammar, Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
050210 logistics & transportation, Operations research, business.industry, Computer science, 05 social sciences, Closeness, 020206 networking & telecommunications, 02 engineering and technology, [INFO] Computer Science [cs], Process substitution, Running time, Modal, Public transport, 11. Sustainability, 0502 economics and business, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], Point (geometry), Routing (electronic design automation), business, Geographical maps, ComputingMilieux_MISCELLANEOUS, Simulation
Abstract

This article describes a multi-modal routing problem, which occurs each time a user wants to travel from a point A to a point B, using either ride-sharing or public transportation. The main idea is to start from an itinerary using public transportation, and then substitute part of this itinerary by ride-sharing. We first define a closeness estimation between the user’s itinerary and available drivers. This allows to select a subset of potential drivers. We then compute sets of driving quickest paths, and design a substitution process. Finally, among all admissible solutions, we select the best one based on the earliest arrival time. We provide numerical results using benchmarks based on geographical maps, public transportation timetabling and simulated requests and driving paths. Our numerical experiment shows a running time of a few seconds, suitable for a new real-time transportation application.

Published
2015
Full Text
View/download PDF

4. Real-time ride-sharing substitution service in multi-modal public transport using buckets

Author

Sacha Varone, Kamel Aissat, Oulamara, Ammar, Operations research for Complex HybrId Decision Sytems (ORCHIDS), Department of Networks, Systems and Services (LORIA - NSS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Haute Ecole de Gestion de Genève (HEG), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
050210 logistics & transportation, Service (systems architecture), Operations research, Transshipment (information security), Computer science, business.industry, 05 social sciences, Process (computing), 02 engineering and technology, Transportation theory, [INFO] Computer Science [cs], 020303 mechanical engineering & transports, Modal, 0203 mechanical engineering, restrict, Public transport, 0502 economics and business, 11. Sustainability, Path (graph theory), [INFO]Computer Science [cs], business, ComputingMilieux_MISCELLANEOUS
Abstract

We consider a mix transportation problem, which allows to combine a multi-modal public and a ride-sharing transports, in a dynamic environment. The main idea of our approach consists in labelling interesting nodes of a geographical map with information about either riders or drivers, in so-called buckets. Based on the information contained in these buckets, we compute admissible ride-sharing possibilities. To restrict the needed amount of memory, among the different stops along a public transportation path, we only consider the transshipment nodes, where travellers have to make a change between two modes. Each of those stops are potential pick-up or drop-off stops for ride-sharing. We consider a drivers’ maximal waiting time, as well as the maximal driving detour time depending on the actual drive. Each new drive activates a search for new ride-sharing of existing riders. Each new ride activates another process which searches for potential drivers. Among all admissible ride-sharing possibilities, only those which best improve the earliest arrival time are selected. We provide numerical results using real road network of the Lorraine region (FR) and real data provided by a local company. Our numerical experiment shows a running time of a few seconds, suitable for a new real-time transportation application.

Published
2015

5. A Posteriori Approach of Real-time Ridesharing Problem with Intermediate Locations

Author

Kamel Aissat, Ammar Oulamara, Operations research for Complex HybrId Decision Sytems (ORCHIDS), Department of Networks, Systems and Services (LORIA - NSS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria), Laboratoire de Conception, Optimisation et Modélisation des Systèmes (LCOMS), Université de Lorraine (UL), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), and Oulamara, Ammar

Subjects
Computer science, A priori and a posteriori, [INFO]Computer Science [cs], [INFO] Computer Science [cs], Algorithm, ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2015
Full Text
View/download PDF

6. A priori approach of real-time ridesharing problem with intermediate meeting locations

Author

Kamel Aissat, Ammar Oulamara, Oulamara, Ammar, Operations research for Complex HybrId Decision Sytems (ORCHIDS), Department of Networks, Systems and Services (LORIA - NSS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Laboratoire de Conception, Optimisation et Modélisation des Systèmes (LCOMS), Université de Lorraine (UL), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
050210 logistics & transportation, Mathematical optimization, 021103 operations research, Computer science, 05 social sciences, 0211 other engineering and technologies, 02 engineering and technology, [INFO] Computer Science [cs], Artificial Intelligence, Hardware and Architecture, Modeling and Simulation, 0502 economics and business, A priori and a posteriori, [INFO]Computer Science [cs], Computer Vision and Pattern Recognition, ComputingMilieux_MISCELLANEOUS, Information Systems
Abstract

Ridesharing is a mobility concept in which a trip is shared by a vehicle’s driver and one or more passengers called riders. Ridesharing is considered as a more environmentally friendly alternative to single driver commutes in pollution-creating vehicles on overcrowded streets. In this paper, we present the core of a new strategy of the ridesharing system, making it more flexible and competitive than the recurring system. More precisely, we allow the driver and the rider to meet each other at an intermediate starting location and to separate at another intermediate ending location not necessarily their origins and destinations, respectively. This allows to reduce both the driver’s detour and the total travel cost. The term “A priori approach” means that the driver sets the sharing cost rate on the common path with rider in advance. An exact and heuristic approaches to identify meeting locations, while minimizing the total travel cost of both driver and rider are proposed. Finally, we analyze their empirical performance on a set of real road networks consisting of up to 3,5 million nodes and 8,7 million edges. Our experimental results show that our heuristics provide efficient performances within short CPU times and improves the recurring ridesharing approach in terms of cost-savings.

Published
2014

7. Grey mould development in greenhouse tomatoes under drip and furrow irrigation

Author

Mohamed Chibane, Kamel Aissat, Marc Bardin, Abdelhadi Guechi, Philippe C. Nicot, Université Abderrahmane Mira [Béjaïa], Unité de Pathologie Végétale (PV), Institut National de la Recherche Agronomique (INRA), Département de Biologie, Université Ferhat-Abbas Sétif 1 [Sétif] (UFAS1), and Revues Inra, Import

Subjects
0106 biological sciences, [SDV.SA]Life Sciences [q-bio]/Agricultural sciences, WATER CONSERVATION, Greenhouse, algérie, Drip irrigation, champignon phytopathogène, 01 natural sciences, irrigation goûtte à goûtte, FURROW IRRIGATION, DRIP IRRIGATION, SHELTERED CROPS, GREENHOUSE CROPS, INTEGRATED PROTECTION, MEDITERRANEAN COUNTRY, AGRONOMIC PRACTICE, BOTRYTIS CINEREA, ECONOMIE D'INTRANT, tomate, serre, [SDV.MP.MYC]Life Sciences [q-bio]/Microbiology and Parasitology/Mycology, ComputingMilieux_MISCELLANEOUS, 2. Zero hunger, [SDV.EE]Life Sciences [q-bio]/Ecology, environment, [SDV.SA] Life Sciences [q-bio]/Agricultural sciences, afrique, protection intégrée, food and beverages, Low-flow irrigation systems, 04 agricultural and veterinary sciences, culture protegée, 6. Clean water, Agricultural sciences, Mycologie, [SDV.EE] Life Sciences [q-bio]/Ecology, environment, lycopersicon esculentum, technique culturale, Irrigation, Environmental Engineering, Phytopathology and phytopharmacy, Field experiment, Mycology, macromolecular substances, Biology, Water conservation, otorhinolaryngologic diseases, Surface irrigation, irrigation à la raie, fungi, Sowing, Phytopathologie et phytopharmacie, pays méditerranéen, [SDV.BV.PEP]Life Sciences [q-bio]/Vegetal Biology/Phytopathology and phytopharmacy, Agronomy, plante légumière, 040103 agronomy & agriculture, 0401 agriculture, forestry, and fisheries, Agronomy and Crop Science, Sciences agricoles, 010606 plant biology & botany
Abstract

International audience; Several methods can be used to provide water to plants in cropping systems where irrigation is necessary. For instance, drip irrigation has recently received much attention due to its advantages for water conservation. The type of irrigation can also impact the development of several pathogens responsible for soilborne diseases. Here, we studied the effect of drip irrigation and furrow irrigation on the development of grey mould, caused by the airborne fungus Botrytis cinerea, on tomato plants. A field experiment was conducted in 2004 in five unheated greenhouses. Plants were examined individually every 8 days and the proportion of plants attacked by grey mould on leaves, stems or fruits was recorded from the end of March until the end of June. Our results show that the attacks of Botrytis on the stems occurred earlier in furrow irrigation, 98.8 days after planting on average, than in drip irrigation: 106.3 days after planting. The kinetics of plant infection on stems, leaves and fruits were higher under furrow than under drip irrigation. Disease severity was measured by the average number of stem lesions per plant. Disease severity was higher in plants under furrow than under drip irrigation, reaching 1.32 and 0.99, respectively, at the end of June. Plant mortality due to grey mould was first recorded at 94 and 110 days after planting, respectively, in the furrow- and in the drip- irrigated greenhouses. These results suggest that drip irrigation could be a useful tool for the implementation of integrated protection schemes and for reducing the use of pesticides in unheated tomato greenhouses. They may also provide an additional incentive for growers to switch from furrow to drip irrigation in sheltered tomato production

Published
2008
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results