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 …

This paper presents an adaptive genetic algorithm (GA) to solve the vehicle routing problem
with time windows (VRPTW) to near optimal solutions. The algorithm employs a unique …

Vehicle routing problem with time windows (VRPTW) is of crucial importance in today's
industries, accounting for a significant portion of many distribution and transportation …

This paper focuses on solving a variant of the vehicle routing problem (VRP) in which a time
window is associated with each customer service and some services require simultaneous …

We present a hybrid search technique based on metaheuristics for approximately solving
the vehicle routing problem with time windows (VRPTW). The approach is two phased; a …

We present a simulated annealing based algorithm for a variant of the vehicle routing
problem (VRP), in which a time window is associated with each client service and some …

This paper develops simulated annealing metaheuristics for the vehicle routing and
scheduling problem with time window constraints. Two different neighborhood structures …

We present an improvement heuristic for vehicle routing problems. The heuristic finds
complex customer interchanges to improve an initial solution. Our approach is modular, thus …

The vehicle routing problem with time windows (VRPTW) is an extension of the well-known
vehicle routing problem with a central depot. The objective function of the VRPTW …

This paper describes a parallel Tabu search heuristic for the Vehicle Routing Problem with
Time Windows. The parallel algorithm is synchronous and runs on a Multiple-Instruction …