{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:58:33Z","timestamp":1743076713085,"version":"3.40.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031165788"},{"type":"electronic","value":"9783031165795"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16579-5_9","type":"book-chapter","created":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T23:02:54Z","timestamp":1663110174000},"page":"120-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Biobjective Consistent Traveling Salesman Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5590-5216","authenticated-orcid":false,"given":"Daniel","family":"D\u00edaz-R\u00edos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5683-0271","authenticated-orcid":false,"given":"Juan-Jos\u00e9","family":"Salazar-Gonz\u00e1lez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,14]]},"reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1016\/j.ejor.2013.07.038","volume":"236","author":"T Bektas","year":"2014","unstructured":"Bektas, T., Gouveia, L.: Requiem for the Miller-Tucker-Zemlin subtour elimination constraints. Eur. J. Oper. Res. 236(3), 820\u2013832 (2014). https:\/\/doi.org\/10.1016\/j.ejor.2013.07.038","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9_CR2","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1287\/msom.1080.0243","volume":"11","author":"C Gro\u00ebr","year":"2009","unstructured":"Gro\u00ebr, C., Golden, B., Wasil, E.: The consistent vehicle routing problem. Manuf. Serv. Oper. Manag. 11(4), 630\u2013643 (2009). https:\/\/doi.org\/10.1287\/msom.1080.0243","journal-title":"Manuf. Serv. Oper. Manag."},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Gunantara, N.: A review of multi-objective optimization: methods and its applications. Cogent Eng. 5(1), 1502242 (2018). https:\/\/doi.org\/10.1080\/23311916.2018.1502242","DOI":"10.1080\/23311916.2018.1502242"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.ejor.2013.08.001","volume":"232","author":"G Kirlik","year":"2014","unstructured":"Kirlik, G., Say\u0131n, S.: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems. Eur. J. Oper. Res. 232(3), 479\u2013488 (2014). https:\/\/doi.org\/10.1016\/j.ejor.2013.08.001","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s00158-009-0460-7","volume":"41","author":"RT Marler","year":"2010","unstructured":"Marler, R.T., Arora, J.S.: The weighted sum method for multi-objective optimization: new insights. Struct. Multidiscip. Optim. 41, 853\u2013862 (2010). https:\/\/doi.org\/10.1007\/s00158-009-0460-7","journal-title":"Struct. Multidiscip. Optim."},{"key":"9_CR6","unstructured":"Orman, A.J., Williams, H.P.: A survey of different integer programming formulations of the travelling salesman problem (2007)"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.ejor.2015.07.030","volume":"248","author":"A Subramanyam","year":"2016","unstructured":"Subramanyam, A., Gounaris, C.E.: A branch-and-cut framework for the consistent traveling salesman problem. Eur. J. Oper. Res. 248(2), 384\u2013395 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2015.07.030","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9_CR8","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1287\/trsc.2017.0741","volume":"52","author":"A Subramanyam","year":"2018","unstructured":"Subramanyam, A., Gounaris, C.E.: A decomposition algorithm for the consistent traveling salesman problem with vehicle idling. Transp. Sci. 52(2), 386\u2013401 (2018). https:\/\/doi.org\/10.1287\/trsc.2017.0741","journal-title":"Transp. Sci."}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16579-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T23:08:32Z","timestamp":1663110512000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16579-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031165788","9783031165795"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16579-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"21 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eventum.upf.edu\/78123\/detail\/international-conference-on-computational-logistics-iccl-2022.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"64","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":"31","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":"0","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":"48% - 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.5","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","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)"}}]}}