A Tabu Search Heuristic for the Capacitated arc Routing Problem

DOI10.1287/OPRE.48.1.129.12455zbMath1106.90384OpenAlexW2041183433MaRDI QIDQ4530642

Gilbert Laporte, Alain Hertz, Michel Mittaz

Publication date: 4 June 2002

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

Full work available at URL: https://doi.org/10.1287/opre.48.1.129.12455

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (55)

A guided local search heuristic for the capacitated arc routing problem ⋮ Heuristic search to the capacitated clustering problem ⋮ Multicriteria scheduling using fuzzy theory and tabu search ⋮ A matheuristic for the team orienteering arc routing problem ⋮ A hybrid metaheuristic approach for the capacitated arc routing problem ⋮ The capacitated arc routing problem with refill points ⋮ GRASP with evolutionary path-relinking for the capacitated arc routing problem ⋮ A vehicle routing problem with flexible time windows ⋮ Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs ⋮ Arc routing problems with time-dependent service costs ⋮ The commodity-split multi-compartment capacitated arc routing problem ⋮ Tabu search for the BWC problem ⋮ Efficient frameworks for greedy split and new depth first search split procedures for routing problems ⋮ A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem ⋮ An improved multi-objective framework for the rich arc routing problem ⋮ 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 ⋮ Vehicle routing with dynamic travel times: a queueing approach ⋮ New mathematical models of the generalized vehicle routing problem and extensions ⋮ A branch-and-price algorithm for the windy rural postman problem ⋮ The capacitated arc routing problem with intermediate facilities ⋮ An efficient transformation of the generalized vehicle routing problem ⋮ 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 ⋮ Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity ⋮ 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 ⋮ The undirected capacitated arc routing problem with profits ⋮ Vehicle routing with stochastic time-dependent travel times ⋮ 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 ⋮ Self-imposed time windows in vehicle routing problems ⋮ 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 ⋮ Road network monitoring: algorithms and a case study ⋮ A districting-based heuristic for the coordinated capacitated arc routing problem ⋮ The open capacitated arc routing problem ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ An improved heuristic for the capacitated arc routing problem ⋮ A variable neighborhood descent algorithm for a real waste collection problem with mobile depots ⋮ Tour splitting algorithms for vehicle routing problems ⋮ Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees ⋮ Bilayer local search enhanced particle swarm optimization for the capacitated vehicle routing problem ⋮ A scatter search for the periodic capacitated arc routing problem ⋮ Solving capacitated arc routing problems using a transformation to the CVRP ⋮ Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care ⋮ A cutting plane algorithm for the capacitated arc routing problem

This page was built for publication: A Tabu Search Heuristic for the Capacitated arc Routing Problem