A cutting plane algorithm for the capacitated arc routing problem

DOI10.1016/S0305-0548(02)00046-1MaRDI QIDQ1870825zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The capacitated arc routing problem: Valid inequalities and facets
• The capacitated arc routing problem. A heuristic algorithm
• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• The Capacitated Arc Routing Problem: Lower bounds
• Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem

Cites work

• scientific article; zbMATH DE number 1703887 (Why is no real title available?)
• scientific article; zbMATH DE number 4068590 (Why is no real title available?)
• scientific article; zbMATH DE number 558539 (Why is no real title available?)
• scientific article; zbMATH DE number 1520350 (Why is no real title available?)
• scientific article; zbMATH DE number 1568940 (Why is no real title available?)
• scientific article; zbMATH DE number 1568941 (Why is no real title available?)
• scientific article; zbMATH DE number 232390 (Why is no real title available?)
• scientific article; zbMATH DE number 956790 (Why is no real title available?)
• A Tabu Search Heuristic for the Capacitated arc Routing Problem
• Approximate solutions for the capacitated arc routing problem
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Arc Routing Problems, Part II: The Rural Postman Problem
• Capacitated arc routing problems
• New lower bounds for the Capacitated Arc Routing Problem
• Odd Minimum Cut-Sets and b-Matchings
• The Capacitated Arc Routing Problem: Lower bounds
• The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
• The capacitated arc routing problem: Valid inequalities and facets

Cited in

(45)

• A genetic algorithm for a bi-objective capacitated arc routing problem
• The mixed capacitated general routing problem under uncertainty
• A scatter search for the periodic capacitated arc routing problem
• Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
• An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems
• Exploiting sparsity in pricing routines for the capacitated arc routing problem
• Tour splitting algorithms for vehicle routing problems
• Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
• Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems
• Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
• A decade of capacitated arc routing
• Local search for the undirected capacitated arc routing problem with profits
• An approach to the asymmetric multi-depot capacitated arc routing problem
• Two-phase branch-and-cut for the mixed capacitated general routing problem
• Modeling and solving the mixed capacitated general routing problem
• The undirected capacitated general routing problem with profits
• Improved bounds for large scale capacitated arc routing problem
• GRASP with evolutionary path-relinking for the capacitated arc routing problem
• Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem
• The open capacitated arc routing problem
• A cutting plane algorithm for the general routing problem
• The undirected capacitated arc routing problem with profits
• Lower bounds for the mixed capacitated arc routing problem
• A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands
• Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
• Recent results on arc routing problems: an annotated bibliography
• A deterministic tabu search algorithm for the capacitated arc routing problem
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
• A guided local search heuristic for the capacitated arc routing problem
• Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration
• Cut-first branch-and-price-second for the capacitated arc-routing problem
• An exact algorithm for the capacitated arc routing problem with deadheading demand
• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• A parameterized lower bounding method for the open capacitated arc routing problem
• An improved heuristic for the capacitated arc routing problem
• Crossover iterated local search for SDCARP
• A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
• Fast upper and lower bounds for a large‐scale real‐world arc routing problem
• An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
• A parallel insert method for the capacitated arc routing problem
• Arc routing for parking enforcement officers: exact and heuristic solutions
• Evolutionary algorithms for periodic arc routing problems
• Lower and upper bounds for the mixed capacitated arc routing problem
• Capacitated arc routing problem with deadheading demands
• Solving capacitated arc routing problems using a transformation to the CVRP

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: A cutting plane algorithm for the capacitated arc routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870825)