Abstract
In this paper we present a hybrid technique that applies an ant colony optimization algorithm followed by simulated annealing local search approach to solving the Multi-Depot Periodic Open Capacitated Arc Routing Problem (MDPOCARP). This problem is a new variant of OCARP that has never been studied in the literature and consists of determining optimal routes in each period where each route starts from a given depot, visits a list of required edges and finishes by the last one. The final edge of the route is not required to be a depot. We developed a constructive heuristic, called Nearest Insertion Heuristic (NIH) to build an initial solution. The proposed algorithm is evaluated on three different benchmarks sets and numerical results show that the proposed approach achieves highly efficient results.
Highlights
The Capacitated Arc Routing Problem (CARP) is a hard-combinatorial optimization problem introduced which consists of a network where edges have a positive length and some of the edges are served [1]
The Multi-Depot Periodic Open CARP (MDPOCARP) is a variant of open capacitated arc routing problem (OCARP) in which the customer demands are served throughout planning periods
We propose a Hybrid algorithm based on both the Ant Colony optimization (AC) and the Simulated Annealing (SA) local search algorithm to solve the MDPOCARP
Summary
The Capacitated Arc Routing Problem (CARP) is a hard-combinatorial optimization problem introduced which consists of a network (or graph) where edges have a positive length and some of the edges (so-called required edges) are served [1]. The periodic CARP (PCARP) is a generalization of CARP in which routes are built over M periods that represent predefined schedules for visiting customers. A solution of the PCARP is a set of optimal routes for each planning period so that the both period constraint and capacitated vehicles along routes are satisfied. The Multi-Depot Open CARP (MDOCARP) is an extension of CARP in which vehicles can depart at more than one depot for servicing customers. The Multi-Depot Periodic Open CARP (MDPOCARP) is a variant of OCARP in which the customer demands are served throughout planning periods. In MDPOCARP, there is a frequency f for each customer c indicating how many times within the planning period associated to c, the customer c must be visited
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
