Approximate solutions for the capacitated arc routing problem
From MaRDI portal
Publication:1121808
DOI10.1016/0305-0548(89)90044-0zbMath0674.90099OpenAlexW2017695941MaRDI QIDQ1121808
Publication date: 1989
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(89)90044-0
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)
Related Items
An efficiency-based path-scanning heuristic for the capacitated arc routing problem, A capacitated general routing problem on mixed networks, Algorithms for the Chinese postman problem on mixed networks, 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, Routing problems: A bibliography, New lower bounds for the Capacitated Arc Routing Problem, Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics, A deterministic tabu search algorithm for the capacitated arc routing problem, Approximate solutions for the maximum benefit chinese postman problem, The open capacitated arc routing problem, Augment-insert algorithms for the capacitated arc routing problem, An improved heuristic for the capacitated arc routing problem, Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees, Solving capacitated arc routing problems using a transformation to the CVRP, A cutting plane algorithm for the capacitated arc routing problem
Cites Work
