{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,27]],"date-time":"2026-08-27T02:18:31Z","timestamp":1787797111261,"version":"build-2784847793"},"reference-count":47,"publisher":"EDP Sciences","issue":"4","license":[{"start":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T00:00:00Z","timestamp":1719878400000},"content-version":"vor","delay-in-days":1,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Council for Scientific and Industrial Research, India","award":["NJ\/09\/0135\/2023\/16183"],"award-info":[{"award-number":["NJ\/09\/0135\/2023\/16183"]}]},{"name":"Science and Engineering Research Board, Government of India","award":["MTR\/2019\/000723"],"award-info":[{"award-number":["MTR\/2019\/000723"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2024,4,8]]},"published-print":{"date-parts":[[2024,7]]},"abstract":"<jats:p>This paper discusses a two-stage capacitated time minimization transportation problem with the restricted flow (TSCTMTP-F) in which the transportation takes place in two stages and only a specified amount of commodity is transported in both stages. The total amount <jats:italic>F<\/jats:italic><jats:sub>1<\/jats:sub> is transported during Stage-I and <jats:italic>F<\/jats:italic><jats:sub>2<\/jats:sub> during Stage-II, and the objective is to minimize the sum of the transportation times for Stage-I and Stage-II. In 2017, Kaur <jats:italic>et al<\/jats:italic>. [<jats:italic>RAIRO-Oper. Res<\/jats:italic>. 51 (2017) 1169\u20131184] studied this problem and developed a polynomially bounded iterative algorithm (Algorithm-A) to solve TSCTMTP-F. However, their proposed algorithm has some flaws and may not always yield an optimal solution to the problem TSCTMTP-F. An improved iterative algorithm (Algorithm-C) is proposed in this paper that guarantees an optimal solution to the problem. Various theoretical results prove the convergence and efficiency of Algorithm-C to obtain an optimal solution to the problem TSCTMTP-F. Numerical problems are included in the support of theory along with a counter-example for which Algorithm-A fails to obtain its optimal solution. Computational experiments on a variety of test problems have been carried out to validate the convergence and efficiency of Algorithm-C.<\/jats:p>","DOI":"10.1051\/ro\/2024086","type":"journal-article","created":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T08:29:31Z","timestamp":1712737771000},"page":"2733-2766","source":"Crossref","is-referenced-by-count":5,"title":["An efficient algorithm for two-stage capacitated time minimization transportation problem with restricted flow"],"prefix":"10.1051","volume":"58","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-4265-1274","authenticated-orcid":false,"given":"Supinder","family":"Kaur","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6099-6848","authenticated-orcid":false,"given":"Ekta","family":"Jain","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anuj","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4571-7254","authenticated-orcid":false,"given":"Kalpana","family":"Dahiya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"250","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1002\/nav.3800330415","volume":"33","author":"Ahuja","year":"1986","journal-title":"Nav. Res. Logist. Q."},{"key":"R2","first-page":"241","volume":"166","author":"Ammar","year":"2005","journal-title":"Appl. Math. Comput."},{"key":"R3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01919246","volume":"24","author":"Bansal","year":"1977","journal-title":"Math. Oper. Res."},{"key":"R4","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1504\/IJMOR.2021.114205","volume":"18","author":"Barman","year":"2021","journal-title":"Int. J. Math. Oper. Res."},{"key":"R5","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1016\/j.apm.2011.07.011","volume":"36","author":"Behnamian","year":"2012","journal-title":"Appl. Math. Model."},{"key":"R6","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1016\/j.asoc.2019.04.011","volume":"80","author":"Biswas","year":"2019","journal-title":"Appl. Soft. Comput."},{"key":"R7","doi-asserted-by":"crossref","first-page":"976","DOI":"10.1016\/j.jclepro.2018.09.228","volume":"206","author":"Bula","year":"2019","journal-title":"J. Clean. Prod."},{"key":"R8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.cor.2018.03.007","volume":"95","author":"Calvete","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"R9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1029-242X-2014-338","volume":"2014","author":"Chakraborty","year":"2014","journal-title":"J. Inequal. Appl."},{"key":"R10","doi-asserted-by":"crossref","first-page":"24","DOI":"10.3844\/jmssp.2007.24.27","volume":"3","author":"Charnsethikul","year":"2007","journal-title":"J. Math. Stat."},{"key":"R11","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s10288-015-0297-4","volume":"13","author":"Chikhi","year":"2015","journal-title":"4OR"},{"key":"R12","doi-asserted-by":"crossref","first-page":"153","DOI":"10.37193\/CJM.2019.02.04","volume":"35","author":"Cosma","year":"2019","journal-title":"Carpathian J. Math."},{"key":"R13","first-page":"681","volume":"31","author":"Cosma","year":"2020","journal-title":"Informatica"},{"key":"R14","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1016\/j.ejor.2006.02.017","volume":"178","author":"Dahiya","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"R15","doi-asserted-by":"crossref","unstructured":"Dantzig G.B., Linear Programming and Extensions. RAND Corporation, Santa Monica, CA (1963).","DOI":"10.7249\/R366"},{"key":"R16","first-page":"213","volume":"19","author":"Dogaru","year":"2009","journal-title":"Sci. Study Res."},{"key":"R17","first-page":"333","volume":"11","author":"Grabowski","year":"1964","journal-title":"Prz. Stat."},{"key":"R18","first-page":"27","volume":"41","author":"Gupta","year":"2020","journal-title":"Invest. Oper."},{"key":"R19","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s12597-013-0125-6","volume":"50","author":"Gupta","year":"2013","journal-title":"Opsearch"},{"key":"R20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.camwa.2018.03.047","volume":"76","author":"Gupta","year":"2018","journal-title":"Int. J. Appl. Comput. Math."},{"key":"R21","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/nav.3800160307","volume":"16","author":"Hammer","year":"1969","journal-title":"Nav. Res. Logist. Q."},{"key":"R22","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.1007\/s11750-014-0321-4","volume":"22","author":"Hinojosa","year":"2014","journal-title":"TOP"},{"key":"R23","doi-asserted-by":"crossref","first-page":"115","DOI":"10.2298\/YJOR100818004J","volume":"22","author":"Jain","year":"2012","journal-title":"Yugosl. J. Oper."},{"key":"R24","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1080\/0305215X.2020.1739279","volume":"53","author":"Jain","year":"2021","journal-title":"Eng. Optim."},{"key":"R25","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1080\/02331934.2014.898148","volume":"63","author":"Kannan","year":"2014","journal-title":"Optimization"},{"key":"R26","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10288-020-00467-6","volume":"20","author":"Kaur","year":"2012","journal-title":"4OR"},{"key":"R27","doi-asserted-by":"crossref","first-page":"1169","DOI":"10.1051\/ro\/2016033","volume":"51","author":"Kaur","year":"2017","journal-title":"RAIRO-Oper. Res."},{"key":"R28","first-page":"65","volume":"25","author":"Khanna","year":"1983","journal-title":"Cahiers du CERO"},{"key":"R29","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1080\/09720502.2006.10700450","volume":"9","author":"Khurana","year":"2006","journal-title":"J. Interdiscip. Math."},{"key":"R30","first-page":"367","volume":"1","author":"Khurana","year":"2009","journal-title":"Int. J. Optim.: Theory Methods App."},{"key":"R31","first-page":"109","volume":"78","author":"Orlin","year":"1997","journal-title":"Math. Program."},{"key":"R32","doi-asserted-by":"crossref","unstructured":"Pandian P. and Natarajan G., Solving two stage transportation problems, in International Conference on Logic, Information, Control and Computation, edited by Balasubramaniam P.. Vol. 140. Springer Berlin Heidelberg, Berlin, Heidelberg (2011) 159\u2013165.","DOI":"10.1007\/978-3-642-19263-0_20"},{"key":"R33","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.ejor.2018.09.042","volume":"274","author":"Paul","year":"2019","journal-title":"Eur. J. Oper. Res."},{"key":"R34","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF03399218","volume":"35","author":"Sarma","year":"1998","journal-title":"Opsearch"},{"key":"R35","doi-asserted-by":"crossref","unstructured":"Sengupta D. and Bera U.K., Reduction of type-2 lognormal uncertain variable and its application to a two-stage solid transportation problem, in Operations Research and Optimization: FOTA 2016. Springer Proceedings in Mathematics & Statistics, edited by Kar S., Maulik U. and Li X.. Vol. 225. Springer Singapore (2018) 333\u2013345.","DOI":"10.1007\/978-981-10-7814-9_23"},{"key":"R36","first-page":"12","volume":"27","author":"Sharma","year":"2008","journal-title":"ASOR Bull."},{"key":"R37","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1142\/S021759591000279X","volume":"27","author":"Sharma","year":"2010","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"R38","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1016\/j.ejor.2015.03.034","volume":"246","author":"Sharma","year":"2015","journal-title":"Euro. J. Oper. Res."},{"key":"R39","first-page":"421","volume":"36","author":"Singh","year":"2015","journal-title":"J. Inf. Optim. Sci."},{"key":"R40","first-page":"181","volume":"17","author":"Singh","year":"2000","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"R41","doi-asserted-by":"crossref","first-page":"3","DOI":"10.2298\/YJOR150417007S","volume":"27","author":"Sungeeta","year":"2017","journal-title":"Yugosl. J. Oper. Res."},{"key":"R42","doi-asserted-by":"crossref","first-page":"2467","DOI":"10.1016\/j.apm.2007.09.028","volume":"32","author":"Tang","year":"2008","journal-title":"Appl. Math. Model."},{"key":"R43","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1080\/02331939708844308","volume":"40","author":"Thirwani","year":"1997","journal-title":"Optimization"},{"key":"R44","doi-asserted-by":"crossref","first-page":"93","DOI":"10.3233\/IFS-2012-0498","volume":"23","author":"Vinotha","year":"2012","journal-title":"J. Intell. Fuzzy Syst."},{"key":"R45","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1007\/s10288-021-00492-z","volume":"20","author":"Xie","year":"2022","journal-title":"4OR"},{"key":"R46","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.cor.2017.05.003","volume":"86","author":"Xie","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"R47","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1016\/j.ipl.2012.06.013","volume":"112","author":"Zhu","year":"2012","journal-title":"Inf. Process. Lett."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024086\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T08:19:08Z","timestamp":1719908348000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":47,"journal-issue":{"issue":"4"},"alternative-id":["ro230402"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2024086","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"2804-7303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7]]}}}