{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T02:06:12Z","timestamp":1775527572979,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031368042","type":"print"},{"value":"9783031368059","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-36805-9_6","type":"book-chapter","created":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T23:03:04Z","timestamp":1688079784000},"page":"82-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Formulations for\u00a0the\u00a0Split Delivery Capacitated Profitable Tour Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1025-9772","authenticated-orcid":false,"given":"Marvin","family":"Caspar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8171-9735","authenticated-orcid":false,"given":"Daniel","family":"Schermer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7102-3141","authenticated-orcid":false,"given":"Oliver","family":"Wendt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,30]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Angelelli, E., Mansini, R., Rizzi, R.: The probabilistic profitable tour problem under a specific graph structure. arXiv preprint arXiv:2204.07378 (2022)","DOI":"10.1007\/s11590-022-01960-z"},{"issue":"7","key":"6_CR2","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1007\/s11590-012-0559-4","volume":"7","author":"C Archetti","year":"2013","unstructured":"Archetti, C., Bianchessi, N., Speranza, M.G.: The capacitated team orienteering problem with incomplete service. Optim. Lett. 7(7), 1405\u20131417 (2013)","journal-title":"Optim. Lett."},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/net.21529","volume":"63","author":"C Archetti","year":"2014","unstructured":"Archetti, C., Bianchessi, N., Speranza, M.G., Hertz, A.: Incomplete service and split deliveries in a routing problem with profits. Networks 63(2), 135\u2013145 (2014)","journal-title":"Networks"},{"issue":"4\u20135","key":"6_CR4","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.dam.2011.12.021","volume":"161","author":"C Archetti","year":"2013","unstructured":"Archetti, C., Bianchessi, N., Speranza, M.G.: Optimal solutions for routing problems with profits. Discret. Appl. Math. 161(4\u20135), 547\u2013557 (2013)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1002\/net.21519","volume":"63","author":"C Archetti","year":"2014","unstructured":"Archetti, C., Bianchessi, N., Speranza, M.G., Hertz, A.: The split delivery capacitated team orienteering problem. Networks 63(1), 16\u201333 (2014)","journal-title":"Networks"},{"issue":"6","key":"6_CR6","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1057\/palgrave.jors.2602603","volume":"60","author":"C Archetti","year":"2009","unstructured":"Archetti, C., Feillet, D., Hertz, A., Speranza, M.G.: The capacitated team orienteering and profitable tour problems. J. Oper. Res. Soc. 60(6), 831\u2013842 (2009)","journal-title":"J. Oper. Res. Soc."},{"issue":"7","key":"6_CR7","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1057\/palgrave.jors.2601743","volume":"55","author":"C Archetti","year":"2004","unstructured":"Archetti, C., Speranza, M.G.: Vehicle routing in the 1-skip collection problem. J. Oper. Res. Soc. 55(7), 717\u2013727 (2004)","journal-title":"J. Oper. Res. Soc."},{"issue":"6","key":"6_CR8","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E Balas","year":"1989","unstructured":"Balas, E.: The prize collecting traveling salesman problem. Networks 19(6), 621\u2013636 (1989)","journal-title":"Networks"},{"issue":"5","key":"6_CR9","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1287\/opre.48.5.801.12407","volume":"48","author":"JM Belenguer","year":"2000","unstructured":"Belenguer, J.M., Martinez, M., Mota, E.: A lower bound for the split delivery vehicle routing problem. Oper. Res. 48(5), 801\u2013810 (2000)","journal-title":"Oper. Res."},{"issue":"1","key":"6_CR10","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01581256","volume":"59","author":"D Bienstock","year":"1993","unstructured":"Bienstock, D., Goemans, M.X., Simchi-Levi, D., Williamson, D.: A note on the prize collecting traveling salesman problem. Math. Program. 59(1), 413\u2013420 (1993)","journal-title":"Math. Program."},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/j.ejor.2019.09.024","volume":"282","author":"A Bortfeldt","year":"2020","unstructured":"Bortfeldt, A., Yi, J.: The split delivery vehicle routing problem with three-dimensional loading constraints. Eur. J. Oper. Res. 282(2), 545\u2013558 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR12","unstructured":"Christofides, N.: The vehicle routing problem. In: Combinatorial Optimization (1979)"},{"issue":"13","key":"6_CR13","doi-asserted-by":"publisher","first-page":"1572","DOI":"10.1016\/j.ifacol.2019.11.424","volume":"52","author":"DL Cort\u00e9s-Murcia","year":"2019","unstructured":"Cort\u00e9s-Murcia, D.L., Afsar, H.M., Prodhon, C.: A branch and price algorithm for the electric capacitated profitable tour problem with mandatory stops. IFAC-PapersOnLine 52(13), 1572\u20131577 (2019)","journal-title":"IFAC-PapersOnLine"},{"key":"6_CR14","first-page":"1","volume":"17","author":"DL Cort\u00e9s-Murcia","year":"2022","unstructured":"Cort\u00e9s-Murcia, D.L., Afsar, H.M., Prodhon, C.: Multi-period profitable tour problem with electric vehicles and mandatory stops. Int. J. Sustain. Transp. 17, 1\u201317 (2022)","journal-title":"Int. J. Sustain. Transp."},{"issue":"4","key":"6_CR15","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling-salesman problem. J. Oper. Res. Soc. Am. 2(4), 393\u2013410 (1954)","journal-title":"J. Oper. Res. Soc. Am."},{"issue":"3","key":"6_CR16","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1111\/j.1475-3995.1995.tb00023.x","volume":"2","author":"M Dell\u2019Amico","year":"1995","unstructured":"Dell\u2019Amico, M., Maffioli, F., V\u00e4rbrand, P.: On prize-collecting tours and the asymmetric travelling salesman problem. Int. Trans. Oper. Res. 2(3), 297\u2013308 (1995)","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"6_CR17","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1287\/trsc.23.2.141","volume":"23","author":"M Dror","year":"1989","unstructured":"Dror, M., Trudeau, P.: Savings by split delivery routing. Transp. Sci. 23(2), 141\u2013145 (1989)","journal-title":"Transp. Sci."},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D Feillet","year":"2005","unstructured":"Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits. Transp. Sci. 39(2), 188\u2013205 (2005)","journal-title":"Transp. Sci."},{"issue":"6","key":"6_CR19","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1016\/0305-0548(94)00040-F","volume":"22","author":"PW Frizzell","year":"1995","unstructured":"Frizzell, P.W., Giffin, J.W.: The split delivery vehicle scheduling problem with time windows and grid network distances. Comput. Oper. Res. 22(6), 655\u2013667 (1995)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"6_CR20","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/j.tre.2009.12.007","volume":"46","author":"D Gulczynski","year":"2010","unstructured":"Gulczynski, D., Golden, B., Wasil, E.: The split delivery vehicle routing problem with minimum delivery amounts. Transp. Res. Part E Logist. Transp. Rev. 46(5), 612\u2013626 (2010)","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"6_CR21","unstructured":"Gurobi Optimization, LLC.: Gurobi Optimizer Reference Manual (2023)"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.disopt.2014.08.001","volume":"14","author":"MK Jepsen","year":"2014","unstructured":"Jepsen, M.K., Petersen, B., Spoorendonk, S., Pisinger, D.: A branch-and-cut algorithm for the capacitated profitable tour problem. Discret. Optim. 14, 78\u201396 (2014)","journal-title":"Discret. Optim."},{"issue":"3","key":"6_CR23","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1016\/j.ejor.2019.07.014","volume":"289","author":"G Lera-Romero","year":"2021","unstructured":"Lera-Romero, G., Miranda-Bront, J.J.: A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints. Eur. J. Oper. Res. 289(3), 879\u2013896 (2021)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"6_CR24","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1057\/palgrave.jors.2600338","volume":"48","author":"PA Mullaseril","year":"1997","unstructured":"Mullaseril, P.A., Dror, M., Leung, J.: Split-delivery routeing heuristics in livestock feed distribution. J. Oper. Res. Soc. 48(2), 107\u2013116 (1997)","journal-title":"J. Oper. Res. Soc."},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1023\/A:1018900705946","volume":"76","author":"G Sierksma","year":"1998","unstructured":"Sierksma, G., Tijssen, G.A.: Routing helicopters for crew exchanges on off-shore locations. Ann. Oper. Res. 76, 261\u2013286 (1998)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"6_CR26","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.1016\/j.ejor.2017.07.004","volume":"264","author":"P Sun","year":"2018","unstructured":"Sun, P., Veelenturf, L.P., Dabia, S., Van Woensel, T.: The time-dependent capacitated profitable tour problem with time windows and precedence constraints. Eur. J. Oper. Res. 264(3), 1058\u20131073 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D. (eds.): Vehicle Routing: Problems, Methods, and Applications. Society for Industrial and Applied Mathematics (SIAM) (2014)","DOI":"10.1137\/1.9781611973594"},{"issue":"9","key":"6_CR28","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1057\/jors.1984.162","volume":"35","author":"T Tsiligirides","year":"1984","unstructured":"Tsiligirides, T.: Heuristic methods applied to orienteering. J. Oper. Res. Soc. 35(9), 797\u2013809 (1984)","journal-title":"J. Oper. Res. Soc."},{"issue":"8","key":"6_CR29","doi-asserted-by":"publisher","first-page":"2349","DOI":"10.1007\/s11590-014-0752-8","volume":"8","author":"X Wang","year":"2014","unstructured":"Wang, X., Golden, B., Gulczynski, D.: A worst-case analysis for the split delivery capacitated team orienteering problem with minimum delivery amounts. Optim. Lett. 8(8), 2349\u20132356 (2014)","journal-title":"Optim. Lett."},{"key":"6_CR30","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.tre.2019.09.017","volume":"132","author":"M Yu","year":"2019","unstructured":"Yu, M., Jin, X., Zhang, Z., Qin, H., Lai, Q.: The split-delivery mixed capacitated arc-routing problem: applications and a forest-based tabu search approach. Transp. Res. Part E Logist. Transp. Rev. 132, 141\u2013162 (2019)","journal-title":"Transp. Res. Part E Logist. Transp. Rev."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36805-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T23:03:58Z","timestamp":1688079838000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36805-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031368042","9783031368059"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36805-9_6","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":"30 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"6 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":"iccsa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","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":"Custom based on Cyberchair 4","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"283","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":"67","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":"13","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":"24% - 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":"8,5","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)"}},{"value":"PHD Showcase Papers: 6(for main conf) \/ For ICCSA 2023 Workshops 876 subm sent, 350 full papers and 29 short papers accepted, additional PHD Showcase Papers: 2","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)"}}]}}