{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T04:27:45Z","timestamp":1743395265011,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031265037"},{"type":"electronic","value":"9783031265044"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-26504-4_42","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"519-524","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Evolutionary Algorithm Applied to\u00a0the\u00a0Bi-Objective Travelling Salesman Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9748-1186","authenticated-orcid":false,"given":"Luis Henrique","family":"Pauleti Mendes","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8972-080X","authenticated-orcid":false,"given":"F\u00e1bio Luiz","family":"Usberti","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6476-4534","authenticated-orcid":false,"given":"M\u00e1rio C\u00e9sar","family":"San Felice","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"key":"42_CR1","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"DL Applegate","year":"2007","unstructured":"Applegate, D.L., Bixby, R.E., Chvat\u00e1l, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2007)"},{"issue":"2","key":"42_CR2","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6(2), 154\u2013160 (1994)","journal-title":"ORSA J. Comput."},{"issue":"3","key":"42_CR3","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10732-020-09457-7","volume":"27","author":"JB Chagas","year":"2021","unstructured":"Chagas, J.B., Blank, J., Wagner, M., Souza, M.J., Deb, K.: A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem. J. Heurist. 27(3), 267\u2013301 (2021)","journal-title":"J. Heurist."},{"key":"42_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-030-87672-2_31","volume-title":"Computational Logistics","author":"RB Damm","year":"2021","unstructured":"Damm, R.B., Ronconi, D.P.: A multi-objective biased random-key genetic algorithm for service technician routing and scheduling problem. In: Mes, M., Lalla-Ruiz, E., Vo\u00df, S. (eds.) ICCL 2021. LNCS, vol. 13004, pp. 471\u2013486. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-87672-2_31"},{"issue":"2","key":"42_CR5","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"42_CR6","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.: Biased random-key genetic algorithms for combinatorial optimization. J. Heurist. 17(5), 487\u2013525 (2011)","journal-title":"J. Heurist."},{"issue":"11","key":"42_CR7","doi-asserted-by":"publisher","first-page":"2316","DOI":"10.1016\/j.ins.2010.12.004","volume":"181","author":"B Lacevic","year":"2011","unstructured":"Lacevic, B., Amaldi, E.: Ectropy of diversity measures for populations in Euclidean space. Inf. Sci. 181(11), 2316\u20132339 (2011)","journal-title":"Inf. Sci."},{"key":"42_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-45105-6_4","volume-title":"Genetic and Evolutionary Computation \u2014 GECCO 2003","author":"X Li","year":"2003","unstructured":"Li, X.: A non-dominated sorting particle swarm optimizer for multiobjective optimization. In: Cant\u00fa-Paz, E., et al. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 37\u201348. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45105-6_4"},{"key":"42_CR9","unstructured":"Lucena, M.L., Andrade, C.E., Resende, M.G., Miyazawa, F.K.: Some extensions of biased random-key genetic algorithms. In: Proceedings of the 46th Brazilian Symposium of Operational Research, pp. 1\u201312 (2014)"},{"issue":"3","key":"42_CR10","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.cor.2009.01.005","volume":"37","author":"T Lust","year":"2010","unstructured":"Lust, T., Jaszkiewicz, A.: Speed-up techniques for solving large-scale biobjective TSP. Comput. Oper. Res. 37(3), 521\u2013533 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"42_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TEVC.2020.3013290","volume":"25","author":"K Shang","year":"2021","unstructured":"Shang, K., Ishibuchi, H., He, L., Pang, L.M.: A survey on the hypervolume indicator in evolutionary multiobjective optimization. IEEE Trans. Evol. Comput. 25(1), 1\u201320 (2021)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"42_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10696-011-9099-y","volume":"23","author":"VA Shim","year":"2011","unstructured":"Shim, V.A., Tan, K.C., Chia, J.Y., Chong, J.K.: Evolutionary algorithms for solving multi-objective travelling salesman problem. Flex. Serv. Manuf. J. 23(2), 207\u2013241 (2011)","journal-title":"Flex. Serv. Manuf. J."},{"issue":"6","key":"42_CR13","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26504-4_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T08:05:43Z","timestamp":1688198743000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ortigia-Syracuse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ants-lab.it\/mic2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}