Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem

DOI10.1287/opre.1120.1079zbMath1257.90008OpenAlexW2155597893MaRDI QIDQ4904581

Stefan Irnich, Claudia Bode

Publication date: 30 January 2013

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

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

zbMATH Keywords

vehicle routingcutting-plane algorithmbranch-and-price algorithm

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (20)

Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition ⋮ The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem ⋮ An approach to the asymmetric multi-depot capacitated arc routing problem ⋮ A hybrid metaheuristic approach for the capacitated arc routing problem ⋮ Improved bounds for large scale capacitated arc routing problem ⋮ Pricing routines for vehicle routing with time windows on road networks ⋮ Lane covering with partner bounds in collaborative truckload transportation procurement ⋮ Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities ⋮ An improved multi-objective framework for the rich arc routing problem ⋮ Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem ⋮ A generic exact solver for vehicle routing and related problems ⋮ Improved lower bounds and exact algorithm for the capacitated arc routing problem ⋮ A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand ⋮ Iterated local search and column generation to solve arc-routing as a permutation set-covering problem ⋮ Branch-price-and-cut for the mixed capacitated general routing problem with time windows ⋮ Large multiple neighborhood search for the clustered vehicle-routing problem ⋮ Exact solution of the soft-clustered vehicle-routing problem ⋮ Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes ⋮ Dual Inequalities for Stabilized Column Generation Revisited ⋮ Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem

Uses Software

• CVRPSP

This page was built for publication: Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem