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 …

This paper is the first part of a comprehensive survey on pickup and delivery problems.
Basically, two problem classes can be distinguished. The first class, discussed in this paper …

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 …

The traveling salesman problem (TSP) consists of finding the shortest way between cities,
which passes through all cities and returns to the starting point, given the distance between …

Vehicle routing problem with time windows (VRPTW) is a well-known NP-hard combinatorial
optimization problem that is crucial for transportation and logistics systems. Even though the …

A parallel simulated annealing algorithm to solve the vehicle routing problem with time
windows is presented. The objective is to find the best possible solutions to some well …

Proliferation of multi-national corporations and extremely competitive business
environments have led to an unprecedented demand for third-party logistics services …

We generalize the standard vehicle routing problem with time windows by allowing both
traveling times and traveling costs to be time-dependent functions. In our algorithm, we use …

Multi-objective evolutionary algorithm based on decomposition (MOEA/D) provides an
excellent algorithmic framework for solving multi-objective optimization problems. It …