New lower bounds for the Capacitated Arc Routing Problem

DOI10.1002/net.3230180305zbMath0655.90084OpenAlexW2074271250MaRDI QIDQ3802908

Wen Lea Pearn

Publication date: 1988

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230180305

zbMATH Keywords

minimal costChinese postmanCapacitated Arc Routing Problemundirected networkfleet of vehiclesMatching Lower BoundNodes Scanning Lower Bound

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (10)

GRASP with evolutionary path-relinking for the capacitated arc routing problem ⋮ On matchings, T‐joins, and arc routing in road networks ⋮ Improved lower bounds and exact algorithm for the capacitated arc routing problem ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics ⋮ Approximate solutions for the maximum benefit chinese postman problem ⋮ New lower bound for the capacitated arc routing problem ⋮ The open capacitated arc routing problem ⋮ Robust drone selective routing in humanitarian transportation network assessment ⋮ Solving capacitated arc routing problems using a transformation to the CVRP ⋮ A cutting plane algorithm for the capacitated arc routing problem

Cites Work

• Approximate solutions for the capacitated arc routing problem
• Transforming arc routing into node routing problems

This page was built for publication: New lower bounds for the Capacitated Arc Routing Problem