{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:12:46Z","timestamp":1743009166968,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319973098"},{"type":"electronic","value":"9783319973104"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-97310-4_25","type":"book-chapter","created":{"date-parts":[[2018,7,26]],"date-time":"2018-07-26T16:06:19Z","timestamp":1532621179000},"page":"219-227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Nature-Inspired Computational Model for Solving Bi-objective Traveling Salesman Problems"],"prefix":"10.1007","author":[{"given":"Xuejiao","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengpeng","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingchu","family":"Xin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianghua","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,27]]},"reference":[{"issue":"11","key":"25_CR1","first-page":"339","volume":"4","author":"S Fereidouni","year":"2011","unstructured":"Fereidouni, S.: Solving traveling salesman problem by using a fuzzy multi-objective linear programming. Afr. J. Math. Comput. Sci. Res. 4(11), 339\u2013349 (2011)","journal-title":"Afr. J. Math. Comput. Sci. Res."},{"issue":"2","key":"25_CR2","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":"5964","key":"25_CR3","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1126\/science.1177894","volume":"327","author":"A Tero","year":"2010","unstructured":"Tero, A., et al.: Rules for biologically inspired adaptive network design. Science 327(5964), 439\u2013442 (2010)","journal-title":"Science"},{"key":"25_CR4","doi-asserted-by":"publisher","unstructured":"Gao, C., et al.: Does being multi-headed make you better at solving problems? A survey of physarum-based models and computations. Phy. Life. Rev. https:\/\/doi.org\/10.1016\/j.plrev.2018.05.002 (2018)","DOI":"10.1016\/j.plrev.2018.05.002"},{"issue":"1","key":"25_CR5","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.swevo.2011.03.001","volume":"1","author":"AM Zhou","year":"2011","unstructured":"Zhou, A.M., Qu, B.Y., Li, H., Zhao, S.Z., Suganthan, P.N., Zhang, Q.F.: Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evol. Comput. 1(1), 32\u201349 (2011)","journal-title":"Swarm Evol. Comput."},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jspi.2014.12.004","volume":"160","author":"YT Cao","year":"2015","unstructured":"Cao, Y.T., Smucker, B.J., Robinson, T.J.: On using the hypervolume indicator to compare Pareto fronts: applications to multi-criteria optimal experimental design. J. Stat. Plan. Infer. 160, 60\u201374 (2015)","journal-title":"J. Stat. Plan. Infer."},{"issue":"18","key":"25_CR7","doi-asserted-by":"publisher","first-page":"3465","DOI":"10.1016\/j.ins.2010.05.033","volume":"180","author":"M Chica","year":"2010","unstructured":"Chica, M., Cord\u00f3n, O., Damas, S., Bautista, J.: Multiobjective constructive heuristics for the 1\/3 variant of the time and space assembly line balancing problem: ACO and random greedy search. Inform. Sci. 180(18), 3465\u20133487 (2010)","journal-title":"Inform. Sci."},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.ejor.2006.03.041","volume":"180","author":"C Garca-Martnez","year":"2007","unstructured":"Garca-Martnez, C., Cordn, O., Herrera, F.: A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP. Eur. J. Oper. Res. 180, 116\u2013148 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"25_CR9","doi-asserted-by":"publisher","first-page":"e0146709","DOI":"10.1371\/journal.pone.0146709","volume":"11","author":"ZL Zhang","year":"2016","unstructured":"Zhang, Z.L., Gao, C., Lu, Y.X., Liu, Y.X., Liang, M.X.: Multi-objective ant colony optimization based on the $$physarum$$-inspired mathematical model for bi-objective traveling salesman problems. PLoS ONE. 11(1), e0146709 (2016)","journal-title":"PLoS ONE."},{"issue":"1\u20134","key":"25_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1023\/B:ANOR.0000039513.99038.c6","volume":"131","author":"K Doerner","year":"2004","unstructured":"Doerner, K., Gutjahr, W.J., Hartl, R.F., Strauss, C., Stummer, C.: Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection. Ann. Oper. Res. 131(1\u20134), 79\u201399 (2004)","journal-title":"Ann. Oper. Res."},{"key":"25_CR11","unstructured":"Barn, B., Schaerer, M.: A multiobjective ant colony system for vehicle routing problem with time windows. In: Proceedings of Iasted International Multi-Conference on Applied Informatics, pp. 97\u2013102 (2003)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/3-540-44719-9_25","volume-title":"Evolutionary Multi-Criterion Optimization","author":"S Iredi","year":"2001","unstructured":"Iredi, S., Merkle, D., Middendorf, M.: Bi-criterion optimization with multi colony ant algorithms. In: Zitzler, E., Thiele, L., Deb, K., Coello Coello, C.A., Corne, D. (eds.) EMO 2001. LNCS, vol. 1993, pp. 359\u2013372. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44719-9_25"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2018: Trends in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-97310-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:10:52Z","timestamp":1709827852000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-97310-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319973098","9783319973104"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-97310-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"27 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific Rim International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pricai2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cse.seu.edu.cn\/pricai18\/","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":"382","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":"82","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":"58","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":"21% - 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":"2.95","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":"2.95","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}