A Heuristic for the Vehicle Routing Problem with Time Windows

Authors:
Roberto Cordone;Roberto Wolfler Calvo
Affiliations:
Dipartimento di Elettronica e Informazione, Politecnico di Milano, Piazza Leonardo da Vinci, 32-20133, Milano, Italy. robert.cordone@polimi.it;Institute for Systems Informatics &/ Safety, Joint Research Centre (JRC) European Commission, via E. Fermi, 1-21020 Ispra, Italy&semi/ Dipartimento di Elettronica e Informazione, Politecnico di ...
Venue:
Journal of Heuristics
Year:
2001

Citing 0
Cited 8

A heuristic approach to the overnight security service problem

Computers and Operations Research
Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration

Journal of Heuristics
A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows

Computational Optimization and Applications
Active guided evolution strategies for large-scale vehicle routing problems with time windows

Computers and Operations Research
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms

Transportation Science
A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows

Journal of Heuristics
An exact algorithm for vehicle routing and scheduling problem of free pickup and delivery service in flight ticket sales companies based on set-partitioning model

Journal of Intelligent Manufacturing
A simulated annealing heuristic for the truck and trailer routing problem with time windows

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a heuristic algorithm to solve the Vehicle Routing Problem with Time Windows. Its framework is a smart combination of three simple procedures: the classical k-opt exchanges improve the solution, an ad hoc procedure reduces the number of vehicles and a second objective function drives the search out of local optima. No parameter tuning is required and no random choice is made: these are the distinguishing features with respect to the recent literature. The algorithm has been tested on benchmark problems which prove it to be more effective than comparable algorithms.