An optimization algorithm for solving the rich vehicle routing problem based on Variable Neighborhood Search and Tabu Search metaheuristics
- 1 January 2016
- journal article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 291, 468-477
Abstract
No abstract availableKeywords
Funding Information
- UNIR Research Support Strategy (MTM2014-52016-C2-1-P)
This publication has 19 references indexed in Scilit:
- A variable neighborhood descent heuristic for arc routing problems with time-dependent service costsComputers & Industrial Engineering, 2010
- Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methodsJournal of King Saud University – Science, 2010
- Solving a rich vehicle routing and inventory problem using column generationComputers & Operations Research, 2010
- A hybrid evolution strategy for the open vehicle routing problemComputers & Operations Research, 2010
- An evolutionary algorithm for the vehicle routing problem with route balancingEuropean Journal of Operational Research, 2009
- A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraintsEuropean Journal of Operational Research, 2009
- General variable neighborhood search for the continuous optimizationEuropean Journal of Operational Research, 2008
- The Vehicle Routing Problem: The Case of the Hong Kong Postal ServiceTransportation Planning and Technology, 2007
- A multi-start local search algorithm for the vehicle routing problem with time windowsEuropean Journal of Operational Research, 2004
- Variable neighborhood search: Principles and applicationsEuropean Journal of Operational Research, 2001