Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees

@article{Amberg2000MultipleCC,
  title={Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees},
  author={Anita Amberg and Wolfgang Domschke and Stefan Vo\ss},
  journal={European Journal of Operational Research},
  year={2000},
  volume={124},
  pages={360-376}
}
In the capacitated arc routing problem with multiple centers (M-CARP) the objective is to ®nd routes starting from the given depots or centers such that each required arc is served, capacity (and usually additional) constraints are satis®ed and total travel cost is minimized. In this paper we consider a heuristic transformation of the M-CARP into a multiple center capacitated minimum spanning tree problem with arc constraints, that we call arc-constrained CMST. An algorithm for determining… CONTINUE READING
31 Citations
40 References
Similar Papers

Citations

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

References

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

Ein ̄exibles Verfahren zur L

  • P. Zhu
  • 1989
Highly Influential
10 Excerpts

The CARP ± a heuristic algorithm

  • E. Benavent, V. Campos, A. Corberan, E. Mota
  • Questiio 14
  • 1990
Highly Influential
3 Excerpts

Experience with a cutting plane algorithm for the capacitated spanning tree problem

  • L. Hall
  • INFORMS Journal on Computing
  • 1996
2 Excerpts

Similar Papers

Loading similar papers…