The Capacitated Arc Routing Problem: Valid Inequalities and Facets
Computational Optimization and Applications
Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
A cutting plane algorithm for the capacitated arc routing problem
Computers and Operations Research
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 Hierarchical Relaxations Lower Bound for the Capacitated Arc Routing Problem
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 3 - Volume 3
Lower and upper bounds for the mixed capacitated arc routing problem
Computers and Operations Research
New lower bound for the capacitated arc routing problem
Computers and Operations Research
A genetic algorithm for a bi-objective capacitated arc routing problem
Computers and Operations Research
A deterministic tabu search algorithm for the capacitated arc routing problem
Computers and Operations Research
Exploiting sparsity in pricing routines for the capacitated arc routing problem
Computers and Operations Research
An improved heuristic for the capacitated arc routing problem
Computers and Operations Research
A global repair operator for capacitated arc routing problem
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Solving capacitated arc routing problems using a transformation to the CVRP
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
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
Performance assessment of multiobjective optimizers: an analysis and review
IEEE Transactions on Evolutionary Computation
Decomposition-Based Memetic Algorithm for Multiobjective Capacitated Arc Routing Problem
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.01 |
The Multi-objective Undirected Capacitated Arc Routing Problem (MUCARP) is the optimization problem aimed at finding the best strategy for servicing a subset of clients localized along the links of a logistic network, by using a fleet of vehicles and optimizing more than one objective. In general, the first goal consists in minimizing the total transportation cost, and in this case the problem brings back to the well-known Undirected Capacitated Arc Routing Problem (UCARP). The motivation behind the study of the MUCARP lies in the study of real situations where companies working in the logistic distribution field deal with complex operational strategies, in which different actors (trucks, drivers, customers) have to be allocated within an unified framework by taking into account opposite needs and different employment contracts. All the previous considerations lead to the MUCARP as a benchmark optimization problem for modeling practical situations. In this paper, the MUCARP is heuristically tackled. In particular, three competitive objectives are minimized at the same time: the total transportation cost, the longest route cost (makespan) and the number of vehicles (i.e., the total number of routes). An approximation of the optimal Pareto front is determined through an optimization-based heuristic procedure, whose performances are tested and analyzed on classical benchmark instances.