{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:34:05Z","timestamp":1759847645678,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,1,9]],"date-time":"2009-01-09T00:00:00Z","timestamp":1231459200000},"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":[[2009,1,9]]},"DOI":"10.1145\/1527125.1527140","type":"proceedings-article","created":{"date-parts":[[2009,4,15]],"date-time":"2009-04-15T13:37:11Z","timestamp":1239802631000},"page":"113-120","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem"],"prefix":"10.1145","author":[{"given":"Christian","family":"Horoba","sequence":"first","affiliation":[{"name":"Technische Universitaet Dortmund, Dortmund, Germany"}]}],"member":"320","published-online":{"date-parts":[[2009,1,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424704"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389202"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2007.15.4.401"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276958.1277192"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCI.2007.372176"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_7_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . W. H. Freeman , 1979 . M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/646517.694055"},{"key":"e_1_3_2_1_9_1","first-page":"109","volume-title":"International Conference on Multiple Criteria Decision Making (MCDM)","author":"Hansen P.","year":"1979","unstructured":"P. Hansen . Bicriterion path problems . In International Conference on Multiple Criteria Decision Making (MCDM) , pages 109 -- 127 . Springer , 1979 . P. Hansen. Bicriterion path problems. In International Conference on Multiple Criteria Decision Making (MCDM), pages 109--127. Springer, 1979."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389224"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365602760234108"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2004.823470"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.08.005"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.12.009"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87700-4_8"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-006-9004-x"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.11.002"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11633-007-0281-3"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796569"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JMMA.0000049379.14872.f5"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/11940128_40"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/2770640.2770648"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_4"}],"event":{"name":"FOGA '09: Foundations of Genetic Algorithms X","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Orlando Florida USA","acronym":"FOGA '09"},"container-title":["Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1527125.1527140","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1527125.1527140","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:52Z","timestamp":1750253392000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1527125.1527140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,9]]},"references-count":24,"alternative-id":["10.1145\/1527125.1527140","10.1145\/1527125"],"URL":"https:\/\/doi.org\/10.1145\/1527125.1527140","relation":{},"subject":[],"published":{"date-parts":[[2009,1,9]]},"assertion":[{"value":"2009-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}