A survey of dial-a-ride problems: Literature review and recent developments

SC Ho, WY Szeto, YH Kuo, JMY Leung… - … Research Part B …, 2018 - Elsevier
There has been a resurgence of interest in demand-responsive shared-ride systems,
motivated by concerns for the environment and also new developments in technologies …

Exact branch-price-and-cut algorithms for vehicle routing

L Costa, C Contardo… - Transportation …, 2019 - pubsonline.informs.org
Vehicle routing problems (VRPs) are among the most studied problems in operations
research. Nowadays, the leading exact algorithms for solving many classes of VRPs are …

Green logistics location-routing problem with eco-packages

Y Wang, S Peng, X Zhou, M Mahmoudi… - … Research Part E: Logistics …, 2020 - Elsevier
Optimization of the green logistics location-routing problem with eco-packages involves
solving a two-echelon location-routing problem and the pickup and delivery problem with …

Survey of green vehicle routing problem: past and future trends

C Lin, KL Choy, GTS Ho, SH Chung, HY Lam - Expert systems with …, 2014 - Elsevier
Green Logistics has emerged as the new agenda item in supply chain management. The
traditional objective of distribution management has been upgraded to minimizing system …

A two-phase optimization model for the demand-responsive customized bus network design

D Huang, Y Gu, S Wang, Z Liu, W Zhang - Transportation Research Part C …, 2020 - Elsevier
This paper proposes a new optimization model for the network design problem of the
demand-responsive customized bus (CB). The proposed model consists of two phases …

Typology and literature review for dial-a-ride 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 …

Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space …

M Mahmoudi, X Zhou - Transportation Research Part B: Methodological, 2016 - Elsevier
Optimization of on-demand transportation systems and ride-sharing services involves
solving a class of complex vehicle routing problems with pickup and delivery with time …

A taxonomy for task allocation problems with temporal and ordering constraints

E Nunes, M Manner, H Mitiche, M Gini - Robotics and Autonomous Systems, 2017 - Elsevier
Previous work on assigning tasks to robots has proposed extensive categorizations of
allocation of tasks with and without constraints. The main contribution of this paper is a …

Heuristics for multi-attribute vehicle routing problems: A survey and synthesis

T Vidal, TG Crainic, M Gendreau, C Prins - European Journal of …, 2013 - Elsevier
The attributes of vehicle routing problems are additional characteristics or constraints that
aim to better take into account the specificities of real applications. The variants thus formed …

The dial-a-ride problem: models and algorithms

JF Cordeau, G Laporte - Annals of operations research, 2007 - Springer
Abstract The Dial-a-Ride Problem (DARP) consists of designing vehicle routes and
schedules for n users who specify pickup and delivery requests between origins and …