{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:22:39Z","timestamp":1774369359974,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030499877","type":"print"},{"value":"9783030499884","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-49988-4_24","type":"book-chapter","created":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T23:02:53Z","timestamp":1593385373000},"page":"343-358","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Matheuristic for the Drilling Rig Routing Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7033-1652","authenticated-orcid":false,"given":"Igor","family":"Kulachenko","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1956-5613","authenticated-orcid":false,"given":"Polina","family":"Kononova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,29]]},"reference":[{"key":"24_CR1","volume-title":"Local Search in Combinatorial Optimization","author":"E Aarts","year":"1997","unstructured":"Aarts, E., Lenstra, J.: Local Search in Combinatorial Optimization. John Wiley & Sons, New York (1997)"},{"issue":"1\u20132","key":"24_CR2","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."},{"issue":"4","key":"24_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s13675-014-0030-7","volume":"2","author":"C Archetti","year":"2014","unstructured":"Archetti, C., Speranza, M.G.: A survey on matheuristics for routing problems. EURO J. Comput. Optim. 2(4), 223\u2013246 (2014). \nhttps:\/\/doi.org\/10.1007\/s13675-014-0030-7","journal-title":"EURO J. Comput. Optim."},{"issue":"3","key":"24_CR4","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1287\/opre.44.3.501","volume":"44","author":"J Bramel","year":"1996","unstructured":"Bramel, J., Simchi-Levi, D.: Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows. Oper. Res. 44(3), 501\u2013509 (1996)","journal-title":"Oper. Res."},{"issue":"1","key":"24_CR5","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Vehicle routing problem with time windows, Part I: route construction and local search algorithms. Transp. Sci. 39(1), 104\u2013118 (2005)","journal-title":"Transp. Sci."},{"key":"24_CR6","unstructured":"Gendreau, M., Tarantilis, C.D.: Solving large-scale vehicle routing problems with time windows: the state-of-the-art. In: CIRRELT-2010-04, Montreal (2010)"},{"key":"24_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","author":"BL Golden","year":"2008","unstructured":"Golden, B.L., Raghavan, S., Wasil, E.A.: The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, Boston (2008). \nhttps:\/\/doi.org\/10.1007\/978-0-387-77778-8"},{"key":"24_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/b101971","volume-title":"The Traveling Salesman Problem and Its Variations","author":"G Gutin","year":"2002","unstructured":"Gutin, G., Punnen, A.: The Traveling Salesman Problem and Its Variations. Springer, Boston (2002). \nhttps:\/\/doi.org\/10.1007\/b101971"},{"issue":"3","key":"24_CR9","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2016","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423\u2013454 (2016). \nhttps:\/\/doi.org\/10.1007\/s13675-016-0075-x","journal-title":"EURO J. Comput. Optim."},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1287\/trsc.2013.0459","volume":"48","author":"VC Hemmelmayr","year":"2014","unstructured":"Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F., Vigo, D.: Models and algorithms for the integrated planning of bin allocation and vehicle routing in solid waste management. Transp. Sci. 48, 103\u2013120 (2014)","journal-title":"Transp. Sci."},{"issue":"12","key":"24_CR11","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1016\/S0305-0548(03)00155-2","volume":"31","author":"S Ho","year":"2004","unstructured":"Ho, S., Haugland, D.: A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput. Oper. Res. 31(12), 1947\u20131964 (2004)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"24_CR12","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1287\/ijoc.1070.0239","volume":"20","author":"S Irnich","year":"2008","unstructured":"Irnich, S.: A unified modeling and solution framework for vehicle routing and local search-based metaheuristics. INFORMS J. Comput. 20(2), 270\u2013287 (2008)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"24_CR13","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B Kernighan","year":"1970","unstructured":"Kernighan, B., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"key":"24_CR14","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-030-33394-2_5","volume-title":"Mathematical Optimization Theory and Operations Research","author":"I Kulachenko","year":"2019","unstructured":"Kulachenko, I., Kononova, P.: The VNS approach for a consistent capacitated vehicle routing problem under the shift length constraints. In: Bykadorov, I., Strusevich, V., Tchemisova, T. (eds.) MOTOR 2019. CCIS, vol. 1090, pp. 51\u201367. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-33394-2_5"},{"issue":"10","key":"24_CR15","doi-asserted-by":"publisher","first-page":"2918","DOI":"10.1016\/j.cor.2005.11.018","volume":"34","author":"F Li","year":"2007","unstructured":"Li, F., Golden, B., Wasil, E.: The open vehicle routing problem: algorithms, large-scale test problems, and computational results. Comput. Oper. Res. 34(10), 2918\u20132930 (2007)","journal-title":"Comput. Oper. Res."},{"key":"24_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1306-7","volume-title":"Matheuristics: Hybridizing Metaheuristics and Mathematical Programming","author":"V Maniezzo","year":"2009","unstructured":"Maniezzo, V., St\u00fctzle, T., Vo\u00df, S.: Matheuristics: Hybridizing Metaheuristics and Mathematical Programming. Springer, Boston (2009). \nhttps:\/\/doi.org\/10.1007\/978-1-4419-1306-7"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"24_CR18","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., Br\u00e4ysy, 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)","journal-title":"Comput. Oper. Res."},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1287\/ijoc.4.2.146","volume":"4","author":"MWP Savelsbergh","year":"1992","unstructured":"Savelsbergh, M.W.P.: The vehicle routing problem with time windows: minimizing route duration. INFORMS J. Comput. 4, 146\u2013154 (1992)","journal-title":"INFORMS J. Comput."},{"key":"24_CR20","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1985","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35, 254\u2013265 (1985)","journal-title":"Oper. Res."},{"key":"24_CR21","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, Hoboken (2009)"},{"key":"24_CR22","doi-asserted-by":"publisher","unstructured":"Talbi, E.G.: Hybrid Metaheuristics. Springer, Berlin (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-30671-6","DOI":"10.1007\/978-3-642-30671-6"},{"key":"24_CR23","volume-title":"Vehicle Routing: Problems, Methods, and Applications","year":"2014","unstructured":"Toth, P., Vigo, D. (eds.): Vehicle Routing: Problems, Methods, and Applications, 2nd edn. Society for Industrial and Applied Mathematics, Philadelphia (2014)","edition":"2"},{"issue":"1","key":"24_CR24","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)","journal-title":"Comput. Oper. Res."},{"key":"24_CR25","doi-asserted-by":"publisher","first-page":"1611","DOI":"10.1007\/s11590-012-0571-8","volume":"7","author":"E Yakici","year":"2013","unstructured":"Yakici, E., Karasakal, O.: A min-max vehicle routing problem with split delivery and heterogeneous demand. Optim. Lett. 7, 1611\u20131625 (2013)","journal-title":"Optim. Lett."}],"container-title":["Lecture Notes in Computer Science","Mathematical Optimization Theory and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-49988-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,28]],"date-time":"2020-06-28T23:04:58Z","timestamp":1593385498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-49988-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030499877","9783030499884"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-49988-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOTOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Optimization Theory and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Novosibirsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"motor2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.math.nsc.ru\/conference\/motor\/2020\/","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":"102","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":"31","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":"30% - 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":"3,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":"2,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)"}}]}}