This paper tackles a new problem called Stochastic Capacitated Arc Routing Problem (SCARP), derived from the CARP by randomizing the demands. It is raised by applications like urban waste collection, in which the amount on each arc is a random variable. In that case, the trips computed by any algorithm based on estimated demands can be deeply affected on the field, due to additional moves to th...

The capacitated arc routing problem is a very important with many practical applications. This paper focuses on the large scale problem. Traditional solution optimization approaches usually fail because of their poor scalability. divide-and-conquer strategy has achieved great success in solving problems by decomposing original into smaller sub-problems and them separately. For routing, commonly...

The cuckoo search algorithm is a novel metaheuristic based on the reproduction behavior of some cuckoo species in combination with the Lévy flight behavior of some birds and fruit flies. It has been applied to a wide range of optimization problems with good performance such as a TSP; nonetheless, it has yet to be applied to the vehicle routing problem, specifically the capacitated vehicle routi...

This paper concerns the Split Delivery Vehicle Routing Problem (SDVRP). This problem is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) since the customers’ demands are allowed to be split. We deal with the cases where the fleet is unlimited (SDVRP-UF) and limited (SDVRP-LF). In order to solve them, we implemented a multi-start Iterated Local Search (ILS) based heuristic that inc...

This paper presents two ideas to guide a tabu search algorithm for the Capacitated Arc Routing Problem to a promising region of the solution space. Both ideas involve edge-reordering, although they work in different ways. One of them aims to directly tackle deadheading cycles, and the other tries to reorder edges with the aim of extending a scope of solutions that can be reached from a given so...

This paper presents an approximate algorithm based on distributed learning automata for solving capacitated vehicle routing problem. The vehicle routing problem (VRP) is an NPhard problem and capacitated vehicle routing problem variant (CVRP) is considered here. This problem is one of the NP-hard problems and for this reason many approximate algorithms have been designed for solving it. Distrib...