The electric autonomous dial-a-ride problem
Authors:
- Claudia BongiovanniCBClaudia Bongiovanni
- Mor KaspiMKMor Kaspi
- Nikolas GeroliminisNGNikolas Geroliminis
- 1 April 2019
- journal article
- research article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 122, 436-456
Abstract
No abstract availableKeywords
Funding Information
- Commission for Technology and InnovationCommission for Technology and Innovation (Innosuisse-Swiss Innovation Agency) (#18045.1)
This publication has 37 references indexed in Scilit:
- Hybrid column generation and large neighborhood search for the dial-a-ride problemComputers & Operations Research, 2013
- A Green Vehicle Routing ProblemTransportation Research Part E: Logistics and Transportation Review, 2012
- A heuristic two‐phase solution approach for the multi‐objective dial‐a‐ride problemNetworks, 2009
- Valid inequalities for the fleet size and mix vehicle routing problem with fixed costsNetworks, 2009
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windowsNetworks, 2007
- Reachability cuts for the vehicle routing problem with time windowsEuropean Journal of Operational Research, 2006
- A polyhedral study of the asymmetric traveling salesman problem with time windowsNetworks, 2000
- INTRACTABILITY OF THE DIAL-A-RIDE PROBLEM AND A MULTIOBJECTIVE SOLUTION USING SIMULATED ANNEALINGEngineering Optimization, 1998
- A new extension of local search applied to the Dial-A-Ride ProblemEuropean Journal of Operational Research, 1995
- Local search in routing problems with time windowsAnnals of Operations Research, 1985