{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T15:25:25Z","timestamp":1784906725962,"version":"3.55.0"},"reference-count":39,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s0377-2217(99)00170-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:56:12Z","timestamp":1027605372000},"page":"360-376","source":"Crossref","is-referenced-by-count":70,"title":["Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees"],"prefix":"10.1016","volume":"124","author":[{"given":"Anita","family":"Amberg","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wolfgang","family":"Domschke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00170-8_BIB1","doi-asserted-by":"crossref","unstructured":"Aarts, E., Korst J., 1989. Simulated annealing and Boltzman machines. Wiley, Chichester","DOI":"10.1111\/j.1467-9574.1989.tb01245.x"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB2","first-page":"9","article-title":"Capacitated minimum spanning trees: Algorithms using intelligent search","volume":"1","author":"Amberg","year":"1996","journal-title":"Combinatorial Optimization: Theory and Practice"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB3","doi-asserted-by":"crossref","unstructured":"Assad, A.A., Golden, B.L., 1995. Arc routing methods and applications. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (Eds.), Network Routing. Handbooks in OR\/MS, vol. 8, Elsevier, Amsterdam, pp. 375\u2013483","DOI":"10.1016\/S0927-0507(05)80109-4"},{"issue":"1\u20133","key":"10.1016\/S0377-2217(99)00170-8_BIB4","first-page":"107","article-title":"The CARP \u2013 a heuristic algorithm","volume":"14","author":"Benavent","year":"1990","journal-title":"Questiio"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0305-7097(75)90003-4","article-title":"A taxonomic structure for vehicle routing and scheduling problems","volume":"1","author":"Bodin","year":"1975","journal-title":"Computers and Urban Society"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0167-6377(84)90049-X","article-title":"A parallel insert method for the capacitated arc routing problem","volume":"3","author":"Chapleau","year":"1984","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB7","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1016\/0305-0483(73)90089-3","article-title":"The optimum traversal of a graph","volume":"1","author":"Christofides","year":"1973","journal-title":"OMEGA"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB8","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","article-title":"Scheduling of vehicles from a central depot to a number of delivery points","volume":"12","author":"Clarke","year":"1964","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerische Mathematik"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB10","unstructured":"Durth, W., Hanke, H., 1984. Optimierte Routenplanung f\u00fcr den Winterdienst der Stra\u00dfenmeistereien Reichelsheim, Alsfeld und K\u00f6nigstein. Untersuchungen f\u00fcr das Hessische Landesamt f\u00fcr Stra\u00dfenbau, Darmstadt"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB11","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/BF01580113","article-title":"Matching, Euler tours and the Chinese postman","volume":"5","author":"Edmonds","year":"1973","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB12","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1147\/sj.53.0142","article-title":"On teleprocessing system design","volume":"5","author":"Esau","year":"1966","journal-title":"IBM Systems Journal"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB13","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/322358.322367","article-title":"Formulations and algorithms for the capacitated minimal directed tree problem","volume":"30","author":"Gavish","year":"1983","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB14","unstructured":"Gavish, B., Graves, S., 1979. The travelling salesman problem and related problems. Working paper, Vanderbilt University, Nashville, TN."},{"key":"10.1016\/S0377-2217(99)00170-8_BIB15","doi-asserted-by":"crossref","unstructured":"Geppert, B., 1986. Tourenplanung bei der innerst\u00e4dtischen Hausm\u00fcllentsorgung. PhD. Thesis, Technical University of Karlsruhe","DOI":"10.1007\/978-3-642-71161-9_54"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB16","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search \u2013 part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB17","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search \u2013 part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB18","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/net.3230110308","article-title":"Capacitated arc routing problems","volume":"11","author":"Golden","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB19","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0305-0548(83)90026-6","article-title":"Computational experiments with algorithms for a class of routing problems","volume":"10","author":"Golden","year":"1983","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB20","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.43.1.130","article-title":"A 2n-constraint formulation for the capacitated minimal spanning tree problem","volume":"43","author":"Gouveia","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB21","unstructured":"Gouveia, L., Lopes, M.J., 1995. Using generalized capacitated trees for designing the topology of local access networks. In: 3rd International Conference on Telecommunication Systems, Nashville, pp. 320\u2013327"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB22","unstructured":"Gouveia, L., Martins, P., 1996. The capacitated minimal spanning tree problem: an experiment with a hop-indexed model. Working paper, Faculdade de Ciencias da Universidade de Lisboa"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB23","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1287\/ijoc.8.3.219","article-title":"Experience with a cutting plane algorithm for the capacitated spanning tree problem","volume":"8","author":"Hall","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB24","unstructured":"Hertz, A., Laporte, G., Mittaz, M., 1997. A tabu search heuristic for the capacitated arc routing problem. Working Paper, C.R.T., University of Montreal"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB25","doi-asserted-by":"crossref","first-page":"1835","DOI":"10.1109\/TCOM.1980.1094601","article-title":"Second-order greedy algorithms for centralized teleprocessing network design","volume":"28","author":"Kershenbaum","year":"1980","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB26","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","article-title":"On the shortest spanning subtree of a graph and the traveling salesman problem","volume":"7","author":"Kruskal","year":"1956","journal-title":"Proceedings of the American Mathematical Society"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB27","first-page":"273","article-title":"Graphic programming using odd or even points","volume":"1","author":"Kwan","year":"1962","journal-title":"Chinese Mathematics"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB28","doi-asserted-by":"crossref","unstructured":"Liebling, T.M., 1970. Graphentheorie in Planungs- und Tourenproblemen am Beispiel des st\u00e4dtischen Stra\u00dfendienstes. Springer, Berlin, Heidelberg, New York","DOI":"10.1007\/978-3-642-95161-9"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB29","unstructured":"Liebman, J.C., Male, J.W., 1974. Routing of solid waste collection vehicles. Final report. Appendix B: A heuristic solution to the M-postmen's problem. Illinois University, 444 Urbana, US Environmental Protection Agency Report No. 670\/2-74-036b"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB30","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1145\/321958.321974","article-title":"On the complexity of edge traversing","volume":"23","author":"Papadimitriou","year":"1976","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB31","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/net.3230080306","article-title":"The complexity of the capacitated tree problem","volume":"8","author":"Papadimitriou","year":"1978","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB32","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/0305-0548(89)90044-0","article-title":"Approximate solutions for the capacitated arc routing problem","volume":"16","author":"Pearn","year":"1989","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB33","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0305-0548(91)90089-A","article-title":"Augment-insert algorithms for the capacitated arc routing problem","volume":"18","author":"Pearn","year":"1991","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB34","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Syst. Techn. Journal"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB35","unstructured":"P\u00fctz, W., 1979. Numerische Untersuchungen zum Chinesischen Postbotenproblem. Diplomarbeit am Mathematischen Institut der Universit\u00e4t K\u00f6ln"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB36","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<161::AID-NET4>3.0.CO;2-F","article-title":"A tabu search algorithm for the capacitated shortest spanning tree problem","volume":"29","author":"Sharaiha","year":"1997","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB37","doi-asserted-by":"crossref","unstructured":"Stern, H.I. Dror, M., 1979. Routing electric meter readers. Computers and Operations Research 6, 209\u2013223","DOI":"10.1016\/0305-0548(79)90005-4"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB38","unstructured":"Zhu, P., 1989. Ein flexibles Verfahren zur L\u00f6sung kantenorientierter Tourenplanungsprobleme im Stra\u00dfenbetriebsdienst. PhD. dissertation, Technische Hochschule Darmstadt"},{"key":"10.1016\/S0377-2217(99)00170-8_BIB39","doi-asserted-by":"crossref","unstructured":"Zhu, P., 1992. Personal Communication","DOI":"10.1109\/SSST.1992.712303"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799001708?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799001708?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,8]],"date-time":"2023-04-08T22:55:39Z","timestamp":1680994539000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799001708"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0377221799001708"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00170-8","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}