{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T10:36:47Z","timestamp":1790678207105,"version":"4.1.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T00:00:00Z","timestamp":1670198400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T00:00:00Z","timestamp":1670198400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"CPER MMASYF 2018 Projet PEM VERT"},{"DOI":"10.13039\/100010665","name":"H2020 Marie Sklodowska-Curie Actions","doi-asserted-by":"publisher","award":["691161"],"award-info":[{"award-number":["691161"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010665","name":"H2020 Marie Sklodowska-Curie Actions","doi-asserted-by":"publisher","award":["691161"],"award-info":[{"award-number":["691161"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010665","name":"H2020 Marie Sklodowska-Curie Actions","doi-asserted-by":"publisher","award":["691161"],"award-info":[{"award-number":["691161"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-022-01486-2","type":"journal-article","created":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T17:03:25Z","timestamp":1670259805000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Paths with Impact on a Constraint System: An Application to the 1-Request Insertion for the Pickup and Delivery Problem with Transfers"],"prefix":"10.1007","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0599-306X","authenticated-orcid":false,"given":"Jos\u00e9-L.","family":"Figueroa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alain","family":"Quilliot","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"H\u00e9l\u00e8ne","family":"Toussaint","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Annegret","family":"Wagler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,12,5]]},"reference":[{"key":"1486_CR1","doi-asserted-by":"crossref","unstructured":"Figueroa JL, Quilliot A, Toussaint H, Wagler A. Optimal 1-Request Insertion for the Pickup and Delivery Problem with Transfers and Time Horizon. Paper presented at the 11th International Conference on Operations Research and Enterprise Systems (ICORES), 3\u20135 February 2022.","DOI":"10.5220\/0010787000003117"},{"key":"1486_CR2","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.cor.2018.09.007","volume":"102","author":"L Gouveia","year":"2019","unstructured":"Gouveia L, Leitner M, Ruthmair M. Layered graph approaches for combinatorial optimization problems. Comput Oper Res. 2019;102:22\u201338.","journal-title":"Comput Oper Res"},{"key":"1486_CR3","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/s11750-019-00506-4","volume":"27","author":"S Bsaybes","year":"2019","unstructured":"Bsaybes S, Quilliot A, Wagler AK. Fleet management for autonomous vehicles using flows in time-expanded networks. TOP. 2019;27:288\u2013311.","journal-title":"TOP"},{"issue":"2","key":"1486_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","volume":"15","author":"G Berbeglia","year":"2007","unstructured":"Berbeglia G, Cordeau JF, Gribkovskaia I, Laporte G. Static pickup and delivery problems: a classification scheme and survey. TOP. 2007;15(2):1\u201331.","journal-title":"TOP"},{"key":"1486_CR5","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","volume":"58","author":"S Parragh","year":"2008","unstructured":"Parragh S, Doerner K, Hartl R. A survey on pickup and delivery problems: part II: transportation between pickup and delivery locations. Journal f\u00fcr Betriebswirtschaft. 2008;58:81\u2013117.","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"issue":"1","key":"1486_CR6","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.ejor.2009.04.024","volume":"202","author":"G Berbeglia","year":"2010","unstructured":"Berbeglia G, Cordeau J-F, Laporte G. Dynamic pickup and delivery problems. Eur J Oper Res. 2010;202(1):8\u201315.","journal-title":"Eur J Oper Res"},{"key":"1486_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594","volume-title":"Vehicle Routing","author":"P Toth","year":"2014","unstructured":"Toth P, Vigo D. Vehicle Routing. Philadelphia: Society for Industrial and Applied Mathematics; 2014."},{"issue":"3","key":"1486_CR8","first-page":"217","volume":"44","author":"G Laporte","year":"2006","unstructured":"Laporte G, Mitrovi\u0107-Mini\u0107 S. The pickup and delivery problem with time windows and transshipment. INFOR. 2006;44(3):217\u201327.","journal-title":"INFOR"},{"key":"1486_CR9","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10100-007-0035-x","volume":"15","author":"S Thangiah","year":"2007","unstructured":"Thangiah S, Fergany A, Awan S. Real-time split-delivery pickup and delivery time window problems with transfers. Cent Eur J Oper Res. 2007;15:329\u201349.","journal-title":"Cent Eur J Oper Res"},{"issue":"2","key":"1486_CR10","first-page":"711","volume":"200","author":"C Contardo","year":"2010","unstructured":"Contardo C, Cort\u00e8s C, Matamala M. The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method. Eur J Oper Res. 2010;200(2):711\u201324.","journal-title":"Eur J Oper Res"},{"key":"1486_CR11","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-22922-0_8","volume-title":"Advances in spatial and temporal databases","author":"P Bouros","year":"2011","unstructured":"Bouros P, Sacharidis D, Dalamagas T, Sellis T. Dynamic pickup and delivery with transfers. In: Pfoser D, Tao Y, Mouratidis K, Nascimento MA, Mokbel M, Shekhar S, Huang Y, editors. Advances in spatial and temporal databases. Berlin: Springer; 2011. p. 112\u201329."},{"key":"1486_CR12","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.trb.2018.02.001","volume":"111","author":"SC Ho","year":"2018","unstructured":"Ho SC, Kuo Y-H, Leung JMY, Petering M, Szeto WY, Tou TWH. A survey of dial-a-ride problems: literature review and recent developments. Transport Res Part B. 2018;111:395\u2013421.","journal-title":"Transport Res Part B"},{"key":"1486_CR13","unstructured":"Masson R, Lehu\u00e9d\u00e9 F, P\u00e9ton O. A tabu search algorithm for the dial-a-ride problem with transfers. Proceedings of the IESM 2011 Conference 2011."},{"key":"1486_CR14","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2013.07.020","volume":"41","author":"R Masson","year":"2014","unstructured":"Masson R, Lehu\u00e9d\u00e9 F, P\u00e9ton O. The dial-a-ride problem with transfers. Comput Oper Res. 2014;41:12\u201323.","journal-title":"Comput Oper Res"},{"issue":"9","key":"1486_CR15","doi-asserted-by":"publisher","first-page":"1256","DOI":"10.3182\/20130619-3-RU-3018.00435","volume":"46","author":"S Deleplanque","year":"2013","unstructured":"Deleplanque S, Quilliot A. Dial-a-ride problem with time windows, transshipments, and dynamic transfer points. IFAC Proc Volumes. 2013;46(9):1256\u201361 (7th IFAC Conference on Manufacturing Modelling, Management, and Control).","journal-title":"IFAC Proc Volumes"},{"issue":"3","key":"1486_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.orl.2013.01.007","volume":"41","author":"F Lehu\u00e9d\u00e9","year":"2013","unstructured":"Lehu\u00e9d\u00e9 F, Masson R, P\u00e9ton O. Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers. Oper Res Lett. 2013;41(3):211\u20135.","journal-title":"Oper Res Lett"},{"issue":"1","key":"1486_CR17","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.ejor.2012.09.008","volume":"225","author":"LB Reinhardt","year":"2013","unstructured":"Reinhardt LB, Clausen T, Pisinger D. Synchronized dial-a-ride transportation of disabled passengers at airports. Eur J Oper Res. 2013;225(1):106\u201317.","journal-title":"Eur J Oper Res"},{"key":"1486_CR18","doi-asserted-by":"crossref","unstructured":"Sch\u00f6nberger J. Scheduling constraints in dial-a-ride problems with transfers: a metaheuristic approach incorporating a cross-route scheduling procedure with postponement opportunities. Public Transp. 2017;9:243\u201372.","DOI":"10.1007\/s12469-016-0139-6"},{"key":"1486_CR19","doi-asserted-by":"crossref","unstructured":"Xue G. A two-stage heuristic solution for multi-depot collaborative pickup and delivery network with transfers to reduce carbon emissions. J Clean Prod. 2022;373: 133839.","DOI":"10.1016\/j.jclepro.2022.133839"},{"key":"1486_CR20","doi-asserted-by":"crossref","unstructured":"Hart PE, Nilsson NJ, Raphael B. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern SSC. 1968;4(2):100\u20137.","DOI":"10.1109\/TSSC.1968.300136"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01486-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-022-01486-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01486-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T22:31:15Z","timestamp":1673130675000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-022-01486-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,5]]},"references-count":20,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,1]]}},"alternative-id":["1486"],"URL":"https:\/\/doi.org\/10.1007\/s42979-022-01486-2","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,5]]},"assertion":[{"value":"22 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"79"}}