{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:25:35Z","timestamp":1742981135848,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031041471"},{"type":"electronic","value":"9783031041488"}],"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-04148-8_5","type":"book-chapter","created":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T18:02:31Z","timestamp":1649008951000},"page":"62-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Deep Infeasibility Exploration Method for\u00a0Vehicle Routing Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3048-3704","authenticated-orcid":false,"given":"Piotr","family":"Beling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0022-7531","authenticated-orcid":false,"given":"Piotr","family":"Cybula","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8337-888X","authenticated-orcid":false,"given":"Andrzej","family":"Jaszkiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8839-4873","authenticated-orcid":false,"given":"Przemys\u0142aw","family":"Pe\u0142ka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7323-5017","authenticated-orcid":false,"given":"Marek","family":"Rogalski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4594-1854","authenticated-orcid":false,"given":"Piotr","family":"Sielski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,4]]},"reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/S0377-2217(01)00379-4","volume":"142","author":"J Blazewicz","year":"2002","unstructured":"Blazewicz, J., Kobler, D.: Review of properties of different precedence graphs for scheduling problems. Eur. J. Oper. Res. 142(3), 435\u2013443 (2002). https:\/\/doi.org\/10.1016\/S0377-2217(01)00379-4","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-319-55453-2_9","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"M Blocho","year":"2017","unstructured":"Blocho, M., Nalepa, J.: LCS-based selective route exchange crossover for the pickup and delivery problem with time windows. In: Hu, B., L\u00f3pez-Ib\u00e1\u00f1ez, M. (eds.) Evolutionary Computation in Combinatorial Optimization, pp. 124\u2013140. Springer International Publishing, Cham (2017)"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers, K., Ramaekers, K., Nieuwenhuyse, I.V.: The vehicle routing problem: State of the art classification and review. Comput. Ind. Eng. 99, 300\u2013313 (2016). https:\/\/doi.org\/10.1016\/j.cie.2015.12.007","journal-title":"Comput. Ind. Eng."},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1016\/j.ejor.2005.01.042","volume":"173","author":"J Brandao","year":"2006","unstructured":"Brandao, J.: A new tabu search algorithm for the vehicle routing problem with backhauls. Eur. J. Oper. Res. 173, 540\u2013555 (2006). https:\/\/doi.org\/10.1016\/j.ejor.2005.01.042","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"5_CR5","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/S0045-7825(01)00323-1","volume":"191","author":"CAC Coello","year":"2002","unstructured":"Coello, C.A.C.: Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput. Meth. Appl. Mech. Eng. 191(11), 1245\u20131287 (2002). https:\/\/doi.org\/10.1016\/S0045-7825(01)00323-1","journal-title":"Comput. Meth. Appl. Mech. Eng."},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2), 105\u2013119 (1997). https:\/\/doi.org\/10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G"},{"issue":"6","key":"5_CR7","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"37","author":"JF Cordeau","year":"2003","unstructured":"Cordeau, J.F., Laporte, G.: A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp. Res. Part B: Methodol. 37(6), 579\u2013594 (2003)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"5_CR8","unstructured":"Gehring, H., Homberger, J.: A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In: University of Jyvaskyla, pp. 57\u201364 (1999)"},{"issue":"5","key":"5_CR9","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover, F.: Future paths for integer programming and links to artificial intelligence. Computer. Oper. Res. 13(5), 533\u2013549 (1986). https:\/\/doi.org\/10.1016\/0305-0548(86)90048-1","journal-title":"Computer. Oper. Res."},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10479-009-0597-1","volume":"183","author":"F Glover","year":"2011","unstructured":"Glover, F., Hao, J.K.: The case for strategic oscillation. Ann. Oper. Res. 183(1), 163\u2013173 (2011). https:\/\/doi.org\/10.1007\/s10479-009-0597-1","journal-title":"Ann. Oper. Res."},{"key":"5_CR11","first-page":"254","volume-title":"Evol. Comput. Combin. Optim.","author":"H Hashimoto","year":"2008","unstructured":"Hashimoto, H., Yagiura, M.: A path relinking approach with an adaptive mechanism to control parameters for the vehicle routing problem with time windows. In: van Hemert, J., Cotta, C. (eds.) Evol. Comput. Combin. Optim., pp. 254\u2013265. Springer, Berlin Heidelberg, Berlin, Heidelberg (2008)"},{"key":"5_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. In: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence. pp. 160. ICTAI 2001, IEEE Computer Society, Washington, DC, USA (2001)","DOI":"10.1109\/ICTAI.2001.974461"},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.swevo.2011.10.001","volume":"1","author":"E Mezura-Montes","year":"2011","unstructured":"Mezura-Montes, E., Coello, C.A.C.: Constraint-handling in nature-inspired numerical optimization: past, present and future. Swarm Evol. Comput. 1(4), 173\u2013194 (2011). https:\/\/doi.org\/10.1016\/j.swevo.2011.10.001","journal-title":"Swarm Evol. Comput."},{"key":"5_CR15","first-page":"287","volume":"34","author":"R Montemanni","year":"2009","unstructured":"Montemanni, R., Gambardella, L.: Ant colony system for team orienteering problems with time windows. Found. Comput. Decis. Sci. 34, 287\u2013306 (2009)","journal-title":"Found. Comput. Decis. Sci."},{"issue":"4","key":"5_CR16","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1016\/j.cor.2009.06.022","volume":"37","author":"Y Nagata","year":"2010","unstructured":"Nagata, Y., Braysy, O., Dullaert, W.: A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput. Oper. Res. 37(4), 724\u2013737 (2010). https:\/\/doi.org\/10.1016\/j.cor.2009.06.022","journal-title":"Comput. Oper. Res."},{"key":"5_CR17","unstructured":"OPLIB: The Orienteering Problem Library (2018). https:\/\/unicen.smu.edu.sg\/oplib-orienteering-problem-library\/"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/net.20212","volume":"51","author":"G Righini","year":"2008","unstructured":"Righini, G., Salani, M.: New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51, 155\u2013170 (2008). https:\/\/doi.org\/10.1002\/net.20212","journal-title":"Networks"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40, 455\u2013472 (2006). https:\/\/doi.org\/10.1287\/trsc.1050.0135","journal-title":"Transp. Sci."},{"issue":"3","key":"5_CR20","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/4235.873238","volume":"4","author":"TP Runarsson","year":"2000","unstructured":"Runarsson, T.P., Yao, X.: Stochastic ranking for constrained evolutionary optimization. IEEE Trans. Evol. Comput. 4(3), 284\u2013294 (2000). https:\/\/doi.org\/10.1109\/4235.873238","journal-title":"IEEE Trans. Evol. Comput."},{"key":"5_CR21","unstructured":"SINTEF\u2019s TOP PDPTW: TOP PDPTW Li & Lim benchmark (2019). https:\/\/www.sintef.no\/projectweb\/top\/pdptw\/li-lim-benchmark\/"},{"key":"5_CR22","unstructured":"SINTEF\u2019s TOP VRPTW: TOP VRPTW Gehring & Homberger benchmark (2019). https:\/\/www.sintef.no\/projectweb\/top\/vrptw\/homberger-benchmark\/"},{"key":"5_CR23","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: From Design to Implementation","author":"EG Talbi","year":"2009","unstructured":"Talbi, E.G.: Metaheuristics: From Design to Implementation. Wiley Publishing, Hoboken (2009)"},{"key":"5_CR24","series-title":"Centre for Research on Transportation","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4615-5755-5_1","volume-title":"Fleet Management and Logistics","author":"Paolo Toth","year":"1998","unstructured":"Toth, Paolo, Vigo, Daniele: Exact solution of the vehicle routing problem. In: Crainic, Teodor Gabriel, Laporte, Gilbert (eds.) Fleet Management and Logistics. CRT, pp. 1\u201331. Springer, Boston, MA (1998). https:\/\/doi.org\/10.1007\/978-1-4615-5755-5_1"},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Vaz Penna, P.H., Subramanian, A., Ochi, L.S.: An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. J. Heuristics 19(2, SI), 201\u2013232 (2013). https:\/\/doi.org\/10.1007\/s10732-011-9186-y","DOI":"10.1007\/s10732-011-9186-y"},{"issue":"1","key":"5_CR26","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","volume":"40","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Comput. Oper. Res. 40(1), 475\u2013489 (2013). https:\/\/doi.org\/10.1016\/j.cor.2012.07.018","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-04148-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T14:21:31Z","timestamp":1726928491000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-04148-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031041471","9783031041488"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-04148-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"4 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2022\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","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":"13","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":"0","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":"46% - 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":"4","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":"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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}