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 …

To survive under the ever increasing competitive and global pressures to operate more
efficiently, transportation companies are obliged to adopt a collaborative focus. Various …

We present a unified heuristic which is able to solve five different variants of the vehicle
routing problem: the vehicle routing problem with time windows (VRPTW), the capacitated …

In this paper, a new variant of the Particle Swarm Optimization (PSO) algorithm is proposed
for the solution of the Vehicle Routing Problem with Time Windows (VRPTW). Three different …

Vehicle routing problem with time windows (VRPTW) is a pivotal problem in logistics domain
as it possesses multiobjective characteristics in real-world applications. Literature contains a …

Heuristic search procedures that aspire to find global optimal solutions to hard combinatorial
optimization problems usually require some type of diversification to overcome local …

This paper concerns a Simultaneous Delivery and Pickup Problem with Time Windows
(SDPPTW). A mixed binary integer programming model was developed for the problem and …

Multi-start methods strategically sample the solution space of an optimization problem. The
most successful of these methods have two phases that are alternated for a certain number …

The Capacitated Vehicle Routing Problem with Time Windows is an important combinatorial
optimization problem consisting in the determination of the set of routes of minimum distance …

We propose an optimization approach to the routing and scheduling problem for a
heterogeneous transportation network that considers (i) stochastic values of demand and …