This paper surveys the research on the metaheuristics for the Vehicle Routing Problem with
Time Windows (VRPTW). The VRPTW can be described as the problem of designing least …

Publisher Summary This chapter discusses some of the most important vehicle routing
problem types. The vehicle routing problem lies at the heart of distribution management. It is …

Faced with the challenge of solving hard optimization problems that abound in the real
world, classical methods often encounter great difficulty. Vitally important applications in …

Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

This paper presents a unified tabu search heuristic for the vehicle routing problem with time
windows and for two important generalizations: the periodic and the multi-depot vehicle …

ABSTRACT College of Business, CB 419 University of Colorado Boulder, CO 80309 email:
Fred. Glover@ colorado. edu Tabu search (TS) has provided advances for solving difficult …

Abstract The Vehicle Routing Problem with Time windows (VRPTW) is an extension of the
capacity constrained Vehicle Routing Problem (VRP). The VRPTW is NP-Complete and …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

In this paper, we propose a metaheuristic to solve the pickup and delivery problem with time
windows. Our approach is a tabu-embedded simulated annealing algorithm which restarts a …

This paper presents a survey of the research on the Vehicle Routing Problem with Time
Windows (VRPTW), an extension of the Capacitated Vehicle Routing Problem. In the …