A general heuristic for vehicle routing problems
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
Discrete Applied Mathematics
A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
Computers and Operations Research
A heuristic method for the inventory routing problem with time windows
Expert Systems with Applications: An International Journal
Guided ejection search for the pickup and delivery problem with time windows
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
Computers and Operations Research
Computers and Operations Research
Hi-index | 0.00 |
We suggest an efficient route minimization heuristic for the vehicle routing problem with time windows. The heuristic is based on the ejection pool, powerful insertion and guided local search strategies. Experimental results on the Gehring and Homberger's benchmarks demonstrate that our algorithm outperforms previous approaches and found 18 new best-known solutions.