{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T10:41:44Z","timestamp":1761129704855},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030347055"},{"type":"electronic","value":"9783030347062"}],"license":[{"start":{"date-parts":[[2019,12,15]],"date-time":"2019-12-15T00:00:00Z","timestamp":1576368000000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-34706-2_7","type":"book-chapter","created":{"date-parts":[[2019,12,14]],"date-time":"2019-12-14T12:05:52Z","timestamp":1576325152000},"page":"117-136","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Tabu Search Algorithm for Vehicle Routing Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Joanna","family":"Ochelska-Mierzejewska","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,15]]},"reference":[{"key":"7_CR1","unstructured":"Beck JC (2003) Vehicle routing and job shop scheduling: what\u2019s the difference?. ICAPS03, 267\u2013276"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Chang Y, Chen L (2007) Solve the vehicle routing problem with time windows via a genetic algorithm. Discret Contin Dyn Syst Suppl 240\u2013249. \nhttps:\/\/doi.org\/10.3934\/proc.2007.2007.240","DOI":"10.3934\/proc.2007.2007.240"},{"key":"7_CR3","first-page":"351","volume-title":"Modern approach for building of multi-agent systems, LNCS (LNAI) 5722","author":"L Chomatek","year":"2009","unstructured":"Chomatek L, Poniszewska-Maranda A (2009) Modern approach for building of multi-agent systems, LNCS (LNAI) 5722. Springer, Heidelberg, pp 351\u2013360"},{"issue":"V1","key":"7_CR4","first-page":"55","volume":"10","author":"N Christofides","year":"1976","unstructured":"Christofides N (1976) Vehicle routing problem. Rev Fr D\u2019Automatique 10(V1):55\u201370","journal-title":"Rev Fr D\u2019Automatique"},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01589353","volume":"20","author":"N Christofides","year":"1981","unstructured":"Christofides N, Mingozzi A, Toth P (1981) Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relexations. Math Program 20(1):255\u2013282","journal-title":"Math Program"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manag Sci 40(10), INFORMS, 1276\u20131290","DOI":"10.1287\/mnsc.40.10.1276"},{"key":"7_CR7","unstructured":"Gendreau M, Potvin J-Y, Br\u00e4umlaysy O, Hasle G, L\u00f8kketangen A (2008) Metaheuristics for the vehicle routing problem and its extensions: a categorized bibiography. In: Golden B, Raghavan S, Wasil E (eds) The vehicle routing problem: latest advances and new challenges. Operations research\/computer science interfaces, vol 43. Springer, Boston, MA"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Gendreau M, Potvin J-Y (2010) Handbook of metaheuristics. Springer Science Business Media","DOI":"10.1007\/978-1-4419-1665-5"},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search: Part 1. ORSA J Comput 1(3):190\u2013206","journal-title":"ORSA J Comput"},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search: Part 2. ORSA J Comput 2(1):4\u201332","journal-title":"ORSA J Comput"},{"issue":"4","key":"7_CR11","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/inte.20.4.74","volume":"20","author":"F Glover","year":"1990","unstructured":"Glover F (1990) Tabu search: a tutorial. Interfaces 20(4):74\u201394","journal-title":"Interfaces"},{"key":"7_CR12","unstructured":"Glover F (1995) Tabu search fundamentals and uses"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Golden BL, Raghavan S, Wasil EA (2008) The vehicle routing problem: latest advances and new challenges. Springer Science and Business Media","DOI":"10.1007\/978-0-387-77778-8"},{"issue":"2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"108","DOI":"10.13189\/csit.2014.020208","volume":"2","author":"A-R Hedar","year":"2014","unstructured":"Hedar A-R, Bakr MA (2014) Three strategies tabu search for vehicle routing problem with time windows. Comput Sci Inf Technol 2(2):108\u2013119. \nhttps:\/\/doi.org\/10.13189\/csit.2014.020208","journal-title":"Comput Sci Inf Technol"},{"issue":"3","key":"7_CR15","first-page":"495","volume":"64","author":"A Majchrzycka","year":"2016","unstructured":"Majchrzycka A, Poniszewska-Maranda A (2016) Secure development model for mobile applications, bulletin of the polish academy of sciences. Tech Sci 64(3):495\u2013503","journal-title":"Tech Sci"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"IH Osman","year":"1993","unstructured":"Osman IH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems. Ann Oper Res 41:421\u2013451","journal-title":"Ann Oper Res"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-319-44215-0_12","volume-title":"Mobile Web and Intelligent Information Systems","author":"Aneta Poniszewska-Maranda","year":"2016","unstructured":"Poniszewska-Maranda A, Majchrzycka A (2016) Access control approach in development of mobile applications. In: Younas M et al (eds) Mobile web and intelligent information systems, MobiWIS 2016, LNCS 9847, Publisher: Springer Heidelberg, pp 149\u2013162"},{"issue":"8","key":"7_CR18","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"David Pisinger","year":"2007","unstructured":"Pisinger C, R\u00f8pke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34(8):2403\u20132435. \nhttps:\/\/doi.org\/10.1016\/j.cor.2005.09.012","journal-title":"Computers & Operations Research"},{"key":"7_CR19","unstructured":"Ropke S (2005) Heuristic and exact algorithms for vehicle routing problems. Department of Computer Science at the University of Copenhagen"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tre.2013.05.005","volume":"56","author":"S Salhi","year":"2013","unstructured":"Salhi S, Wassan N, Hajarat M (2013) The fleet size and mix vehicle routing problem with backhauls: formulation and set partitioning-based heuristics. Transp Res Part E: Logist Transp Rev 56:22\u201335. \nhttps:\/\/doi.org\/10.1016\/j.tre.2013.05.005","journal-title":"Transp Res Part E: Logist Transp Rev"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/BF02023006","volume":"41","author":"F Semet","year":"1993","unstructured":"Semet F, Taillard E (1993) Solving real-life vehicle routing problems efficiently using tabu search. Ann Oper Res 41:469\u2013488","journal-title":"Ann Oper Res"},{"issue":"2","key":"7_CR22","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254\u2013265","journal-title":"Oper Res"},{"key":"7_CR23","unstructured":"Solomon MM (2019). In: VRPTW benchmark problems. \nhttp:\/\/web.cba.neu.edu\/~msolomon\/problems.htm"},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0954-1810(01)00005-X","volume":"15","author":"KC Tan","year":"2001","unstructured":"Tan KC (2001) Heuristic methods for vehicle routing problem with time windows. Artif Intell Eng 15:281\u2013295","journal-title":"Artif Intell Eng"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D (2002) The vehicle routing problem. Society for Industrial and Applied Mathematics","DOI":"10.1137\/1.9780898718515"},{"issue":"2","key":"7_CR26","first-page":"72","volume":"3","author":"V Vacic","year":"2004","unstructured":"Vacic V, Sobh TM (2004) Vehicle routing problem with time windows. Int Sci J Comput 3(2):72\u201380","journal-title":"Int Sci J Comput"},{"key":"7_CR27","unstructured":"Willard JAG (1989) Vehicle routing using r-optimal tabu search. Master\u2019s thesis, The management school, Imerial college, London"}],"container-title":["Lecture Notes on Data Engineering and Communications Technologies","Data-Centric Business and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34706-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,14]],"date-time":"2019-12-14T12:22:32Z","timestamp":1576326152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34706-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,15]]},"ISBN":["9783030347055","9783030347062"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34706-2_7","relation":{},"ISSN":["2367-4512","2367-4520"],"issn-type":[{"type":"print","value":"2367-4512"},{"type":"electronic","value":"2367-4520"}],"subject":[],"published":{"date-parts":[[2019,12,15]]},"assertion":[{"value":"15 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}