Competitive memetic algorithms for arc routing problems

DOI10.1023/B:ANOR.0000039517.35989.6DzbMath1066.90010OpenAlexW2018236017MaRDI QIDQ702720

Wahiba Ramdane-Cherif, Christian Prins, Philippe Lacomme

Publication date: 17 January 2005

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:anor.0000039517.35989.6d

zbMATH Keywords

metaheuristicmemetic algorithmCARPCapacitated Arc Routing Problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (50)

Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition ⋮ An efficiency-based path-scanning heuristic for the capacitated arc routing problem ⋮ An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems ⋮ A memetic algorithm with dynamic population management for an integrated production-distribution problem ⋮ A hybrid metaheuristic approach for the capacitated arc routing problem ⋮ Local search heuristics for sectoring routing in a household waste collection context ⋮ GRASP with evolutionary path-relinking for the capacitated arc routing problem ⋮ Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities ⋮ Approximation schemes for Euclidean vehicle routing problems with time windows ⋮ Integration of routing into a resource-constrained project scheduling problem ⋮ The commodity-split multi-compartment capacitated arc routing problem ⋮ A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW ⋮ A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands ⋮ A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem ⋮ Efficient frameworks for greedy split and new depth first search split procedures for routing problems ⋮ Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems ⋮ Two phased hybrid local search for the periodic capacitated arc routing problem ⋮ Fast upper and lower bounds for a large‐scale real‐world arc routing problem ⋮ The dynamic bowser routing problem ⋮ Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics ⋮ Crossover iterated local search for SDCARP ⋮ A deterministic tabu search algorithm for the capacitated arc routing problem ⋮ A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem ⋮ A Decade of Capacitated Arc Routing ⋮ A variable neighborhood search for the capacitated arc routing problem with intermediate facilities ⋮ Combinatorial optimization and green logistics ⋮ Iterated local search and column generation to solve arc-routing as a permutation set-covering problem ⋮ Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities ⋮ Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions ⋮ An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem ⋮ Capacitated arc routing problem with deadheading demands ⋮ A memetic algorithm for the team orienteering problem ⋮ A GRASP\(\times \)ELS approach for the capacitated location-routing problem ⋮ Combinatorial optimization and green logistics ⋮ Evolutionary algorithms for periodic arc routing problems ⋮ A guided local search procedure for the multi-compartment capacitated arc routing problem ⋮ Lower and upper bounds for the mixed capacitated arc routing problem ⋮ A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem ⋮ A genetic algorithm for a bi-objective capacitated arc routing problem ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ A metaheuristic for the min-max windy rural postman problem with K vehicles ⋮ An improved heuristic for the capacitated arc routing problem ⋮ A variable neighborhood descent algorithm for a real waste collection problem with mobile depots ⋮ Heuristic methods for the sectoring arc routing problem ⋮ Tour splitting algorithms for vehicle routing problems ⋮ A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands ⋮ Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration ⋮ New Notation and Classification Scheme for Vehicle Routing Problems ⋮ A scatter search for the periodic capacitated arc routing problem

This page was built for publication: Competitive memetic algorithms for arc routing problems