A cutting plane algorithm for the capacitated arc routing problem

From MaRDI portal
Publication:1870825

DOI10.1016/S0305-0548(02)00046-1zbMath1026.90014OpenAlexW2060846245MaRDI QIDQ1870825

Enrique Benavent, José-Manuel Belenguer

Publication date: 14 May 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(02)00046-1


zbMATH Keywords

lower boundsarc routingpostman problems


Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)


Related Items

A guided local search heuristic for the capacitated arc routing problem ⋮ Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition ⋮ The mixed capacitated general routing problem under uncertainty ⋮ An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems ⋮ Two-phase branch-and-cut for the mixed capacitated general routing problem ⋮ An approach to the asymmetric multi-depot capacitated arc routing problem ⋮ Improved bounds for large scale capacitated arc routing problem ⋮ 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 ⋮ Modeling and solving the mixed capacitated general routing problem ⋮ A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands ⋮ Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems ⋮ Improved lower bounds and exact algorithm for the capacitated arc routing problem ⋮ Fast upper and lower bounds for a large‐scale real‐world arc 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 Decade of Capacitated Arc Routing ⋮ A variable neighborhood search for the capacitated arc routing problem with intermediate facilities ⋮ Iterated local search and column generation to solve arc-routing as a permutation set-covering problem ⋮ The undirected capacitated general routing problem with profits ⋮ Local search for the undirected capacitated arc routing problem with profits ⋮ An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem ⋮ Capacitated arc routing problem with deadheading demands ⋮ The undirected capacitated arc routing problem with profits ⋮ Evolutionary algorithms for periodic arc routing problems ⋮ Lower and upper bounds for the mixed capacitated arc routing problem ⋮ A genetic algorithm for a bi-objective capacitated arc routing problem ⋮ The open capacitated arc routing problem ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem ⋮ An improved heuristic for the capacitated arc routing problem ⋮ Exploiting sparsity in pricing routines for the capacitated arc routing problem ⋮ Arc routing for parking enforcement officers: exact and heuristic solutions ⋮ Lower bounds for the mixed capacitated 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 ⋮ A scatter search for the periodic capacitated arc routing problem ⋮ Solving capacitated arc routing problems using a transformation to the CVRP


Uses Software


Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1870825&oldid=14262638"
Powered by MediaWiki