{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:53:03Z","timestamp":1760709183455},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319387871"},{"type":"electronic","value":"9783319387895"}],"license":[{"start":{"date-parts":[[2016,11,9]],"date-time":"2016-11-09T00:00:00Z","timestamp":1478649600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-38789-5_77","type":"book-chapter","created":{"date-parts":[[2016,11,8]],"date-time":"2016-11-08T05:54:56Z","timestamp":1478584496000},"page":"707-728","source":"Crossref","is-referenced-by-count":5,"title":["A Novel Meta-Heuristic Combinatory Method for Solving Capacitated Vehicle Location-Routing Problem with Hard Time\u00a0Windows"],"prefix":"10.1007","author":[{"given":"Ali Asghar Rahmani","family":"Hosseinabadi","sequence":"first","affiliation":[]},{"given":"Fataneh","family":"Alavipour","sequence":"additional","affiliation":[]},{"given":"Shahaboddin","family":"Shamshirbnd","sequence":"additional","affiliation":[]},{"given":"Valentina E.","family":"Balas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,9]]},"reference":[{"issue":"2","key":"77_CR1","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.ejor.2006.04.004","volume":"177","author":"G Nagy","year":"2007","unstructured":"Nagy G, Salhi S (2007) Location-routing: issues, models and methods. Eur J Oper Res 177(2):649\u2013672","journal-title":"Eur J Oper Res"},{"issue":"3","key":"77_CR2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10288-006-0001-9","volume":"4","author":"C Prins","year":"2006","unstructured":"Prins C, Prodhon C, Calvo RW (2006) Solving the capacitated location- routing problem by a GRASP complemented by a learning process and a path relinking. A Q J Oper Res 4(3):221\u2013238","journal-title":"A Q J Oper Res"},{"key":"77_CR3","unstructured":"Prins C, Prodhon C, Calvo RW (2006) A memetic algorithm with population management (MA $${\\vert }$$ | PM) for the capacitated location-routing problem. Lecture notes in computer science, vol 3906. Springer, Berlin, pp 183\u2013194"},{"key":"77_CR4","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1016\/j.ejor.2005.06.074","volume":"179","author":"S Barreto","year":"2007","unstructured":"Barreto S, Ferreira C, Paixa J, Santos BS (2007) Using clustering analysis in capacitated location-routing problem. Eur J Oper Res 179:968\u2013977","journal-title":"Eur J Oper Res"},{"key":"77_CR5","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/trsc.1060.0187","volume":"41","author":"C Prins","year":"2007","unstructured":"Prins C, Prodhon C, Ruiz A, Soriano P, Calvo RW (2007) Solving the capacitated locationrouting problem by a cooperative Lagrangean relaxation granular tabu search heuristic. Transp Sci 41:470\u2013483","journal-title":"Transp Sci"},{"key":"77_CR6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10852-007-9073-6","volume":"7","author":"Y Marinakis","year":"2008","unstructured":"Marinakis Y, Marinaki M (2008) A particle swarm optimization algorithm with path relinking for the location routing problem. J Math Model Algorithms 7:59\u201378","journal-title":"J Math Model Algorithms"},{"key":"77_CR7","doi-asserted-by":"crossref","first-page":"1912","DOI":"10.1016\/j.cor.2009.07.004","volume":"37","author":"C Duhamel","year":"2010","unstructured":"Duhamel C, Lacomme P, Prins C, Prodhon C (2010) A GRASP $$\\times $$ \u00d7 ELS approach for the capacitated location-routing problem. Comput Oper Res 37:1912\u20131923","journal-title":"Comput Oper Res"},{"key":"77_CR8","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.cie.2009.10.007","volume":"58","author":"VF Yu","year":"2010","unstructured":"Yu VF, Lin S-W, Lee W, Ting C-J (2010) A simulated annealing heuristic for the capacitated location-routing problem. Comput Ind Eng 58:288\u2013299","journal-title":"Comput Ind Eng"},{"key":"77_CR9","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.ejor.2011.07.030","volume":"216","author":"V-P Nguyen","year":"2012","unstructured":"Nguyen V-P, Prins C, Prodhon C (2012) Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking. Eur J Oper Res 216:113\u2013126","journal-title":"Eur J Oper Res"},{"key":"77_CR10","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.engappai.2011.09.012","volume":"25","author":"V-P Nguyen","year":"2012","unstructured":"Nguyen V-P, Prins C, Prodhon C (2012) A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem. Eng Appl Artif Intell 25:56\u201371","journal-title":"Eng Appl Artif Intell"},{"key":"77_CR11","unstructured":"Jabal-Ameli MS, Ghaffari-Nasab N (2010) Location-routing problem with time windows: novel mathematical programming formulations. In: 7th International industrial engineering conference. Isfahan, Iran"},{"key":"77_CR12","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u2019c","year":"1997","unstructured":"Mladenovi\u2019c N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24:1097\u20131100","journal-title":"Comput Oper Res"},{"key":"77_CR13","doi-asserted-by":"crossref","unstructured":"Kirkpatrick S, Gelatti CD, Vecchi MP (1983) Optimization by simulated annealing. In: Science is currently published by American association for the advancement of science, vol 220, no. 4598, pp 671\u2013680","DOI":"10.1126\/science.220.4598.671"},{"key":"77_CR14","doi-asserted-by":"crossref","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:254\u2013265","journal-title":"Oper Res"},{"key":"77_CR15","unstructured":"http:\/\/web.cba.neu.edu\/~msolomon"},{"key":"77_CR16","unstructured":"http:\/\/prodhonc.free.fr\/homepage"}],"container-title":["Advances in Intelligent Systems and Computing","Information Technology and Intelligent Transportation Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-38789-5_77","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T23:03:53Z","timestamp":1498345433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-38789-5_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,9]]},"ISBN":["9783319387871","9783319387895"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-38789-5_77","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2016,11,9]]}}}