Introduction to algorithms
Augment-insert algorithms for the capacitated arc routing problem
Computers and Operations Research
Routing winter gritting vehicles
CO89 Selected papers of the conference on Combinatorial Optimization
A heuristic and lower bound for a multi-depot routing problem
Computers and Operations Research
A tabu search heuristic for the multi-depot vehicle routing problem
Computers and Operations Research
A polyhedral approach to the asymmetric traveling salesman problem
Management Science
The Capacitated Arc Routing Problem: Valid Inequalities and Facets
Computational Optimization and Applications
A Subpath Ejection Method for the Vehicle Routing Problem
Management Science
LEARNABLE EVOLUTION MODEL: Evolutionary Processes Guided by Machine Learning
Machine Learning - Special issue on multistrategy learning
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
Privatized rural postman problems
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
Heuristics for a dynamic rural postman problem
Computers and Operations Research
Statistical Comparisons of Classifiers over Multiple Data Sets
The Journal of Machine Learning Research
A deterministic tabu search algorithm for the capacitated arc routing problem
Computers and Operations Research
A hybrid genetic algorithm for the multi-depot vehicle routing problem
Engineering Applications of Artificial Intelligence
Arc-guided evolutionary algorithm for the vehicle routing problem with time windows
IEEE Transactions on Evolutionary Computation
A global repair operator for capacitated arc routing problem
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Memetic algorithm with extended neighborhood search for capacitated arc routing problems
IEEE Transactions on Evolutionary Computation
Robust route optimization for gritting/salting trucks: a CERCIA experience
IEEE Computational Intelligence Magazine
Learning with case-injected genetic algorithms
IEEE Transactions on Evolutionary Computation
Efficient solution of capacitated arc routing problems with a limited computational budget
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
The double layer optimization problem to express logistics systems and its heuristic algorithm
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
The capacitated arc routing problem (CARP) is a challenging vehicle routing problem with numerous real world applications. In this paper, an extended version of CARP, the multidepot capacitated arc routing problem (MCARP), is presented to tackle practical requirements. Existing CARP heuristics are extended to cope with MCARP and are integrated into a novel evolutionary framework: the initial population is constructed either by random generation, the extended random path-scanning heuristic, or the extended random Ulusoy's heuristic. Subsequently, multiple distinct operators are employed to perform selection, crossover, and mutation. Finally, the partial replacement procedure is implemented to maintain population diversity. The proposed evolutionary approach (EA) is primarily characterized by the exploitation of attributes found in near-optimal MCARP solutions that are obtained throughout the execution of the algorithm. Two techniques are employed toward this end: the performance information of an operator is applied to select from a range of operators for selection, crossover, and mutation. Furthermore, the arc assignment priority information is employed to determine promising positions along the genome for operations of crossover and mutation. The EA is evaluated on 107 instances with up to 140 nodes and 380 arcs. The experimental results suggest that the integrated evolutionary framework significantly outperforms these individual extended heuristics.