{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T19:45:37Z","timestamp":1773776737132,"version":"3.50.1"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031360237","type":"print"},{"value":"9783031360244","type":"electronic"}],"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-36024-4_35","type":"book-chapter","created":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T15:17:07Z","timestamp":1687879027000},"page":"454-468","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Case Study of\u00a0the\u00a0Profit-Maximizing Multi-Vehicle Pickup and\u00a0Delivery Selection Problem for\u00a0the\u00a0Road Networks with\u00a0the\u00a0Integratable Nodes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2480-6597","authenticated-orcid":false,"given":"Aolong","family":"Zha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiong","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoto","family":"Imura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsuhiro","family":"Nishinari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,26]]},"reference":[{"issue":"3","key":"35_CR1","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1016\/j.ejor.2018.02.020","volume":"271","author":"A Ahmadi-Javid","year":"2018","unstructured":"Ahmadi-Javid, A., Amiri, E., Meskar, M.: A profit-maximization location-routing-pricing problem: A branch-and-price algorithm. Eur. J. Oper. Res. 271(3), 866\u2013881 (2018). https:\/\/doi.org\/10.1016\/j.ejor.2018.02.020","journal-title":"Eur. J. Oper. Res."},{"key":"35_CR2","doi-asserted-by":"publisher","unstructured":"Al-Chami, Z., Flity, H.E., Manier, H., Manier, M.: A new metaheuristic to solve a selective pickup and delivery problem. In: Boukachour, J., Sbihi, A., Alaoui, A.E.H., Benadada, Y. (eds.) 4th International Conference on Logistics Operations Management, GOL 2018, Le Havre, 10\u201312 April, 2018. pp. 1\u20135. IEEE (2018). https:\/\/doi.org\/10.1109\/GOL.2018.8378089","DOI":"10.1109\/GOL.2018.8378089"},{"key":"35_CR3","doi-asserted-by":"publisher","unstructured":"Asghari, M., Mirzapour Al-e-hashem, S.M.J.: A green delivery-pickup problem for home hemodialysis machines; sharing economy in distributing scarce resources. Transp. Res. Part E: Logist. Transp. Rev. 134, 101815 (2020). https:\/\/doi.org\/10.1016\/j.tre.2019.11.009","DOI":"10.1016\/j.tre.2019.11.009"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.trpro.2021.01.060","volume":"52","author":"ME Bruni","year":"2021","unstructured":"Bruni, M.E., Toan, D.Q., Nam, L.H.: The multi-vehicle profitable pick up and delivery routing problem with uncertain travel times. Transp. Res. Procedia 52, 509\u2013516 (2021). https:\/\/doi.org\/10.1016\/j.trpro.2021.01.060","journal-title":"Transp. Res. Procedia"},{"key":"35_CR5","unstructured":"CPLEX, I.I.: IBM ILOG CPLEX Optimizer (2020). https:\/\/www.ibm.com\/products\/ilog-cplex-optimization-studio\/cplex-optimizer"},{"issue":"1","key":"35_CR6","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s00291-016-0454-y","volume":"39","author":"M Gansterer","year":"2016","unstructured":"Gansterer, M., K\u00fc\u00e7\u00fcktepe, M., Hartl, R.F.: The multi-vehicle profitable pickup and delivery problem. OR Spectrum 39(1), 303\u2013319 (2016). https:\/\/doi.org\/10.1007\/s00291-016-0454-y","journal-title":"OR Spectrum"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trc.2019.12.004","volume":"111","author":"D Huang","year":"2020","unstructured":"Huang, D., Gu, Y., Wang, S., Liu, Z., Zhang, W.: A two-phase optimization model for the demand-responsive customized bus network design. Transp. Res. Part C: Emerg. Technol. 111, 1\u201321 (2020). https:\/\/doi.org\/10.1016\/j.trc.2019.12.004","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"key":"35_CR8","doi-asserted-by":"publisher","unstructured":"Liu, C., Aleman, D.M., Beck, J.C.: Modelling and solving the senior transportation problem. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 412\u2013428. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_30","DOI":"10.1007\/978-3-319-93031-2_30"},{"issue":"4","key":"35_CR9","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM 7(4), 326\u2013329 (1960). https:\/\/doi.org\/10.1145\/321043.321046","journal-title":"J. ACM"},{"issue":"1","key":"35_CR10","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.ejor.2016.10.010","volume":"259","author":"X Qiu","year":"2017","unstructured":"Qiu, X., Feuerriegel, S., Neumann, D.: Making the most of fleets: A profit-maximizing multi-vehicle pickup and delivery selection problem. Eur. J. Oper. Res. 259(1), 155\u2013168 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2016.10.010","journal-title":"Eur. J. Oper. Res."},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.cor.2018.03.008","volume":"96","author":"M Riedler","year":"2018","unstructured":"Riedler, M., Raidl, G.R.: Solving a selective dial-a-ride problem with logic-based benders decomposition. Comput. Oper. Res. 96, 30\u201354 (2018). https:\/\/doi.org\/10.1016\/j.cor.2018.03.008","journal-title":"Comput. Oper. Res."},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.ins.2017.04.001","volume":"406","author":"C Ting","year":"2017","unstructured":"Ting, C., Liao, X., Huang, Y., Liaw, R.: Multi-vehicle selective pickup and delivery using metaheuristic algorithms. Inf. Sci. 406, 146\u2013169 (2017). https:\/\/doi.org\/10.1016\/j.ins.2017.04.001","journal-title":"Inf. Sci."},{"key":"35_CR13","doi-asserted-by":"publisher","unstructured":"Zha, A., Chang, Q., Imura, N., Nishinari, K.: A case study of the profit-maximizing multi-vehicle pickup and delivery selection problem for the road networks with the integratable nodes (2022). https:\/\/doi.org\/10.48550\/arXiv.2208.14866","DOI":"10.48550\/arXiv.2208.14866"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36024-4_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T13:08:22Z","timestamp":1723554502000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36024-4_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031360237","9783031360244"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36024-4_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2023\/","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":"530","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":"188","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":"94","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":"35% - 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,8","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,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)"}}]}}