A tabu scatter search metaheuristic for the arc routing problem
Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
A Genetic Algorithm for the Capacitated Arc Routing Problem and Its Extensions
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
A Tabu Search Heuristic for the Capacitated Arc Routing Problem
Operations Research
A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
Transportation Science
A genetic algorithm for a bi-objective capacitated arc routing problem
Computers and Operations Research
The bi-objective covering tour problem
Computers and Operations Research
A deterministic tabu search algorithm for the capacitated arc routing problem
Computers and Operations Research
An improved heuristic for the capacitated arc routing problem
Computers and Operations Research
Improved memetic algorithm for capacitated arc routing problem
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Memetic algorithm with extended neighborhood search for capacitated arc routing problems
IEEE Transactions on Evolutionary Computation
An approximate ϵ-constraint method for a multi-objective job scheduling in the cloud
Future Generation Computer Systems
Hi-index | 0.00 |
The Undirected Capacitated Arc Routing Problem is a classical arc routing problem arising in practical situations (road maintenance, garbage collection, mail delivery, school bus routing, etc.) with the aim of minimizing the total transportation cost of a set of routes that service a set of required edges under capacity constraints. Most of logistic companies are interested in minimizing not only the total transportation cost, they also are focused in managing the deliveries on the edges, in such a way that the duration of the longest trip does not exceed an upper time limit, to take into account the working day duration of the drivers. Moreover, all the demands of the required edges are satisfied by considering a limited number of vehicles at the depot. In this paper, the Multi-objective Undirected Capacitated Arc Routing Problem where different and competitive objectives are taken into account simultaneously, is defined and studied. Three objectives are considered in order to: minimize the total transportation cost, the longest route (makespan) and the number of vehicle used to service all the required edges (i.e., the total number of routes). To find a set of solutions belonging to the optimal pareto front, an optimization-based heuristic procedure is proposed and its performance is evaluated on a set of benchmark instances.