subject to the service level constraint. Integer linear programming formulations are proposed and tested using ILOG CPLEX. An iterated local search algorithm is also developed to solve the introduced problem....

We address the Open Vehicle Routing Problem (OVRP), a variant of the classical (Capacitated and Distance Constrained) Vehicle Routing Problem (VRP) in which the vehicles are not required to

return to the depot after ...

A Local Search procedure for the Open vehicle Routing Problem...

than once consecutively. In this paper, we develop two local search heuristics to find high-quality solutions to the three GCSP variants. In order to test the proposed algorithms, we generated datasets based on TSP Library instances. Since the CSP...

cost, a detour cost and a drop cost. We have developed a tailored Iterated Local Search (ILS) algorithm which handles the special features of the problem. The efficiency of the ILS was demonstrated by obtaining all best known solutions on a set...

We address the Open Vehicle Routing Problem (OVRP),

a variant of the \\classical" Vehicle Routing Problem (VRP) in which

the vehicles are not required to return to the depot after completing

their ...