An ELS-based approach with dynamic probabilities management in local search for the Dial-A-Ride Problem
Authors:
- M. ChassaingMCM. Chassaing
- C. DuhamelCDC. Duhamel
- P. LacommePLP. Lacomme
- 1 February 2016
- journal article
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 48, 119-133
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Hybrid column generation and large neighborhood search for the dial-a-ride problemComputers & Operations Research, 2013
- Edge assembly‐based memetic algorithm for the capacitated vehicle routing problemNetworks, 2009
- A unified exact method for solving different classes of vehicle routing problemsMathematical Programming, 2008
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windowsNetworks, 2007
- A simple and effective evolutionary algorithm for the vehicle routing problemComputers & Operations Research, 2004
- A tabu search heuristic for the static multi-vehicle dial-a-ride problemTransportation Research Part B: Methodological, 2003
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectivesAnnals of Operations Research, 1995
- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applicationsAlgorithmica, 1995
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windowsEuropean Journal of Operational Research, 1993
- The pickup and delivery problem with time windowsEuropean Journal of Operational Research, 1991