{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,18]],"date-time":"2026-09-18T10:52:14Z","timestamp":1789728734229,"version":"4.0.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,7]],"date-time":"2010-07-07T00:00:00Z","timestamp":1278460800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,7,7]]},"DOI":"10.1145\/1830483.1830494","type":"proceedings-article","created":{"date-parts":[[2010,7,11]],"date-time":"2010-07-11T22:03:17Z","timestamp":1278885797000},"page":"71-78","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["The impact of design choices of multiobjective antcolony optimization algorithms on performance"],"prefix":"10.1145","author":[{"given":"Manuel","family":"L\u00f3pez-Ib\u00e1\u00f1ez","sequence":"first","affiliation":[{"name":"Universit\u00e9 Libre de Bruxelles, Brussels, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Libre de Bruxelles, Brussels, Belgium"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2010,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2007.52"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-008-0022-4"},{"key":"e_1_3_2_1_3_1","first-page":"97","volume-title":"Proc. of 21st IASTED Int. Conf. on Applied Informatics","author":"Bar\u00e1n B.","year":"2003","unstructured":"B. Bar\u00e1n and M. Schaerer . A multiobjective ant colony system for vehicle routing problem with time windows . In Proc. of 21st IASTED Int. Conf. on Applied Informatics , pages 97 -- 102 , Insbruck, Austria , 2003 . B. Bar\u00e1n and M. Schaerer. A multiobjective ant colony system for vehicle routing problem with time windows. In Proc. of 21st IASTED Int. Conf. on Applied Informatics, pages 97--102, Insbruck, Austria, 2003."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892762"},{"issue":"2","key":"e_1_3_2_1_5_1","first-page":"115","article-title":"Are CompetAnts more competent for problem solving? The case of a multiple objective transportation problem","volume":"11","author":"Doerner K. F.","year":"2003","unstructured":"K. F. Doerner , R. F. Hartl , and M. Reimann . Are CompetAnts more competent for problem solving? The case of a multiple objective transportation problem . Central European Journal for Operations Research and Economics , 11 ( 2 ): 115 -- 141 , 2003 . K. F. Doerner, R. F. Hartl, and M. Reimann. Are CompetAnts more competent for problem solving? The case of a multiple objective transportation problem. Central European Journal for Operations Research and Economics, 11(2):115--141, 2003.","journal-title":"Central European Journal for Operations Research and Economics"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000039513.99038.c6"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/975277"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.03.041"},{"key":"e_1_3_2_1_10_1","series-title":"LNCS","first-page":"213","volume-title":"E. Zitzler et al.","author":"Grunert da Fonseca V.","year":"2001","unstructured":"V. Grunert da Fonseca , C. M. Fonseca , and A. O. Hall . Inferential performance assessment of stochastic optimisers and the attainment function . In E. Zitzler et al. , editors, EMO 2001 , volume 1993 of LNCS , pages 213 -- 225 . Springer , Heidelberg, 2001. V. Grunert da Fonseca, C. M. Fonseca, and A. O. Hall. Inferential performance assessment of stochastic optimisers and the attainment function. In E. Zitzler et al., editors, EMO 2001, volume 1993 of LNCS, pages 213--225. Springer, Heidelberg, 2001."},{"key":"e_1_3_2_1_11_1","series-title":"LNCS","first-page":"359","volume-title":"E. Zitzler et al.","author":"Iredi S.","year":"2001","unstructured":"S. Iredi , D. Merkle , and M. Middendorf . Bi-criterion optimization with multi colony ant algorithms . In E. Zitzler et al. , editors, EMO 2001 , volume 1993 of LNCS , pages 359 -- 372 . Springer , Heidelberg, 2001. S. Iredi, D. Merkle, and M. Middendorf. Bi-criterion optimization with multi colony ant algorithms. In E. Zitzler et al., editors, EMO 2001, volume 1993 of LNCS, pages 359--372. Springer, Heidelberg, 2001."},{"key":"e_1_3_2_1_12_1","series-title":"LNCS","first-page":"134","volume-title":"EA","author":"L\u00f3pez-Ib\u00e1\u00f1ez M.","year":"2009","unstructured":"M. L\u00f3pez-Ib\u00e1\u00f1ez and T. St\u00fctzle . An analysis of algorithmic components for multiobjective ant colony optimization: A case study on the biobjective TSP . In EA 2009 , volume 5975 of LNCS , pages 134 -- 145 . Springer , Heidelberg , 2009. M. L\u00f3pez-Ib\u00e1\u00f1ez and T. St\u00fctzle. An analysis of algorithmic components for multiobjective ant colony optimization: A case study on the biobjective TSP. In EA 2009, volume 5975 of LNCS, pages 134--145. Springer, Heidelberg, 2009."},{"key":"e_1_3_2_1_13_1","series-title":"LNCS","first-page":"214","volume-title":"M. Dorigo et al.","author":"L\u00f3pez-Ib\u00e1\u00f1ez M.","year":"2004","unstructured":"{13} M. L\u00f3pez-Ib\u00e1\u00f1ez , L. Paquete , and T. St\u00fctzle . On the design of ACO for the biobjective quadratic assignment problem . In M. Dorigo et al. , editors, Proc. of ANTS 2004 , volume 3172 of LNCS , pages 214 -- 225 . Springer , Heidelberg, 2004. {13} M. L\u00f3pez-Ib\u00e1\u00f1ez, L. Paquete, and T. St\u00fctzle. On the design of ACO for the biobjective quadratic assignment problem. In M. Dorigo et al., editors, Proc. of ANTS 2004, volume 3172 of LNCS, pages 214--225. Springer, Heidelberg, 2004."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10852-005-9034-x"},{"key":"e_1_3_2_1_15_1","volume-title":"T. Bartz-Beielstein et al.","author":"L\u00f3pez-Ib\u00e1\u00f1ez M.","year":"2010","unstructured":"M. L\u00f3pez-Ib\u00e1\u00f1ez , L. Paquete , and T. St\u00fctzle . Exploratory analysis of stochastic local search algorithms in biobjective optimization . In T. Bartz-Beielstein et al. , editors, Experimental Methods for the Analysis of Optimization Algorithms. Springer , 2010 . To appear. M. L\u00f3pez-Ib\u00e1\u00f1ez, L. Paquete, and T. St\u00fctzle. Exploratory analysis of stochastic local search algorithms in biobjective optimization. In T. Bartz-Beielstein et al., editors, Experimental Methods for the Analysis of Optimization Algorithms. Springer, 2010. To appear."},{"key":"e_1_3_2_1_16_1","first-page":"894","volume-title":"Proc. of GECCO-1999","author":"Mariano C. E.","year":"1999","unstructured":"C. E. Mariano and E. Morales . MOAQ: An Ant-Q algorithm for multiple objective optimization problems. In W. Banzhaf et al., editors , Proc. of GECCO-1999 , pages 894 -- 901 . Morgan Kaufmann, San Francisco, CA , 1999 . C. E. Mariano and E. Morales. MOAQ: An Ant-Q algorithm for multiple objective optimization problems. In W. Banzhaf et al., editors, Proc. of GECCO-1999, pages 894--901. Morgan Kaufmann, San Francisco, CA, 1999."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-009-0029-5"},{"key":"e_1_3_2_1_18_1","volume-title":"A software package of various ant colony optimization algorithms applied to the symmetric traveling salesman problem","author":"St\u00fctzle T.","year":"2002","unstructured":"T. St\u00fctzle . ACOTSP : A software package of various ant colony optimization algorithms applied to the symmetric traveling salesman problem , 2002 . URL http:\/\/www.aco-metaheuristic.org\/aco-code\/. T. St\u00fctzle. ACOTSP: A software package of various ant colony optimization algorithms applied to the symmetric traveling salesman problem, 2002. URL http:\/\/www.aco-metaheuristic.org\/aco-code\/."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/348599.348603"}],"event":{"name":"GECCO '10: Genetic and Evolutionary Computation Conference","location":"Portland Oregon USA","acronym":"GECCO '10","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the 12th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1830483.1830494","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1830483.1830494","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:38Z","timestamp":1750246778000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1830483.1830494"}},"subtitle":["an experimental study on the biobjective TSP"],"short-title":[],"issued":{"date-parts":[[2010,7,7]]},"references-count":19,"alternative-id":["10.1145\/1830483.1830494","10.1145\/1830483"],"URL":"https:\/\/doi.org\/10.1145\/1830483.1830494","relation":{},"subject":[],"published":{"date-parts":[[2010,7,7]]},"assertion":[{"value":"2010-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}