In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for...
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
Memetic algorithms usually employ long running times, since local search is performed every time a new solution is generated. Acceleration of a memetic algorithm requires focusing ...
This study considers a relaxation of the truck and trailer routing problem (TTRP), called the relaxed truck and trailer routing problem (RTTRP). In the TTRP, the number of availab...
The vehicle routing problem (VRP) is a variant of the familiar travelling salesperson problem (TSP). In the VRP we are to perform a number of visits, using a number of vehicles of ...