Approximate solutions for the capacitated arc routing problem

DOI10.1016/0305-0548(89)90044-0zbMATH Open0674.90099OpenAlexW2017695941MaRDI QIDQ1121808FDOQ1121808

Authors: Wen Lea Pearn 

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

Recommendations

• Augment-insert algorithms for the capacitated arc routing problem
• An approximation algorithm for the capacitated arc routing problem
• An improved heuristic for the capacitated arc routing problem
• A decade of capacitated arc routing
• The capacitated arc routing problem. A heuristic algorithm

zbMATH Keywords

computational complexityheuristic algorithmscapacitated arc routingnear-optimal solutions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Matching, Euler tours and the Chinese postman
• Capacitated arc routing problems
• Approximate solutions for the maximum benefit chinese postman problem
• The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
• A parallel insert method for the capacitated arc routing problem

Cited In (46)

• Augment-insert algorithms for the capacitated arc routing problem
• The capacitated arc routing problem. A heuristic algorithm
• Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
• New large-scale data instances for CARP and new variations of CARP
• An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems
• The min-max close-enough arc routing problem
• Exploiting sparsity in pricing routines for the capacitated arc routing problem
• Variants of the capacitated arc routing problem
• Title not available (Why is that?)
• Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
• A heuristic method for the capacitated arc routing problem with refill points and multiple loads
• Efficient algorithms under dynamic graphs to solve the capacitated arc routing problem with feasible sparse graph
• New lower bounds for the Capacitated Arc Routing Problem
• Algorithms for the Chinese postman problem on mixed networks
• An efficiency-based path-scanning heuristic for the capacitated arc routing problem
• A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
• A decade of capacitated arc routing
• The capacitated arc routing problem: heuristics
• Title not available (Why is that?)
• An approach to the asymmetric multi-depot capacitated arc routing problem
• The mixed capacitated arc routing problem with non-overlapping routes
• Improving robustness of solutions to arc routing problems
• Improved bounds for large scale capacitated arc routing problem
• GRASP with evolutionary path-relinking for the capacitated arc routing problem
• Constant-factor approximations for capacitated arc routing without triangle inequality
• The open capacitated arc routing problem
• Approximate solutions for the maximum benefit chinese postman problem
• An exact algorithm for the capacitated arc routing problem with deadheading demand
• Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
• 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
• A capacitated general routing problem on mixed networks
• The capacitated arc routing problem: exact algorithms
• Routing problems: A bibliography
• The fleet size and mix problem for capacitated arc routing
• The capacitated arc routing problem: Valid inequalities and facets
• Effects of update frequencies in a dynamic capacitated arc routing problem
• An improved heuristic for the capacitated arc routing problem
• An approximation algorithm for the capacitated arc routing problem
• A cutting plane algorithm for the capacitated arc routing problem
• A parallel insert method for the capacitated arc routing problem
• Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
• The capacitated arc routing problem with refill points
• Capacitated arc routing problem with deadheading demands
• Solving capacitated arc routing problems using a transformation to the CVRP

This page was built for publication: Approximate solutions 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 Q1121808)