Variable neighborhood search for the dial-a-ride problem

References

Page 1

	Year	Citations
Optimization by Simulated Annealing Scott Kirkpatrick, C. D. Gelatt, M.P. Vecchi Science Numerical AnalysisLarge-scale Global OptimizationComputational ScienceStatistical MechanicsEngineering	1983	44K
Variable neighborhood search Nenad Mladenović, Pierre Hansen Computers & Operations Research EngineeringMachine LearningData MiningIterated Local SearchVariable Neighborhood Search	1997	4.1K
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows David Pisinger Transportation Science EngineeringOperations ResearchVehicle RoutingPickup LocationLogistics	2006	2.3K
The dial-a-ride problem: models and algorithms Jean‐François Cordeau, Gilbert Laporte Annals of Operations Research Mobility ServiceRoute ChoiceEngineeringGame TheoryBusiness	2007	850
A tabu search heuristic for periodic and multi-depot vehicle routing problems Jean-Fran�ois Cordeau, Michel Gendreau, Gilbert Laporte Networks Mathematical ProgrammingEngineeringLogistics OptimizationTransportation Systems ModelingOperations Research	1997	821
Static pickup and delivery problems: a classification scheme and survey Gerardo Berbeglia, Jean‐François Cordeau, Irina Gribkovskaia, Top Intermodal TransportationStatic PickupEngineeringTransport LogisticSystems Engineering	2007	690
A tabu search heuristic for the static multi-vehicle dial-a-ride problem Jean‐François Cordeau, Gilbert Laporte Transportation Research Part B Methodological Mathematical ProgrammingEngineeringRoute PlanningAutomationTabu Search Heuristic	2003	663
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem Jean‐François Cordeau Operations Research Mathematical ProgrammingTransport Network AnalysisEngineeringNew Valid InequalitiesOn-demand Transport	2006	652
The Vehicle Routing Problem with Time Windows: Minimizing Route Duration Martin Savelsbergh INFORMS Journal on Computing Mathematical ProgrammingEngineeringNetwork RoutingNetwork AnalysisEdge-exchange Improvement Methods	1992	442
A variable neighborhood search heuristic for periodic routing problems Vera Hemmelmayr, Karl F. Doerner, Richard F. Hartl European Journal of Operational Research Mathematical ProgrammingNetwork Routing AlgorithmNetwork ScienceEngineeringPeriodic Routing Problems	2007	294

Page 1