{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:13:17Z","timestamp":1762506797314},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,4,22]],"date-time":"2016-04-22T00:00:00Z","timestamp":1461283200000},"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":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s10288-016-0315-1","type":"journal-article","created":{"date-parts":[[2016,4,22]],"date-time":"2016-04-22T11:13:41Z","timestamp":1461323621000},"page":"377-404","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem"],"prefix":"10.1007","volume":"14","author":[{"given":"Oualid","family":"Guemri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelghani","family":"Bekrar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bouziane","family":"Beldjilali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damien","family":"Trentesaux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"315_CR1","unstructured":"Abdelmaguid TF (2004) Heuristic approaches for the integrated inventory distribution problem. PhD thesis, University of Southern California, Los Angeles, USA"},{"issue":"21","key":"315_CR2","doi-asserted-by":"crossref","first-page":"4445","DOI":"10.1080\/00207540600597138","volume":"44","author":"TF Abdelmaguid","year":"2006","unstructured":"Abdelmaguid TF, Dessouky MM (2006) A genetic algorithm approach to the integrated inventory-distribution problem. Int J Prod Res 44(21):4445\u20134464","journal-title":"Int J Prod Res"},{"key":"315_CR3","unstructured":"Adulyasak Y, Cordeau JF, Jans R (2012) Formulations and branch-and-cut algorithms for multi-vehicule production and inventory routing problems. GERAD, Technical report G-2012-14, Canada"},{"issue":"3","key":"315_CR4","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1287\/trsc.1060.0188","volume":"41","author":"C Archetti","year":"2007","unstructured":"Archetti C, Bertazzi L, Laporte G, Speranza MG (2007) A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transp Sci 41(3):382\u2013391","journal-title":"Transp Sci"},{"issue":"1","key":"315_CR5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/ijoc.1100.0439","volume":"24","author":"C Archetti","year":"2012","unstructured":"Archetti C, Bertazzi L, Hertz A, Speranza MG (2012) A hybrid heuristic for an inventory routing problem. INFORMS J Comput 24(1):101\u2013116","journal-title":"INFORMS J Comput"},{"issue":"3","key":"315_CR6","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1111\/itor.12076","volume":"21","author":"C Archetti","year":"2014","unstructured":"Archetti C, Bianchessi N, Irnich S, Speranza MG (2014) Formulations for an inventory routing problem. Int Trans Oper Res 21(3):353\u2013374","journal-title":"Int Trans Oper Res"},{"issue":"2","key":"315_CR7","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1016\/j.cor.2012.08.012","volume":"40","author":"LC Coelho","year":"2013","unstructured":"Coelho LC, Laporte G (2013a) The exact solution of several classes of inventory-routing problems. Comput Oper Res 40(2):558\u2013565","journal-title":"Comput Oper Res"},{"issue":"23\u201324","key":"315_CR8","doi-asserted-by":"crossref","first-page":"7156","DOI":"10.1080\/00207543.2012.757668","volume":"51","author":"LC Coelho","year":"2013","unstructured":"Coelho LC, Laporte G (2013b) A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem. Int J Prod Res 51(23\u201324):7156\u20137169","journal-title":"Int J Prod Res"},{"issue":"11","key":"315_CR9","doi-asserted-by":"crossref","first-page":"2537","DOI":"10.1016\/j.cor.2011.12.020","volume":"39","author":"LC Coelho","year":"2012","unstructured":"Coelho LC, Cordeau JF, Laporte G (2012a) The inventory-routing problem with transshipment. Comput Oper Res 39(11):2537\u20132548","journal-title":"Comput Oper Res"},{"issue":"1","key":"315_CR10","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.trc.2012.03.007","volume":"24","author":"LC Coelho","year":"2012","unstructured":"Coelho LC, Cordeau JF, Laporte G (2012b) Consistency in multi-vehicle inventory-routing. Transp Res Part C Emerg Technol 24(1):270\u2013287","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"01","key":"315_CR11","doi-asserted-by":"crossref","first-page":"001","DOI":"10.1287\/trsc.2013.0472","volume":"48","author":"LC Coelho","year":"2014","unstructured":"Coelho LC, Cordeau JF, Laporte G (2014) Thirty years of inventory-routing. Transp Sci 48(01):001\u2013019","journal-title":"Transp Sci"},{"issue":"06","key":"315_CR12","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"37","author":"JF Cordeau","year":"2003","unstructured":"Cordeau JF, Laporte G (2003) A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp Res Part B 37(06):579\u2013594","journal-title":"Transp Res Part B"},{"key":"315_CR13","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.cor.2014.06.007","volume":"55","author":"JF Cordeau","year":"2015","unstructured":"Cordeau JF, Lagan D, Musmanno R, Vocaturo F (2015) A decomposition-based heuristic for the multiple-product inventory-routing problem. Comput Oper Res 55:153\u2013166","journal-title":"Comput Oper Res"},{"key":"315_CR14","unstructured":"Desaulniers G, Rakke JG, Coelho LC (2014) A branch-price-and-cut algorithm for the inventory-routing problem. GERAD, Technical report G-2014-12, Canada"},{"issue":"2","key":"315_CR15","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"06","author":"TA Feo","year":"1995","unstructured":"Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 06(2):109\u2013133","journal-title":"J Glob Optim"},{"issue":"03","key":"315_CR16","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"01","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u2014part I. ORSA J Comput 01(03):190\u2013206","journal-title":"ORSA J Comput"},{"issue":"1","key":"315_CR17","first-page":"3","volume":"47","author":"T Harks","year":"2013","unstructured":"Harks T, Konig F, Matuschke J (2013) Approximation algorithms for capacitated location routing. Eur J Oper Res 47(1):3\u201322","journal-title":"Eur J Oper Res"},{"issue":"02","key":"315_CR18","doi-asserted-by":"crossref","first-page":"001","DOI":"10.4018\/ijamc.2014040101","volume":"05","author":"A Lemouari","year":"2014","unstructured":"Lemouari A, Guemri O (2014) A two-phase scheduling method combined to the tabu search for the DARP. Int J Appl Metaheuristic Comput 05(02):001\u2013021","journal-title":"Int J Appl Metaheuristic Comput"},{"key":"315_CR19","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/j.cor.2013.06.006","volume":"52","author":"A Mjirda","year":"2014","unstructured":"Mjirda A, Jarboui B, Macedo R, Hanafi S, Mladenovic N (2014) A two phase variable neighborhood search for the multi-product inventory routing problem. Comput Oper Res 52:291\u2013299","journal-title":"Comput Oper Res"},{"issue":"1","key":"315_CR20","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/j.ijpe.2010.06.012","volume":"133","author":"NH Moin","year":"2011","unstructured":"Moin NH, Salhi S, Aziz NAB (2011) An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem. Inte J Prod Econ 133(1):334\u2013343","journal-title":"Inte J Prod Econ"},{"issue":"18","key":"315_CR21","doi-asserted-by":"crossref","first-page":"13390","DOI":"10.1016\/j.eswa.2012.05.064","volume":"39","author":"D Popovic","year":"2012","unstructured":"Popovic D, Vidovic M, Radivojevic G (2012) Variable neighborhood search heuristic for the inventory routing problem in fuel delivery. Expert Syst Appl 39(18):13390\u201313398","journal-title":"Expert Syst Appl"},{"issue":"3","key":"315_CR22","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1287\/trsc.1100.0354","volume":"45","author":"O Solyali","year":"2011","unstructured":"Solyali O, Sural H (2011) A branch-and-cut algorithm using a strong formulation and an a priori tour based heuristic for an inventory-routing problem. Transp Sci 45(3):335\u2013345","journal-title":"Transp Sci"},{"issue":"3","key":"315_CR23","doi-asserted-by":"crossref","first-page":"1022","DOI":"10.1016\/j.ejor.2007.02.061","volume":"189","author":"Y Yu","year":"2008","unstructured":"Yu Y, Chen H, Chu F (2008) A new model and hybrid approach for large-scale inventory routing problems. Eur J Oper Res 189(3):1022\u20131040","journal-title":"Eur J Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-016-0315-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-016-0315-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-016-0315-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-016-0315-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:13:00Z","timestamp":1559131980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-016-0315-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,22]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["315"],"URL":"https:\/\/doi.org\/10.1007\/s10288-016-0315-1","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,22]]}}}