{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T06:14:44Z","timestamp":1762928084220},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131929"},{"type":"electronic","value":"9783642131936"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_19","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T11:54:59Z","timestamp":1272369299000},"page":"214-225","source":"Crossref","is-referenced-by-count":10,"title":["An Approximate \u03b5-Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem"],"prefix":"10.1007","author":[{"given":"Lucio","family":"Grandinetti","sequence":"first","affiliation":[]},{"given":"Francesca","family":"Guerriero","sequence":"additional","affiliation":[]},{"given":"Demetrio","family":"Lagan\u00e0","sequence":"additional","affiliation":[]},{"given":"Ornella","family":"Pisacane","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Ahr, D.: Contributions to multiple postmen problems. Ph.D. Thesis, University of Heidelberg (2004)"},{"key":"19_CR2","first-page":"375","volume-title":"Network Routing, Handbooks in Operations Research and Management Science","author":"A.A. Assad","year":"1995","unstructured":"Assad, A.A., Golden, B.L.: Arc routing methods and applications. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Routing, Handbooks in Operations Research and Management Science, pp. 375\u2013483. North-Holland, Amsterdam (1995)"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1002\/net.3230220706","volume":"22","author":"E. Benavent","year":"1992","unstructured":"Benavent, E., Campos, V., Corber\u00e1n, A., Mota, E.: The capacitated arc routing problem: Lower bounds. Networks\u00a022, 669\u2013690 (1992)","journal-title":"Networks"},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/978-1-4615-4495-1_7","volume-title":"Arc routing. Theory, Solutions and Applications","author":"E. Benavent","year":"2000","unstructured":"Benavent, E., Corber\u00e1n, A., Sanchis, J.M.: Linear programming based methods for solving arc routing problems. In: Dror, M. (ed.) Arc routing. Theory, Solutions and Applications, pp. 231\u2013275. Kluwer, Boston (2000)"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ejor.2007.12.014","volume":"194","author":"J.F. Berube","year":"2009","unstructured":"Berube, J.F., Gendreau, M., Potvin, J.Y.: An exact \u03b5-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits. European Journal of Operational Research\u00a0194, 39\u201350 (2009)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"19_CR6","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/S0377-2217(02)00334-X","volume":"147","author":"P. Beullens","year":"2003","unstructured":"Beullens, P., Muyldermans, L., Cattrysse, D., Oudheusden, D.V.: A guided local search heuristic for the capacitated arc routing problem. European Journal of Operational Research\u00a0147(3), 629\u2013643 (2003)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"19_CR7","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1016\/j.cor.2006.07.007","volume":"35","author":"J. Brand\u00e3o","year":"2008","unstructured":"Brand\u00e3o, J., Eglese, R.: A deterministic tabu search algorithm for the capacitated arc routing problem. Computers & Operations Research\u00a035(4), 1112\u20131126 (2008)","journal-title":"Computers & Operations Research"},{"key":"19_CR8","volume-title":"Multiobjective Decision Making: Theory and Methodology","author":"V. Chankong","year":"1983","unstructured":"Chankong, V., Haimes, Y.Y.: Short-Haul Routing. In: Multiobjective Decision Making: Theory and Methodology. North-Holland, Amsterdam (1983)"},{"key":"19_CR9","unstructured":"DeArmon, J.S.: A Comparison of Heuristics for the Capacitated Chinese Postman Problem. University of Maryland, Dissertation (1981)"},{"volume-title":"Arc Routing: Theory, Solutions and Applications","year":"2000","key":"19_CR10","unstructured":"Dror, M. (ed.): Arc Routing: Theory, Solutions and Applications. Kluwer, Boston (2000)"},{"key":"19_CR11","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-1-4615-4495-1_6","volume-title":"Arc routing. Theory, Solutions and Applications","author":"R.W. Eglese","year":"2000","unstructured":"Eglese, R.W., Letchford, A.: Polyhedral theory for arc routing problems. In: Dror, M. (ed.) Arc routing. Theory, Solutions and Applications, pp. 199\u2013230. Kluwer, Boston (2000)"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/opre.43.3.399","volume":"43","author":"H.A. Eiselt","year":"1995","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part II: The rural postman problem. Operations Research\u00a043, 399\u2013414 (1995)","journal-title":"Operations Research"},{"key":"19_CR13","unstructured":"Fleury, G., Lacomme, P., Prins, C., Sevaux, M.: A memetic algorithm for a bi-objective and stochastic CARP. In: Proceeding of the MIC 2005: The Sixth Metaheuristics International Conference, Vienna, Austria, August 22-26 (2005)"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s101070050007","volume":"87","author":"G. Ghiani","year":"2000","unstructured":"Ghiani, G., Laporte, G.: A branch-and-cut algorithm for the undirected rural postman problem. Mathematical Programming\u00a087, 467\u2013481 (2000)","journal-title":"Mathematical Programming"},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1002\/net.3230110308","volume":"11","author":"B.L. Golden","year":"1981","unstructured":"Golden, B.L., Wong, R.T.: Capacitated arc routing problems. Networks\u00a011(3), 305\u2013315 (1981)","journal-title":"Networks"},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0360-8352(02)00178-X","volume":"44","author":"P. Greistorfer","year":"2003","unstructured":"Greistorfer, P.: A tabu scatter search metaheuristic for the arc routing problem. Computers & Industrial Engineering\u00a044(2), 249\u2013266 (2003)","journal-title":"Computers & Industrial Engineering"},{"issue":"4","key":"19_CR17","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1287\/trsc.35.4.425.10431","volume":"35","author":"A. Hertz","year":"2001","unstructured":"Hertz, A., Mittaz, M.: A variable neighborhood descent algorithm for the undirected capacitated arc routing problem. Transportation Science\u00a035(4), 425\u2013434 (2001)","journal-title":"Transportation Science"},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1287\/opre.48.1.129.12455","volume":"48","author":"A. Hertz","year":"2000","unstructured":"Hertz, A., Laporte, G., Mittaz, M.: A tabu search heuristic for the capacitated arc routing problem. Operation Research\u00a048(1), 129\u2013135 (2000)","journal-title":"Operation Research"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"1929","DOI":"10.1016\/j.cor.2005.07.022","volume":"34","author":"N. Jozefowiez","year":"2007","unstructured":"Jozefowiez, N., Semet, F., Talbi, E.-G.: The bi-objective covering tour problem. Computers and Operations Research\u00a034, 1929\u20131942 (2007)","journal-title":"Computers and Operations Research"},{"issue":"5","key":"19_CR20","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1109\/TEVC.2009.2023449","volume":"13","author":"T. Ke","year":"2009","unstructured":"Ke, T., Mei, Y., Xin, Y.: Memetic Algorithm with Extended Neighborhood Search for Capacitated Arc Routing Problems. IEEE Transactions on Evolutionary Computation\u00a013(5), 1151\u20131166 (2009)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Lacomme, P., Prins, C., Ramdane-Cherif, W.: A genetic algorithm for the capacitated arc routing problem and its extensions. In: Proceedings European WorkShops on Applications of Evolutionary Computation, Como, Italy, pp. 473\u2013483 (2001)","DOI":"10.1007\/3-540-45365-2_49"},{"issue":"14","key":"19_CR22","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/B:ANOR.0000039517.35989.6d","volume":"131","author":"P. Lacomme","year":"2004","unstructured":"Lacomme, P., Prins, C., Ramdane-Cherif, W.: Competitive memetic algorithms for arc routing problem. Annals of Operations Research\u00a0131(14), 159\u2013185 (2004)","journal-title":"Annals of Operations Research"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Lacomme, P., Prins, C., Tanguy, A.: First competitive ant colony scheme for the CARP. Research Report LIMOS\/RR-04-21;2004","DOI":"10.1007\/978-3-540-28646-2_48"},{"issue":"12","key":"19_CR24","doi-asserted-by":"publisher","first-page":"3473","DOI":"10.1016\/j.cor.2005.02.017","volume":"33","author":"P. Lacomme","year":"2006","unstructured":"Lacomme, P., Prins, C., Sevaux, M.: A genetic algorithm for a bi-objective capacitated arc routing problem. Computers & Operations Research\u00a033(12), 3473\u20133493 (2006), Part Special Issue: Recent Algorithmic Advances for Arc Routing Problems","journal-title":"Computers & Operations Research"},{"key":"19_CR25","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1016\/j.ejor.2004.08.029","volume":"169","author":"M. Laumanns","year":"2006","unstructured":"Laumanns, M., Thiele, L., Zitzler, E.: An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method. European Journal of Operational Research\u00a0169, 932\u2013942 (2006)","journal-title":"European Journal of Operational Research"},{"key":"19_CR26","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/net.3230060305","volume":"6","author":"J.K. Lenstra","year":"1976","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G.: On general routing problems. Networks\u00a06, 273\u2013280 (1976)","journal-title":"Networks"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Li, L., Eglese, R.W.: An interactive algorithm for vehicle routing for winter-gritting. Journal of the Operational Research Society, 217\u2013228 (1996)","DOI":"10.1057\/jors.1996.20"},{"key":"19_CR28","series-title":"Series: Non Convex Optimization and its Applications 5","volume-title":"Advances in Multicriteria Analysis","year":"1995","unstructured":"Pardalos, P.M., Siskos, Y., Zopoundis, C. (eds.): Advances in Multicriteria Analysis. Series: Non Convex Optimization and its Applications 5. Kluwer Academic Publishers, Dordrecht (1995)"},{"issue":"9","key":"19_CR29","doi-asserted-by":"publisher","first-page":"2632","DOI":"10.1016\/j.cor.2008.11.005","volume":"36","author":"L. Santos","year":"2009","unstructured":"Santos, L., Rodrigues, J.C., Current, J.R.: An improved heuristic for the capacitated arc routing problem. Computers & Operations Research\u00a036(9), 2632\u20132637 (2009)","journal-title":"Computers & Operations Research"},{"key":"19_CR30","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-0-387-77778-8_2","volume-title":"The Vehicle Routing Problem Latest Advances and New Challenges","author":"S. Wohlk","year":"2008","unstructured":"Wohlk, S.: A decade of capacitated arc routing. In: Golden, B.L., Raghavan, S., Wasil, E.A. (eds.) The Vehicle Routing Problem Latest Advances and New Challenges, pp. 29\u201348. Springer, Boston (2008)"},{"key":"19_CR31","doi-asserted-by":"publisher","first-page":"1699","DOI":"10.1109\/CEC.2009.4983146","volume-title":"Proceedings of the 2009 IEEE Congress on Evolutionary Computation (CEC 2009)","author":"Y. Mei","year":"2009","unstructured":"Mei, Y., Tang, K., Xin, Y.: Improved Memetic Algorithm for Capacitated Arc Routing Problem. In: Proceedings of the 2009 IEEE Congress on Evolutionary Computation (CEC 2009), Trondheim, Norway, May 18-21, pp. 1699\u20131706. IEEE Press, Los Alamitos (2009)"},{"key":"19_CR32","doi-asserted-by":"crossref","unstructured":"Mei, Y., Tang, K., Xin, Y.: A Memetic Algorithm for Periodic Capacitated Arc Routing Problem. IEEE Transactions on Intelligent Transportation Systems (July 2009) (submitted)","DOI":"10.1109\/CEC.2009.4983146"},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"Mei, Y., Tang, K., Xin, Y.: Decomposition-Based Memetic Algorithm for Multi-Objective Capacitated Arc Routing Problem. IEEE Transactions on Evolutionary Computation (October 2009) (submitted)","DOI":"10.1109\/CEC.2009.4983146"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:02:33Z","timestamp":1606186953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}