{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T06:50:35Z","timestamp":1771570235910,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,8,9]],"date-time":"2020-08-09T00:00:00Z","timestamp":1596931200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,9]],"date-time":"2020-08-09T00:00:00Z","timestamp":1596931200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s12351-020-00593-3","type":"journal-article","created":{"date-parts":[[2020,8,9]],"date-time":"2020-08-09T07:02:41Z","timestamp":1596956561000},"page":"1157-1207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A column generation approach for an inventory routing problem with fuzzy time windows"],"prefix":"10.1007","volume":"22","author":[{"given":"Amir Saeed Nikkhah","family":"Qamsari","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2568-187X","authenticated-orcid":false,"given":"Seyyed-Mahdi","family":"Hosseini-Motlagh","sequence":"additional","affiliation":[]},{"given":"Seyed Farid","family":"Ghannadpour","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,9]]},"reference":[{"issue":"5\u20138","key":"593_CR1","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1007\/s00170-014-6141-8","volume":"75","author":"M Adelzadeh","year":"2014","unstructured":"Adelzadeh M, Asl VM, Koosha M (2014) A mathematical model and a solving procedure for multi-depot vehicle routing problem with fuzzy time window and heterogeneous vehicle. Int J Adv Manuf Technol 75(5\u20138):793\u2013802","journal-title":"Int J Adv Manuf Technol"},{"key":"593_CR2","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1016\/j.cor.2009.11.009","volume":"37","author":"H Andersson","year":"2010","unstructured":"Andersson H, Hoff A, Christiansen M, Hasle G, L\u00f8kketangen A (2010) Industrial aspects and literature survey: Combined inventory management and routing. Comput Oper Res 37:1515\u20131536","journal-title":"Comput Oper Res"},{"key":"593_CR3","doi-asserted-by":"publisher","first-page":"2202","DOI":"10.1016\/j.cor.2010.03.010","volume":"37","author":"JF Bard","year":"2010","unstructured":"Bard JF, Nananukul N (2010) A branch-and-price algorithm for an integrated production and inventory routing problem. Comput Oper Res 37:2202\u20132217","journal-title":"Comput Oper Res"},{"key":"593_CR5","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.cie.2018.04.032","volume":"120","author":"J Brand\u00e3o","year":"2018","unstructured":"Brand\u00e3o J (2018) Iterated local search algorithm with ejection chains for the open vehicle routing problem with time windows. Comput Ind Eng 120:146\u2013159","journal-title":"Comput Ind Eng"},{"key":"593_CR6","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.asoc.2015.03.026","volume":"32","author":"J Brito","year":"2015","unstructured":"Brito J, Mart\u00ednez FJ, Moreno JA, Verdegay JL (2015) An ACO hybrid metaheuristic for close\u2013open vehicle routing problems with time windows and fuzzy constraints. Appl Soft Comput 32:154\u2013163","journal-title":"Appl Soft Comput"},{"key":"593_CR7","doi-asserted-by":"publisher","first-page":"7758","DOI":"10.1016\/j.eswa.2008.09.001","volume":"36","author":"CB Cheng","year":"2009","unstructured":"Cheng CB, Wang KP (2009) Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithm. Expert Syst Appl 36:7758\u20137763","journal-title":"Expert Syst Appl"},{"issue":"4","key":"593_CR8","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568\u2013581","journal-title":"Oper Res"},{"key":"593_CR9","doi-asserted-by":"publisher","first-page":"7156","DOI":"10.1080\/00207543.2012.757668","volume":"51","author":"LC Coelho","year":"2013","unstructured":"Coelho LC, Laporte G (2013) A branch-and-cut algorithm for the multi-product multi-vehicle inventory-routing problem. Int J Prod Res 51:7156\u20137169","journal-title":"Int J Prod Res"},{"key":"593_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.2013.0472","volume":"48","author":"LC Coelho","year":"2013","unstructured":"Coelho LC, Cordeau JF, Laporte G (2013) Thirty years of inventory routing. Transp Sci 48:1\u201319","journal-title":"Transp Sci"},{"key":"593_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.engappai.2017.02.012","volume":"61","author":"A De","year":"2017","unstructured":"De A, Kumar SK, Gunasekaran A, Tiwari MK (2017a) Sustainable maritime inventory routing problem with time window constraints. Eng Appl Artif Intell 61:77\u201395","journal-title":"Eng Appl Artif Intell"},{"issue":"1","key":"593_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TEM.2017.2766443","volume":"66","author":"A De","year":"2017","unstructured":"De A, Choudhary A, Tiwari MK (2017b) Multiobjective approach for sustainable ship routing and scheduling with draft restrictions. IEEE Trans Eng Manag 66(1):35\u201351","journal-title":"IEEE Trans Eng Manag"},{"issue":"783","key":"593_CR13","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1057\/s41274-017-0247-y","volume":"290","author":"A De","year":"2018","unstructured":"De A, Pratap S, Kumar A, Tiwari MK (2018) A hybrid dynamic berth allocation planning problem with fuel costs considerations for container terminal port using chemical reaction optimization approach. Ann Oper Res 290(783):811","journal-title":"Ann Oper Res"},{"key":"593_CR14","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1109\/TITS.2019.2900490","volume":"21","author":"A De","year":"2019","unstructured":"De A, Wang J, Tiwari MK (2019a) Hybridizing basic variable neighborhood search with particle swarm optimization for solving sustainable ship routing and bunker management problem. IEEE Trans Intell Transp Syst 21:986\u2013997","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"593_CR15","doi-asserted-by":"publisher","DOI":"10.1109\/TEM.2019.2923342","author":"A De","year":"2019","unstructured":"De A, Wang J, Tiwari MK (2019b) Fuel bunker management strategies within sustainable container shipping operation considering disruption and recovery policies. IEEE Trans Eng Manag. https:\/\/doi.org\/10.1109\/TEM.2019.2923342","journal-title":"IEEE Trans Eng Manag"},{"key":"593_CR19","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1016\/j.trc.2009.08.005","volume":"18","author":"MA Figliozzi","year":"2010","unstructured":"Figliozzi MA (2010) An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows. Transp Res Part C Emerg Technol 18:668\u2013679","journal-title":"Transp Res Part C Emerg Technol"},{"key":"593_CR20","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1016\/j.asoc.2013.08.015","volume":"14","author":"SF Ghannadpour","year":"2014","unstructured":"Ghannadpour SF, Noori S, Tavakkoli-Moghaddam R, Ghoseiri K (2014) A multi-objective dynamic vehicle routing problem with fuzzy time windows: model, solution and application. Appl Soft Comput 14:504\u2013527","journal-title":"Appl Soft Comput"},{"issue":"1","key":"593_CR21","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"22","author":"F Glover","year":"1974","unstructured":"Glover F, Woolsey L (1974) Converting the 0\u20131 polynomial programming problem to a 0\u20131 linear program. Oper Res 22(1):180\u2013182","journal-title":"Oper Res"},{"key":"593_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.05.041","author":"M Gmira","year":"2020","unstructured":"Gmira M, Gendreau M, Lodi A, Potvin JY (2020) Tabu search for the time-dependent vehicle routing problem with time windows on a road network. Eur J Oper Res. https:\/\/doi.org\/10.1016\/j.ejor.2020.05.041","journal-title":"Eur J Oper Res"},{"issue":"4","key":"593_CR23","doi-asserted-by":"publisher","first-page":"1962","DOI":"10.1111\/itor.12714","volume":"27","author":"A Haeri","year":"2020","unstructured":"Haeri A, Hosseini-Motlagh SM, Ghatreh Samani MR, Rezaei M (2020) A mixed resilient-efficient approach toward blood supply chain network design. Int Trans Oper Res 27(4):1962\u20132001","journal-title":"Int Trans Oper Res"},{"key":"593_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-019-00515-y","author":"S Hosseini-Motlagh","year":"2019","unstructured":"Hosseini-Motlagh S, Samani MRG, Abbasi Saadi F (2019) Strategic optimization of wheat supply chain network under uncertainty: a real case study. Oper Res Int J. https:\/\/doi.org\/10.1007\/s12351-019-00515-y","journal-title":"Oper Res Int J"},{"key":"593_CR25","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1016\/j.ijpe.2016.06.024","volume":"183","author":"G Iassinovskaia","year":"2017","unstructured":"Iassinovskaia G, Limbourg S, Riane F (2017) The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains. Int J Prod Econ 183:570\u2013582","journal-title":"Int J Prod Econ"},{"key":"593_CR26","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/s10951-011-0246-9","volume":"15","author":"AA Kovacs","year":"2012","unstructured":"Kovacs AA, Parragh SN, Doerner KF, Hartl RF (2012) Adaptive large neighborhood search for service technician routing and scheduling problems. J Sched 15:579\u2013600","journal-title":"J Sched"},{"key":"593_CR27","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1007\/s11590-012-0540-2","volume":"7","author":"T Le","year":"2013","unstructured":"Le T, Diabat A, Richard JP, Yih Y (2013) A column generation-based heuristic algorithm for an inventory routing problem with perishable goods. Optim Lett 7:1481\u20131502","journal-title":"Optim Lett"},{"key":"593_CR28","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1016\/j.cor.2003.10.002","volume":"32","author":"F Li","year":"2005","unstructured":"Li F, Golden B, Wasil E (2005) Very large-scale vehicle routing: new test problems, algorithms, and results. Comput Oper Res 32:1165\u20131179","journal-title":"Comput Oper Res"},{"key":"593_CR29","doi-asserted-by":"publisher","first-page":"13223","DOI":"10.1016\/j.eswa.2011.04.138","volume":"38","author":"SC Liu","year":"2011","unstructured":"Liu SC, Lee WT (2011) A heuristic method for the inventory routing problem with time windows. Expert Syst Appl 38:13223\u201313231","journal-title":"Expert Syst Appl"},{"key":"593_CR30","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-030-00473-6_38","volume-title":"New Trends Emerg Complex Real Life Probl","author":"G Macrina","year":"2018","unstructured":"Macrina G, Guerriero F (2018) The green vehicle routing problem with occasional drivers. New Trends Emerg Complex Real Life Probl. Springer, Cham, pp 357\u2013366"},{"key":"593_CR31","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.trb.2018.05.015","volume":"114","author":"I Markov","year":"2018","unstructured":"Markov I, Bierlaire M, Cordeau JF, Maknoon Y, Varone S (2018) A unified framework for rich routing problems with stochastic demands. Transp Res Part B Methodol 114:213\u2013240","journal-title":"Transp Res Part B Methodol"},{"key":"593_CR32","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1057\/palgrave.jors.2602264","volume":"58","author":"NH Moin","year":"2007","unstructured":"Moin NH, Salhi S (2007) Inventory routing problems: a logistical overview. J Oper Res Soc 58:1185\u20131194","journal-title":"J Oper Res Soc"},{"key":"593_CR33","doi-asserted-by":"publisher","first-page":"10462","DOI":"10.1016\/j.eswa.2011.02.093","volume":"38","author":"S Molla-Alizadeh-Zavardehi","year":"2011","unstructured":"Molla-Alizadeh-Zavardehi S, Hajiaghaei-Keshteli M, Tavakkoli-Moghaddam R (2011) Solving a capacitated fixed-charge transportation problem by artificial immune and genetic algorithms with a Pr\u00fcfer number representation. Expert Syst Appl 38:10462\u201310474","journal-title":"Expert Syst Appl"},{"key":"593_CR34","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1016\/j.mcm.2012.12.031","volume":"57","author":"S Molla-Alizadeh-Zavardehi","year":"2013","unstructured":"Molla-Alizadeh-Zavardehi S, Nezhad SS, Tavakkoli-Moghaddam R, Yazdani M (2013) Solving a fuzzy fixed charge solid transportation problem by metaheuristics. Math Comput Model 57:1543\u20131558","journal-title":"Math Comput Model"},{"key":"593_CR35","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tre.2015.04.010","volume":"80","author":"F Niakan","year":"2015","unstructured":"Niakan F, Rahimi M (2015) A multi-objective healthcare inventory routing problem; a fuzzy possibilistic approach. Transp Res Part E Logist Transp Rev 80:74\u201394","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"593_CR36","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10951-008-0072-x","volume":"12","author":"AS Pepin","year":"2009","unstructured":"Pepin AS, Desaulniers G, Hertz A, Huisman D (2009) A comparison of five heuristics for the multiple depot vehicle scheduling problem. J Sched 12:17","journal-title":"J Sched"},{"key":"593_CR37","volume-title":"Quality engineering using robust design","author":"MS Phadke","year":"1989","unstructured":"Phadke MS (1989) Quality engineering using robust design. PTR Prentice-Hall. Inc., Englewood Cliffs"},{"key":"593_CR38","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1016\/j.asoc.2017.06.036","volume":"59","author":"F Rayat","year":"2017","unstructured":"Rayat F, Musavi M, Bozorgi-Amiri A (2017) Bi-objective reliable location-inventory-routing problem with partial backordering under disruption risks: a modified AMOSA approach. Appl Soft Comput 59:622\u2013643","journal-title":"Appl Soft Comput"},{"key":"593_CR39","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/j.ejor.2017.10.029","volume":"266","author":"S Reil","year":"2018","unstructured":"Reil S, Bortfeldt A, M\u00f6nch L (2018) Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints. Eur J Oper Res 266:877\u2013894","journal-title":"Eur J Oper Res"},{"key":"593_CR40","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40:455\u2013472","journal-title":"Transp Sci"},{"key":"593_CR41","volume-title":"Taguchi techniques for quality engineering: loss function, orthogonal experiments, parameter and tolerance design (No. TS156 R12)","author":"PJ Ross","year":"1988","unstructured":"Ross PJ, Ross PJ (1988) Taguchi techniques for quality engineering: loss function, orthogonal experiments, parameter and tolerance design (No. TS156 R12). McGraw-Hill, New York"},{"key":"593_CR42","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and practice of constraint programming \u2014 CP98. CP 1998","author":"P Shaw","year":"1998","unstructured":"Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: Maher M, Puget JF (eds) Principles and practice of constraint programming \u2014 CP98. CP 1998. Lecture notes in computer science, vol 1520. Springer, Berlin. https:\/\/doi.org\/10.1007\/3-540-49481-2_30"},{"key":"593_CR43","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:254\u2013265","journal-title":"Oper Res"},{"key":"593_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.trb.2018.07.002","volume":"116","author":"P Sun","year":"2018","unstructured":"Sun P, Veelenturf LP, Hewitt M, Van Woensel T (2018) The time-dependent pickup and delivery problem with time windows. Transp Res Part B Methodol 116:1\u201324","journal-title":"Transp Res Part B Methodol"},{"key":"593_CR45","volume-title":"Introduction to quality engineering, Asian productivity organization","author":"G Taguchi","year":"1986","unstructured":"Taguchi G (1986) Introduction to quality engineering, Asian productivity organization. American Supplier Institute Inc., Dearborn"},{"key":"593_CR48","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1016\/j.fss.2008.09.016","volume":"160","author":"J Tang","year":"2009","unstructured":"Tang J, Pan Z, Fung RY, Lau H (2009) Vehicle routing problem with fuzzy time windows. Fuzzy Sets Syst 160:683\u2013695","journal-title":"Fuzzy Sets Syst"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00593-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-020-00593-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-020-00593-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T05:11:00Z","timestamp":1647407460000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-020-00593-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,9]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["593"],"URL":"https:\/\/doi.org\/10.1007\/s12351-020-00593-3","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,9]]},"assertion":[{"value":"5 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}