Dynamic ride-share systems aim to bring together travelers with similar itineraries and time schedules on short-notice. These systems may provide significant societal and …
Research on dynamic and stochastic vehicle routing problems received increasing interest in the last decade. It considers a novel problem class, aiming at an appropriate handling of …
In this paper, we propose a novel, computational efficient, dynamic ridesharing algorithm. The beneficial computational properties of the algorithm arise from casting the ridesharing …
Over the last years, several variants of multi-constrained Vehicle Routing Problems (VRPs) have been studied, forming a class of problems known as Rich Vehicle Routing Problems …
Y Molenbruch, K Braekers, A Caris - Annals of Operations Research, 2017 - Springer
Dial-a-ride problems consist of designing vehicle routes and time schedules in a system of demand-dependent, collective people transportation. In the standard problem, operational …
We consider a stochastic dynamic pickup and delivery problem in which a fleet of drivers delivers food from a set of restaurants to ordering customers. The objective is to dynamically …
With the rising fuel costs, ride sharing is becoming a common mode of transportation. Sharing taxis which has been prominent in several developing countries is also becoming …
MA Masmoudi, M Hosny, E Demir… - … research part E …, 2018 - Elsevier
Abstract The Dial-a-Ride Problem (DARP) consists of designing vehicle routes and schedules for customers with special needs and/or disabilities. The DARP with Electric …
Y Liu, N Cui, J Zhang - Transportation research part E: logistics and …, 2019 - Elsevier
The planning of temporary medical service facility location and the distribution of casualties to these facilities require to consider casualty triage, health deterioration conditions, and …