Adaptive large neighborhood search for the commodity constrained split delivery VRP

In this paper we showed that: using our GELATO hybrid framework, it is pos- sible to combine a given CP model into a LS framework in a straightforward way; in particular, we can use

Moreover, each solution must be such that : (1) each route starts and ends at the depot ; (2) the total quantity of commodities delivered by each vehicle does not exceed the

We also propose two other moves : (6) erase route : from a given route, remove the customer commodities until no other route has capacity to accept another cus- tomer commodity ;

We also propose two other moves: (6) erase route: from a given route, remove the customer commodities until no other route has capacity to accept another customer commodity; and

The problems we are interested in are the problems which allow to visit a subset of the cities: Generalized Traveling Salesman Problem (GTSP) [5], Traveling Salesman Problems

The goal is to design a least-cost route for the vehicle, starting from and ending at a central depot, that serves all customer requests while satisfying the side constraints,

Based on a given ordering, each customer is considered in turn and inserted at its best feasible insertion place over every route in every workday, including a new (empty) workday

When solving the CTP, the Selector operator splits a giant tour (GT), which is a permutation of all n vertices that can be in the tour, into subsequences of visited and