Cut-first branch-and-price-second for the capacitated arc-routing problem

DOI10.1287/OPRE.1120.1079MaRDI QIDQ4904581zbMATH OpenOpenAlexFDO

Authors Claudia Bode, Stefan Irnich

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

branch-and-price algorithmcutting-plane algorithmvehicle routing

Mathematics Subject Classification ID

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

Recommendations

• Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem
• A cutting plane algorithm for the capacitated arc routing problem
• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• Exploiting sparsity in pricing routines for the capacitated arc routing problem
• The capacitated arc routing problem: exact algorithms

Cited in

(30)

• Exploiting sparsity in pricing routines for the capacitated arc routing problem
• A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
• Lane covering with partner bounds in collaborative truckload transportation procurement
• 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
• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes
• Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
• A generic exact solver for vehicle routing and related problems
• A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
• Exact solution of the soft-clustered vehicle-routing problem
• Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
• Dual inequalities for stabilized column generation revisited
• Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem
• A branch-and-price algorithm for capacitated arc routing problem with flexible time windows
• 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
• Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
• The capacitated arc routing problem: exact algorithms
• An improved multi-objective framework for the rich arc routing problem
• An updated annotated bibliography on arc routing problems
• Aesthetic considerations for the min-max K-windy rural postman problem
• A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem
• Divide-and-conquer initialization and mutation operators for the large-scale mixed capacitated arc routing problem
• A tutorial on Branch-Price-and-Cut algorithms
• Smart selective navigator (SSN): enhancing urban winter road maintenance through optimized arc routing with hard turn restrictions

Describes a project that uses

Uses Software

• CVRPSP

This page was built for publication: Cut-first branch-and-price-second 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 Q4904581)