乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T04:27:13Z","timestamp":1726201633521},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031368042"},{"type":"electronic","value":"9783031368059"}],"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_17","type":"book-chapter","created":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T19:03:04Z","timestamp":1688065384000},"page":"245-259","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Constructive Algorithm for the Split Delivery Vehicle Routing Problem (SDVRP)"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0009-0007-4138-2796","authenticated-orcid":false,"given":"Francisco","family":"Jones","sequence":"first","affiliation":[]},{"given":"Rodrigo","family":"Astudillo","sequence":"additional","affiliation":[]},{"given":"Benjam\u00edn","family":"Acosta","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-4482-8075","authenticated-orcid":false,"given":"Alexis","family":"Olmedo","sequence":"additional","affiliation":[]},{"given":"Alejandro","family":"C\u00f3rdova","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-1816-6856","authenticated-orcid":false,"given":"Gustavo","family":"Gatica","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,30]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s10732-008-9101-3","volume":"16","author":"RE Aleman","year":"2010","unstructured":"Aleman, R.E., Zhang, X., Hill, R.R.: An adaptive memory algorithm for the split-delivery vehicle routing problem. J. Heurist. 16, 441\u2013473 (2010)","journal-title":"J. Heurist."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Archetti, C., Speranza, M.G.: A tabu search algorithm for the split delivery vehicle routing problem (2011)","DOI":"10.1002\/net.20467"},{"issue":"1\u20132","key":"17_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1111\/j.1475-3995.2011.00811.x","volume":"19","author":"C Archetti","year":"2012","unstructured":"Archetti, C., Speranza, M.G.: Vehicle routing problems with split deliveries. Int. Trans. Oper. Res. 19(1\u20132), 3\u201322 (2012)","journal-title":"Int. Trans. Oper. Res."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1002\/net.20467","volume":"58","author":"C Archetti","year":"2011","unstructured":"Archetti, C., Bianchessi, N., Speranza, M.G.: A column generation approach for the split delivery vehicle routing problem. Networks 58, 241\u2013254 (2011)","journal-title":"Networks"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Archetti, C., Feillet, D., Speranza, M.G.: The complexity of the VRP and SDVRP (2011)","DOI":"10.1016\/j.trc.2009.12.006"},{"key":"17_CR6","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.C., Mota, E.: A lower bound for the split delivery vehicle routing problem. Oper. Res. 48, 801\u2013810 (2000)","journal-title":"Oper. Res."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-540-68279-0_1","volume-title":"50 Years of Integer Programming 1958-2008","author":"V Chv\u00e1tal","year":"2010","unstructured":"Chv\u00e1tal, V., Cook, W., Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: Solution of a large-scale traveling-salesman problem. In: J\u00fcnger, M., Liebling, Thomas M., Naddef, Denis, Nemhauser, George L., Pulleyblank, William R., Reinelt, Gerhard, Rinaldi, Giovanni, Wolsey, Laurence A. (eds.) 50 Years of Integer Programming 1958-2008, pp. 7\u201328. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_1"},{"issue":"2","key":"17_CR8","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). https:\/\/doi.org\/10.1287\/trsc.23.2.141","journal-title":"Transp. Sci."},{"issue":"3","key":"17_CR9","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1002\/nav.3800370304","volume":"37","author":"M Dror","year":"1990","unstructured":"Dror, M., Trudeau, Pierre: Split delivery routing: split delivery. Naval Res. Logist. (NRL) 37(3), 383\u2013402 (1990). https:\/\/doi.org\/10.1002\/nav.3800370304","journal-title":"Naval Res. Logist. (NRL)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Jin, M., Liu, K., Bowden, R.O.: A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem. Int. J. Prod. Econ. (2007)","DOI":"10.1016\/j.ijpe.2006.04.014"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Lin, T.-H., Sheng-Hung, C., Lin, I.-C.: A decision system for routing problems and rescheduling issues using unmanned aerial vehicles (2022)","DOI":"10.3390\/app12126140"},{"key":"17_CR12","unstructured":"LocalSolver. Retrieved from Example Tour - Split Delivery Vehicle Routing Problem: https:\/\/www.localsolver.com\/docs\/last\/exampletour\/split-delivery-vehicle-routing-problem-sdvrp.html"},{"key":"17_CR13","unstructured":"LocalSolver. Mathematical modeling features (2023). https:\/\/www.localsolver.com\/docs\/last\/modelingfeatures\/mathematicalmodelingfeatures.html"},{"key":"17_CR14","unstructured":"Slootbeek, J.J.A.: Average-Case Analysis of the 2-opt Heuristic for the TSP (2017)"},{"key":"17_CR15","unstructured":"Velazquez, E.: Application of the Vehicle Routing Problem (VRP) to a distribution problem. University of the Americas Puebla (2005)"},{"key":"17_CR16","unstructured":"Wilck IV, J., Cavalier, T.: Una construcci\u00f3n heur\u00edstica para el veh\u00edculo de reparto dividido problema de enrutamiento. Am. J. Oper. Res. (2012)"}],"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_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T19:04:41Z","timestamp":1688065481000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36805-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031368042","9783031368059"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36805-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}