A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
Computers and Operations Research
A Guided Cooperative Search for the Vehicle Routing Problem with Time Windows
IEEE Intelligent Systems
A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows
Computational Optimization and Applications
A general heuristic for vehicle routing problems
Computers and Operations Research
The vehicle routing problem with flexible time windows and traveling times
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Active guided evolution strategies for large-scale vehicle routing problems with time windows
Computers and Operations Research
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
Transportation Science
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
Transportation Science
Computers and Operations Research
Discrete Applied Mathematics
A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows
Expert Systems with Applications: An International Journal
Adaptive granular local search heuristic for a dynamic vehicle routing problem
Computers and Operations Research
A Hybrid Solution Approach for Ready-Mixed Concrete Delivery
Transportation Science
Heuristics for the multi-period orienteering problem with multiple time windows
Computers and Operations Research
Arc-guided evolutionary algorithm for the vehicle routing problem with time windows
IEEE Transactions on Evolutionary Computation
A hybrid metaheuristic for a real life vehicle routing problem
NMA'06 Proceedings of the 6th international conference on Numerical methods and applications
An adaptive memory algorithm for the split delivery vehicle routing problem
Journal of Heuristics
Spatial, temporal, and hybrid decompositions for large-scale vehicle routing with time windows
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Survey: matheuristics for rich vehicle routing problems
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
A heuristic method for the inventory routing problem with time windows
Expert Systems with Applications: An International Journal
Proceedings of the 2010 Summer Computer Simulation Conference
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
Variable neighborhood search with permutation distance for QAP
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part IV
Variable neighborhood search for the time-dependent vehicle routing problem with soft time windows
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
A simulated annealing heuristic for the truck and trailer routing problem with time windows
Expert Systems with Applications: An International Journal
Variable neighborhood search for location routing
Computers and Operations Research
A heuristic to solve the synchronized log-truck scheduling problem
Computers and Operations Research
Composing fifth species counterpoint music with a variable neighborhood search algorithm
Expert Systems with Applications: An International Journal
Bi-Objective Bus Routing: An Application to School Buses in Rural Areas
Transportation Science
Journal of Computational and Applied Mathematics
Computers and Operations Research
Hi-index | 0.01 |
The purpose of this paper is to present a new deterministic metaheuristic based on a modification of the variable neighborhood search of Mladenovic and Hansen (1997) for solving the vehicle-routing problem with time windows. Results are reported for the standard 100, 200, and 400 customer data sets by Solomon (1987) and Gehring and Homberger (1999), and two real-life problems by Russell (1995). The findings indicate that the proposed procedure outperforms other recent local searches and metaheuristics. In addition, four new best-known solutions were obtained. The proposed procedure is based on a new four-phase approach. In this approach an initial solution is first created using new route-construction heuristics followed by a route-elimination procedure to improve the solutions regarding the number of vehicles. In the third phase the solutions are improved in terms of total traveled distance using four new local-search procedures proposed in this paper. Finally, in phase four, the best solution obtained is improved by modifying the objective function to escape from a local minimum.