A Granular Tabu Search algorithm for the Dial-a-Ride Problem
Year of publication: |
2013
|
---|---|
Authors: | Kirchler, Dominik ; Wolfler Calvo, Roberto |
Published in: |
Transportation Research Part B: Methodological. - Elsevier, ISSN 0191-2615. - Vol. 56.2013, C, p. 120-135
|
Publisher: |
Elsevier |
Subject: | Granular Tabu Search | Dial-a-Ride Problem |
-
A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem
Escobar, John Willmer, (2014)
-
Large composite neighborhoods for the capacitated location-routing problem
Schneider, Michael, (2019)
-
Electric vehicle routing problem with flexible deliveries
Hesam Sadati, Mir Ehsan, (2022)
- More ...
-
An analytical approach to calculate the capacity of a railway system
Mussone, Lorenzo, (2013)
-
The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search
Labadie, Nacima, (2012)
-
The static bicycle relocation problem with demand intervals
Erdoğan, Güneş, (2014)
- More ...