{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:20:56Z","timestamp":1774369256031,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030333935","type":"print"},{"value":"9783030333942","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-33394-2_5","type":"book-chapter","created":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T13:16:49Z","timestamp":1572441409000},"page":"51-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The VNS Approach for a Consistent Capacitated Vehicle Routing Problem Under the Shift Length Constraints"],"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":[[2019,10,27]]},"reference":[{"key":"5_CR1","volume-title":"Local Search in Combinatorial Optimization","author":"E Aarts","year":"1997","unstructured":"Aarts, E., Lenstra, J.: Local Search in Combinatorial Optimization. Wiley, New York (1997)"},{"issue":"1\u20133","key":"5_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"RK Ahuja","year":"2002","unstructured":"Ahuja, R.K., Ergun, \u00d6., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discrete Appl. Math. 123(1\u20133), 75\u2013102 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1016\/j.ejor.2006.12.063","volume":"191","author":"E Alekseeva","year":"2008","unstructured":"Alekseeva, E., Kochetov, Y., Plyasunov, A.: Complexity of local search for the p-median problem. Eur. J. Oper. Res. 191(3), 736\u2013752 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"5_CR4","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1057\/jors.2009.154","volume":"61","author":"S Coene","year":"2010","unstructured":"Coene, S., Arnout, A., Spieksma, F.: On a periodic vehicle routing problem. J. Oper. Res. Soc. 61(12), 1719\u20131728 (2010)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"JF Cordeau","year":"1997","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)","journal-title":"Networks"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manage. Sci."},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.endm.2012.10.002","volume":"39","author":"I Davydov","year":"2012","unstructured":"Davydov, I., Kochetov, Y., Carrizosa, E.: VNS heuristic for the $$(r|p)$$ -centroid problem on the plane. Electron. Notes Discrete Math. 39, 5\u201312 (2012)","journal-title":"Electron. Notes Discrete Math."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.cor.2013.05.003","volume":"52","author":"I Davydov","year":"2014","unstructured":"Davydov, I., Kochetov, Y., Carrizosa, E.: A local search heuristic for the $$(r|p)$$ -centroid problem in the plane. Comput. OR 52, 334\u2013340 (2014)","journal-title":"Comput. OR"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.endm.2012.10.005","volume":"39","author":"Z Diakova","year":"2012","unstructured":"Diakova, Z., Kochetov, Y.: A double VNS heuristic for the facility location and pricing problem. Electron. Notes Discrete Math. 39, 29\u201334 (2012)","journal-title":"Electron. Notes Discrete Math."},{"issue":"10","key":"5_CR10","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M Gendreau","year":"1994","unstructured":"Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Manage. Sci. 40(10), 1276\u20131290 (1994)","journal-title":"Manage. Sci."},{"key":"5_CR11","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, US (2008). https:\/\/doi.org\/10.1007\/978-0-387-77778-8"},{"issue":"4","key":"5_CR12","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1287\/msom.1080.0243","volume":"11","author":"C Gro\u00ebr","year":"2009","unstructured":"Gro\u00ebr, C., Golden, B., Wasil, E.: The consistent vehicle routing problem. Manuf. Serv. Oper. Manag. 11(4), 630\u2013643 (2009)","journal-title":"Manuf. Serv. Oper. Manag."},{"issue":"4","key":"5_CR13","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0167-6377(92)90049-9","volume":"12","author":"LK Grover","year":"1992","unstructured":"Grover, L.K.: Local search and the local structure of NP-complete problems. Oper. Res. Lett. 12(4), 235\u2013243 (1992)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0305-0548(98)00065-3","volume":"26","author":"GZ Gutin","year":"1999","unstructured":"Gutin, G.Z., Yeo, A.: Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour. Comput. Oper. Res. 26(4), 321\u2013327 (1999)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"5_CR15","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.ejor.2007.08.048","volume":"195","author":"VC Hemmelmayr","year":"2009","unstructured":"Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F.: A variable neighborhood search heuristic for periodic routing problems. Eur. J. Oper. Res. 195(3), 791\u2013802 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR16","first-page":"1","volume-title":"Vehicle Routing","author":"Stefan Irnich","year":"2014","unstructured":"Irnich S., Toth, P., Vigo, D.: The family of vehicle routing problems.In: Vehicle Routing: Problems, Methods, and Applications, pp. 1\u201333. Society for Industrial and Applied Mathematics, Philadelphia (2014)"},{"issue":"2","key":"5_CR17","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":"5_CR18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.endm.2014.11.002","volume":"47","author":"A Khmelev","year":"2015","unstructured":"Khmelev, A., Kochetov, Y.: A hybrid VND method for the split delivery vehicle routing problem. Electron. Notes Discrete Math. 47, 5\u201312 (2015)","journal-title":"Electron. Notes Discrete Math."},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2298\/YJOR0801001K","volume":"18","author":"Y Kochetov","year":"2008","unstructured":"Kochetov, Y., Kononova, P., Paschenko, M.: Formulation space search approach for the teacher\/class timetabling problem. Yugoslav J. Oper. Res. 18(1), 1\u201311 (2008)","journal-title":"Yugoslav J. Oper. Res."},{"issue":"4","key":"5_CR20","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1134\/S1990478915040079","volume":"9","author":"Y Kochetov","year":"2015","unstructured":"Kochetov, Y., Khmelev, A.: A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem. J. Appl. Ind. Math. 9(4), 503\u2013518 (2015)","journal-title":"J. Appl. Ind. Math."},{"issue":"5","key":"5_CR21","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1134\/S0965542508050059","volume":"48","author":"Y Kochetov","year":"2008","unstructured":"Kochetov, Y.: Computational bounds for local search in combinatorial optimization. Comput. Math. Math. Phys. 48(5), 747\u2013763 (2008)","journal-title":"Comput. Math. Math. Phys."},{"issue":"1","key":"5_CR22","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1134\/S1990478913010067","volume":"7","author":"P Kononova","year":"2013","unstructured":"Kononova, P., Kochetov, Y.: The variable neighborhood search for the two machine flow shop problem with a passive prefetch. J. Appl. Ind. Math. 7(1), 54\u201367 (2013)","journal-title":"J. Appl. Ind. Math."},{"issue":"3","key":"5_CR23","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1002\/net.21565","volume":"63","author":"AA Kovacs","year":"2014","unstructured":"Kovacs, A.A., Golden, B.L., Hartl, R.F., Parragh, S.N.: Vehicle routing problems in which consistency considerations are important: a survey. Networks 63(3), 192\u2013213 (2014)","journal-title":"Networks"},{"issue":"1","key":"5_CR24","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1002\/net.21522","volume":"63","author":"AA Kovacs","year":"2014","unstructured":"Kovacs, A.A., Parragh, S.N., Hartl, R.F.: A template-based adaptive large neighborhood search for the consistent vehicle routing problem. Networks 63(1), 60\u201381 (2014)","journal-title":"Networks"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Kulachenko, I., Kononova, P., Kochetov, Y., Kurochkin, A.: The variable neighborhood search for a consistent vehicle routing problem under the shift length constraints. In: Proceedings of the 9-th IFAC Conference Manufacturing Modelling, Management and Control MIM 2019 (2019, Accepted)","DOI":"10.1007\/978-3-030-33394-2_5"},{"key":"5_CR26","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."},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-1-4615-1507-4_19","volume-title":"Essays and Surveys in Metaheuristics","author":"N Mladenovic","year":"2002","unstructured":"Mladenovic, N., Hansen, P.: Developments of variable neighborhood search. In: Ribeiro, C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, vol. 2, 1st edn, pp. 415\u2013439. Springer, Boston (2002). https:\/\/doi.org\/10.1007\/978-1-4615-1507-4_19","edition":"1"},{"key":"5_CR28","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, USA (2009)"}],"container-title":["Communications in Computer and Information Science","Mathematical Optimization Theory and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33394-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,10]],"date-time":"2019-12-10T14:13:07Z","timestamp":1575987187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-33394-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030333935","9783030333942"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33394-2_5","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"27 October 2019","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":"Ekaterinburg","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"motor2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/motor2019.uran.ru","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":"170","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":"40","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":"4","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":"3.34","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.64","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)"}}]}}