Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
The vehicle routing problem
A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
INFORMS Journal on Computing
Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows
Journal of Heuristics
Solving the vehicle routing problem with adaptive memory programming methodology
Computers and Operations Research
A Guided Cooperative Search for the Vehicle Routing Problem with Time Windows
IEEE Intelligent Systems
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
A hybrid evolution strategy for the open vehicle routing problem
Computers and Operations Research
Arc-guided evolutionary algorithm for the vehicle routing problem with time windows
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
This paper presents a hybrid metaheuristic to address the vehicle routing problem with time windows (VRPTW). The VRPTW can be described as the problem of designing least cost routes from a depot to geographically dispersed customers. The routes must be designed such that each customer is visited only once by exactly one vehicle without violating capacity and time window constraints. The proposed solution method is a multi-start local search approach which combines reactively the systematic diversification mechanisms of Greedy Randomized Adaptive Search Procedures with a novel Variable Neighborhood Tabu Search hybrid metaheuristic for intensification search. Experimental results on well known benchmark instances show that the suggested method is both efficient and robust in terms of the quality of the solutions produced.