On the Slot Optimization Problem in On-Line Vehicle Routing

On the Slot Optimization Problem in On-Line Vehicle Routing

The capacitated vehicle routing problem with time windows (cVRPTW) is concerned with finding optimal tours for vehicles that deliver goods to customers within a specific time slot (or time window), respecting the maximal capacity of each vehicle. The on-line variant of the cVRPTW arises for instance in online shopping services of supermarket chains: customers choose a delivery time slot for the...

On the capacitated vehicle routing problem

We consider the Vehicle Routing Problem, in which a fixed fleet of delivery vehicles of uniform capacity must service known customer demands for a single commodity from a common depot at minimum transit cost. This difficult combinatorial problem contains both the Bin Packing Problem and the Traveling Salesman Problem (TSP) as special cases and conceptually lies at the intersection of these two ...

Vehicle Routing Problem Vehicle Routing Problem

ing and non-profit use of the material is permitted with credit to the source. Statements and opinions expressed in the chapters are these of the individual contributors and not necessarily those of the editors or publisher. No responsibility is accepted for the accuracy of information contained in the published articles. Publisher assumes no responsibility liability for any damage or injury to...

The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization

Solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization

One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...