A Tabu Scatter Search Metaheuristic for the Arc Routing Problem

@inproceedings{Greistorfer2002ATS,
  title={A Tabu Scatter Search Metaheuristic for the Arc Routing Problem},
  author={Peter Greistorfer},
  year={2002}
}
We consider a special routing problem which has a variety of practical applications. In a graph-theoretic context it is known as the Capacitated Chinese Postman Problem. Given an undirected network in which the demand is located on edges, the goal is to determine a least-cost schedule of routes. The route demands, which must not exceed the vehicle capacity, are serviced by a fleet of vehicles which is located at a single depot node. We present a metaheuristic based on a Tabu Search procedure… CONTINUE READING
52 Citations
43 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 52 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 43 references

Computational experiments with heuristics for a capacitated arc routing problem

  • P. Greistorfer
  • Operations research proceedings
  • 1995
Highly Influential
7 Excerpts

A comparison of heuristics for the capacitated Chinese postman problem. Master’s thesis, University of Maryland

  • J. DeArmon
  • College Park MD
  • 1981
Highly Influential
4 Excerpts

The optimum traversal of a graph

  • N. Christofides
  • Omega
  • 1973
Highly Influential
10 Excerpts

Genetic algorithms, evolutionary algorithms and scatter search: Changing tides and untapped potentials

  • F. Glover
  • Tech. rep., Graduate School of Business…
  • 1998
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…