{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T02:07:29Z","timestamp":1768442849169,"version":"3.49.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,11,9]],"date-time":"2024-11-09T00:00:00Z","timestamp":1731110400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,9]],"date-time":"2024-11-09T00:00:00Z","timestamp":1731110400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-024-00391-z","type":"journal-article","created":{"date-parts":[[2024,11,9]],"date-time":"2024-11-09T06:22:37Z","timestamp":1731133357000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Utilizing Multi-vehicle Traveling Purchaser Problem for Multiple-Supplier Selection and Multi-period Lot-Sizing in a Fuzzy Demand Environment"],"prefix":"10.1007","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6081-408X","authenticated-orcid":false,"given":"Mohammad","family":"Khosroabadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9382-007X","authenticated-orcid":false,"given":"Jafar","family":"Gheidar-Kheljani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Hosein Karimi","family":"Gavareshki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,9]]},"reference":[{"issue":"2","key":"391_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.ejor.2012.04.028","volume":"222","author":"D Manerba","year":"2012","unstructured":"Manerba D, Mansini R (2012) An exact algorithm for the capacitated total quantity discount problem. Eur J Oper Res 222(2):287\u2013300. https:\/\/doi.org\/10.1016\/j.ejor.2012.04.028","journal-title":"Eur J Oper Res"},{"key":"391_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2013.07.019","volume":"41","author":"D Manerba","year":"2014","unstructured":"Manerba D, Mansini R (2014) An effective matheuristic for the capacitated total quantity discount problem. Comput Oper Res 41:1\u201311. https:\/\/doi.org\/10.1016\/j.cor.2013.07.019","journal-title":"Comput Oper Res"},{"key":"391_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.ijpe.2018.01.035","volume":"198","author":"D Manerba","year":"2018","unstructured":"Manerba D, Mansini R, Perboli G (2018) The capacitated supplier selection problem with total quantity discount policy and activation costs under uncertainty. Int J Prod Econ 198:119\u2013132. https:\/\/doi.org\/10.1016\/j.ijpe.2018.01.035","journal-title":"Int J Prod Econ"},{"key":"391_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.cor.2018.08.010","volume":"101","author":"D Manerba","year":"2019","unstructured":"Manerba D, Perboli G (2019) New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty. Comput Oper Res 101:29\u201342. https:\/\/doi.org\/10.1016\/j.cor.2018.08.010","journal-title":"Comput Oper Res"},{"issue":"2","key":"391_CR5","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.ejor.2019.05.039","volume":"279","author":"T Kirschstein","year":"2019","unstructured":"Kirschstein T, Meisel F (2019) A multi-period multi-commodity lot-sizing problem with supplier selection, storage selection and discounts for the process industry. Eur J Oper Res 279(2):393\u2013406. https:\/\/doi.org\/10.1016\/j.ejor.2019.05.039","journal-title":"Eur J Oper Res"},{"issue":"S1","key":"391_CR6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s40092-019-00334-y","volume":"15","author":"S Aouadni","year":"2019","unstructured":"Aouadni S, Aouadni I, Reba\u00ef A (2019) A systematic review on supplier selection and order allocation problems. J Ind Eng Int 15(S1):267\u2013289. https:\/\/doi.org\/10.1007\/s40092-019-00334-y","journal-title":"J Ind Eng Int"},{"issue":"1\u20132","key":"391_CR7","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10479-015-2004-4","volume":"238","author":"K Govindan","year":"2015","unstructured":"Govindan K, Sivakumar R (2015) Green supplier selection and order allocation in a low-carbon paper industry: integrated multi-criteria heterogeneous decision-making and multi-objective linear programming approaches. Ann Oper Res 238(1\u20132):243\u2013276. https:\/\/doi.org\/10.1007\/s10479-015-2004-4","journal-title":"Ann Oper Res"},{"key":"391_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.cie.2017.12.019","volume":"116","author":"HK Alfares","year":"2018","unstructured":"Alfares HK, Turnadi R (2018) Lot sizing and supplier selection with multiple items, multiple periods, quantity discounts, and backordering. Comput Ind Eng 116:59\u201371. https:\/\/doi.org\/10.1016\/j.cie.2017.12.019","journal-title":"Comput Ind Eng"},{"issue":"2","key":"391_CR9","doi-asserted-by":"publisher","first-page":"302","DOI":"10.3390\/sym12020302","volume":"12","author":"SY You","year":"2020","unstructured":"You SY, Zhang LJ, Xu XG, Liu HC (2020) A new integrated multi-criteria decision making and multi-objective programming model for sustainable supplier selection and order allocation. Symmetry 12(2):302. https:\/\/doi.org\/10.3390\/sym12020302","journal-title":"Symmetry"},{"issue":"10","key":"391_CR10","doi-asserted-by":"publisher","first-page":"1659","DOI":"10.3390\/math8101659","volume":"8","author":"SH Baek","year":"2020","unstructured":"Baek SH, Kim JS (2020) Efficient algorithms for a large-scale supplier selection and order allocation problem considering carbon emissions and quantity discounts. Mathematics 8(10):1659. https:\/\/doi.org\/10.3390\/math8101659","journal-title":"Mathematics"},{"issue":"2","key":"391_CR11","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/j.ejor.2019.03.001","volume":"277","author":"M Wei","year":"2019","unstructured":"Wei M, Qi M, Wu T, Zhang C (2019) Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials. Eur J Oper Res 277(2):521\u2013541. https:\/\/doi.org\/10.1016\/j.ejor.2019.03.001","journal-title":"Eur J Oper Res"},{"issue":"9","key":"391_CR12","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.3390\/math8091457","volume":"8","author":"A Alejo-Reyes","year":"2020","unstructured":"Alejo-Reyes A, Cuevas E, Rodr\u00edguez A, Mendoza A, Olivares-Benitez E (2020) An improved grey wolf optimizer for a supplier selection and order quantity allocation problem. Mathematics 8(9):1457. https:\/\/doi.org\/10.3390\/math8091457","journal-title":"Mathematics"},{"key":"391_CR13","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/j.cie.2017.03.028","volume":"110","author":"S Hamdan","year":"2017","unstructured":"Hamdan S, Cheaitou A (2017) Dynamic green supplier selection and order allocation with quantity discounts and varying supplier availability. Comput Ind Eng 110:573\u2013589. https:\/\/doi.org\/10.1016\/j.cie.2017.03.028","journal-title":"Comput Ind Eng"},{"key":"391_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2016.11.014","volume":"80","author":"W Jiao","year":"2017","unstructured":"Jiao W, Zhang JL, Yan H (2017) The stochastic lot-sizing problem with quantity discounts. Comput Oper Res 80:1\u201310. https:\/\/doi.org\/10.1016\/j.cor.2016.11.014","journal-title":"Comput Oper Res"},{"key":"391_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.spc.2020.05.006","volume":"23","author":"G Bektur","year":"2020","unstructured":"Bektur G (2020) An integrated methodology for the selection of sustainable suppliers and order allocation problem with quantity discounts, lost sales and varying supplier availabilities. Sustain Prod Consum 23:111\u2013127. https:\/\/doi.org\/10.1016\/j.spc.2020.05.006","journal-title":"Sustain Prod Consum"},{"issue":"1","key":"391_CR16","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1080\/17509653.2016.1269246","volume":"13","author":"PN Shalke","year":"2017","unstructured":"Shalke PN, Paydar MM, Hajiaghaei-Keshteli M (2017) Sustainable supplier selection and order allocation through quantity discounts. Int J Manag Sci Eng Manag 13(1):20\u201332. https:\/\/doi.org\/10.1080\/17509653.2016.1269246","journal-title":"Int J Manag Sci Eng Manag"},{"key":"391_CR17","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.tre.2018.09.003","volume":"119","author":"X Li","year":"2018","unstructured":"Li X, Ventura JA, Venegas BB, Kweon SJ, Hwang SW (2018) An integrated acquisition policy for supplier selection and lot sizing considering total quantity discounts and a quality constraint. Transportation Research. Part E Logist Transp Rev 119:19\u201340. https:\/\/doi.org\/10.1016\/j.tre.2018.09.003","journal-title":"Part E Logist Transp Rev"},{"key":"391_CR18","doi-asserted-by":"publisher","unstructured":"Sontake A, Jain N, Singh AR (2020) Sustainable supplier selection and order allocation considering discount schemes and disruptions in supply chain. In: Lecture notes on multidisciplinary industrial engineering (pp 61\u201394). https:\/\/doi.org\/10.1007\/978-981-15-6017-0_5","DOI":"10.1007\/978-981-15-6017-0_5"},{"issue":"3","key":"391_CR19","doi-asserted-by":"publisher","first-page":"e0283585","DOI":"10.1371\/journal.pone.0283585","volume":"18","author":"Q Wang","year":"2023","unstructured":"Wang Q (2023) Flexible supplier selection and order allocation in the big data era with various quantity discounts. PLoS One 18(3):e0283585. https:\/\/doi.org\/10.1371\/journal.pone.0283585","journal-title":"PLoS One"},{"issue":"2","key":"391_CR20","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/net.21588","volume":"65","author":"D Manerba","year":"2014","unstructured":"Manerba D, Mansini R (2014) A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints. Networks 65(2):139\u2013154. https:\/\/doi.org\/10.1002\/net.21588","journal-title":"Networks"},{"issue":"1","key":"391_CR21","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ejor.2015.06.073","volume":"248","author":"M Gendreau","year":"2016","unstructured":"Gendreau M, Manerba D, Mansini R (2016) The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach. Eur J Oper Res 248(1):59\u201371. https:\/\/doi.org\/10.1016\/j.ejor.2015.06.073","journal-title":"Eur J Oper Res"},{"issue":"2","key":"391_CR22","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1016\/j.cor.2006.03.023","volume":"35","author":"B Bontoux","year":"2008","unstructured":"Bontoux B, Feillet D (2008) Ant colony optimization for the traveling purchaser problem. Comput Oper Res 35(2):628\u2013637. https:\/\/doi.org\/10.1016\/j.cor.2006.03.023","journal-title":"Comput Oper Res"},{"issue":"7","key":"391_CR23","doi-asserted-by":"publisher","first-page":"2263","DOI":"10.1016\/j.cor.2008.09.001","volume":"36","author":"R Mansini","year":"2009","unstructured":"Mansini R, Tocchella B (2009) The traveling purchaser problem with budget constraint. Comput Oper Res 36(7):2263\u20132274. https:\/\/doi.org\/10.1016\/j.cor.2008.09.001","journal-title":"Comput Oper Res"},{"issue":"1","key":"391_CR24","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.ejor.2013.10.018","volume":"235","author":"N Bianchessi","year":"2014","unstructured":"Bianchessi N, Mansini R, Speranza M (2014) The distance constrained multiple vehicle traveling purchaser problem. Eur J Oper Res 235(1):73\u201387. https:\/\/doi.org\/10.1016\/j.ejor.2013.10.018","journal-title":"Eur J Oper Res"},{"key":"391_CR25","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.cor.2017.01.001","volume":"82","author":"E Angelelli","year":"2017","unstructured":"Angelelli E, Gendreau M, Mansini R, Vindigni M (2017) The traveling purchaser problem with time-dependent quantities. Comput Oper Res 82:15\u201326. https:\/\/doi.org\/10.1016\/j.cor.2017.01.001","journal-title":"Comput Oper Res"},{"issue":"1","key":"391_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.12.017","volume":"259","author":"D Manerba","year":"2017","unstructured":"Manerba D, Mansini R, Riera-Ledesma J (2017) The traveling purchaser problem and its variants. Eur J Oper Res 259(1):1\u201318. https:\/\/doi.org\/10.1016\/j.ejor.2016.12.017","journal-title":"Eur J Oper Res"},{"issue":"2","key":"391_CR27","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1111\/itor.12985","volume":"30","author":"D Cuellar-Usaqu\u00e9n","year":"2021","unstructured":"Cuellar-Usaqu\u00e9n D, Gomez C, \u00c1lvarez-Mart\u00ednez D (2021) A GRASP\/path-relinking algorithm for the traveling purchaser problem. Int Trans Oper Res 30(2):831\u2013857. https:\/\/doi.org\/10.1111\/itor.12985","journal-title":"Int Trans Oper Res"},{"key":"391_CR28","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.dam.2020.08.014","volume":"288","author":"N Bianchessi","year":"2021","unstructured":"Bianchessi N, Irnich S, Tilk C (2021) A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand. Discret Appl Math 288:152\u2013170. https:\/\/doi.org\/10.1016\/j.dam.2020.08.014","journal-title":"Discret Appl Math"},{"issue":"16","key":"391_CR29","doi-asserted-by":"publisher","first-page":"10190","DOI":"10.3390\/su141610190","volume":"14","author":"ZSH Jesri","year":"2022","unstructured":"Jesri ZSH, Eshghi K, Rafiee M, Van Woensel T (2022) The multi-depot traveling purchaser problem with shared resources. Sustainability 14(16):10190. https:\/\/doi.org\/10.3390\/su141610190","journal-title":"Sustainability"},{"key":"391_CR30","doi-asserted-by":"publisher","first-page":"105700","DOI":"10.1016\/j.cor.2022.105700","volume":"141","author":"I Kucukoglu","year":"2022","unstructured":"Kucukoglu I (2022) The traveling purchaser problem with fast service option. Comput Oper Res 141:105700. https:\/\/doi.org\/10.1016\/j.cor.2022.105700","journal-title":"Comput Oper Res"},{"issue":"3","key":"391_CR31","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1016\/j.ejor.2022.06.045","volume":"317","author":"WN Caballero","year":"2024","unstructured":"Caballero WN, Lunday BJ, Meissner F (2024) Regulating the rebound effect in the traveling purchaser problem. Eur J Oper Res 317(3):660\u2013677. https:\/\/doi.org\/10.1016\/j.ejor.2022.06.045","journal-title":"Eur J Oper Res"},{"issue":"8","key":"391_CR32","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1080\/15568318.2020.1774825","volume":"15","author":"A Cheaitou","year":"2020","unstructured":"Cheaitou A, Hamdan S, Larbi R, Alsyouf I (2020) Sustainable traveling purchaser problem with speed optimization. Int J Sustain Transp 15(8):621\u2013640. https:\/\/doi.org\/10.1080\/15568318.2020.1774825","journal-title":"Int J Sustain Transp"},{"issue":"4","key":"391_CR33","doi-asserted-by":"publisher","first-page":"2269","DOI":"10.1007\/s10878-020-00608-x","volume":"44","author":"M Xiao","year":"2020","unstructured":"Xiao M, Zhang J, Lin W (2020) Parameterized algorithms and complexity for the traveling purchaser problem and its variants. J Comb Optim 44(4):2269\u20132285. https:\/\/doi.org\/10.1007\/s10878-020-00608-x","journal-title":"J Comb Optim"},{"key":"391_CR34","doi-asserted-by":"publisher","unstructured":"Kang HY, Lee AH, Yeh YF (2020) An optimization approach for traveling purchaser problem with environmental impact of transportation cost. Kybernetes, ahead-of-print(ahead-of-print). https:\/\/doi.org\/10.1108\/k-04-2020-0237","DOI":"10.1108\/k-04-2020-0237"},{"key":"391_CR35","doi-asserted-by":"publisher","unstructured":"Cort\u00e9s-Antonio P, T\u00e9llez-Vel\u00e1zquez A, Cruz-Barbosa R, Castillo O (2023) Relaxed differential evolution algorithm. In: Studies in computational intelligence (pp 263\u2013273). https:\/\/doi.org\/10.1007\/978-3-031-28999-6_17","DOI":"10.1007\/978-3-031-28999-6_17"},{"issue":"7","key":"391_CR36","doi-asserted-by":"publisher","first-page":"5277","DOI":"10.1007\/s00500-020-05527-x","volume":"25","author":"W Deng","year":"2021","unstructured":"Deng W, Shang S, Cai X, Zhao H, Song Y, Xu J (2021) An improved differential evolution algorithm and its application in optimization problem. Soft Comput 25(7):5277\u20135298. https:\/\/doi.org\/10.1007\/s00500-020-05527-x","journal-title":"Soft Comput"},{"key":"391_CR37","unstructured":"Karabo\u011fa D, \u00d6kdem S (2004) A simple and global optimization algorithm for engineering problems: differential evolution algorithm. Turk J Electr Eng Comput Sci 12(1). Article 5. https:\/\/journals.tubitak.gov.tr\/elektrik\/vol12\/iss1\/5\/"},{"key":"391_CR38","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution\u2013a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11:341\u2013359. https:\/\/doi.org\/10.1023\/A:1008202821328","journal-title":"J Global Optim"}],"updated-by":[{"DOI":"10.1007\/s43069-024-00397-7","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T00:00:00Z","timestamp":1732665600000}}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00391-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-024-00391-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00391-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T16:04:16Z","timestamp":1734710656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-024-00391-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,9]]},"references-count":38,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["391"],"URL":"https:\/\/doi.org\/10.1007\/s43069-024-00391-z","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s43069-024-00397-7","asserted-by":"object"}]},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,9]]},"assertion":[{"value":"25 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2024","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Springer Nature\u2019s version of this paper was updated to remove the production query inserted in Section 4 Experimental Results and Sensitivity Analysis and change '>' symbol to '<' in Table 2.","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2024","order":7,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":8,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":9,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s43069-024-00397-7","URL":"https:\/\/doi.org\/10.1007\/s43069-024-00397-7","order":10,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"105"}}