{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:25:31Z","timestamp":1742912731150,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031107245"},{"type":"electronic","value":"9783031107252"}],"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-10725-2_11","type":"book-chapter","created":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T14:29:33Z","timestamp":1659104973000},"page":"211-226","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A MIP-Based Heuristic for\u00a0Pickup and\u00a0Delivery on\u00a0Rectilinear Layout"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0866-3795","authenticated-orcid":false,"given":"Claudio","family":"Arbib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3255-8378","authenticated-orcid":false,"given":"Andrea","family":"Pizzuti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0948-1440","authenticated-orcid":false,"given":"Fatemeh K.","family":"Ranjbar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8152-003X","authenticated-orcid":false,"given":"Stefano","family":"Smriglio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,30]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Arbib, C., Ranjbar, F.K., Smriglio S.: A dynamic dial-a-ride model for optimal vehicle routing in a wafer fab. In: Proceedings of the 10th International Conference on Operations Research and Enterprise System, Online Streaming, 4\u20136 February 2021, pp. 281\u2013286 (2021)","DOI":"10.5220\/0010318402810286"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","volume":"16","author":"G Berbeglia","year":"2007","unstructured":"Berbeglia, G., Cordeau, J.F., Gribkovskaia, I., Laporte, G.: Static pickup and delivery problems: a classification scheme and survey. TOP 16, 1\u201331 (2007). https:\/\/doi.org\/10.1007\/s11750-007-0009-0","journal-title":"TOP"},{"key":"11_CR3","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-51576-7_5","volume-title":"Assignment and Matching Problems: Solution Methods with FORTRAN-Programs","author":"R Burkard","year":"1980","unstructured":"Burkard, R., Derigs, U.: The bottleneck matching problem. In: Assignment and Matching Problems: Solution Methods with FORTRAN-Programs. Lecture Notes in Economics and Mathematical Systems, vol. 184, pp. 60\u201371. Springer, Berlin-Heidelberg (1980). https:\/\/doi.org\/10.1007\/978-3-642-51576-7_5"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-319-13111-5_4","volume-title":"Location Science","author":"H Calik","year":"2015","unstructured":"Calik, H., Labb\u00e9, M., Yaman, H.: p-center problems. In: Laporte, G., Nickel, S., da Gama, F.S. (eds.) Location Science, pp. 79\u201392. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-13111-5_4"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12, 568\u2013581 (1964)","journal-title":"Oper. Res."},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling salesman problems. Oper. Res. 6, 791\u2013812 (1958)","journal-title":"Oper. Res."},{"issue":"7","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1747","DOI":"10.1287\/opre.19.7.1747","volume":"19","author":"R Garfinkel","year":"1971","unstructured":"Garfinkel, R.: An improved algorithm for the bottleneck assignment problem. Oper. Res. 19(7), 1747\u20131751 (1971)","journal-title":"Oper. Res."},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0166-218X(97)00074-7","volume":"81","author":"DJ Guan","year":"1998","unstructured":"Guan, D.J.: Routing a vehicle of capacity greater than one. Discrete Appl. Math. 81, 41\u201357 (1998)","journal-title":"Discrete Appl. Math."},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.trb.2018.02.001","volume":"111","author":"S Ho","year":"2018","unstructured":"Ho, S., Szeto, W., Huo, Y., Leung, J., Petering, M., Tou, T.: A survey of dial-a-ride problems: literature review and recent developments. Transp. Res. B 111, 395\u2013421 (2018)","journal-title":"Transp. Res. B"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.3126\/jist.v20i2.13961","volume":"20","author":"P Pundir","year":"2015","unstructured":"Pundir, P., Porwal, S., Singh, B.: A new algorithm for solving linear bottleneck assignment problem. J. Inst. Sci. Technol. 20(2), 101\u2013102 (2015)","journal-title":"J. Inst. Sci. Technol."},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10107-002-0323-0","volume":"94","author":"T Ralphs","year":"2003","unstructured":"Ralphs, T., Kopman, L., Pulleyblank, W., Trotter, L.E.: On the capacitated vehicle routing problem. Math. Program. Ser. B 94, 343\u2013359 (2003). https:\/\/doi.org\/10.1007\/s10107-002-0323-0","journal-title":"Math. Program. Ser. B"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2019.10.010","volume":"286","author":"T Vidal","year":"2020","unstructured":"Vidal, T., Laporte, G., Matl, P.: A concise guide to existing and emerging vehicle routing problem variants. Eur. J. Oper. Res. 286(2), 401\u2013416 (2020)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1002\/net.20116","volume":"48","author":"F Wang","year":"2006","unstructured":"Wang, F., Lim, A., Xu, Z.: The one-commodity pickup and delivery travelling salesman problem on a path or a tree. Networks 48(1), 24\u201335 (2006)","journal-title":"Networks"}],"container-title":["Communications in Computer and Information Science","Operations Research and Enterprise Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-10725-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T14:33:38Z","timestamp":1659105218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10725-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031107245","9783031107252"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10725-2_11","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"30 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICORES","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Operations Research and Enterprise Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 February 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icores2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icores.scitevents.org\/?y=2021","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":"PRIMORIS","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":"18","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":"25","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":"28% - 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":"4","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)"}},{"value":"6 selected papers included in this CCIS proceedings","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}