{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:06:58Z","timestamp":1777453618972,"version":"3.51.4"},"reference-count":62,"publisher":"EDP Sciences","license":[{"start":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T00:00:00Z","timestamp":1614643200000},"content-version":"vor","delay-in-days":60,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2020,3,26]]},"published-print":{"date-parts":[[2021]]},"abstract":"<jats:p>Based on the acceptability index for comparison of any two imprecise values, efficient algorithms have been proposed in the literature for solving shortest path (SP) problem when the weights of connected arcs in a transportation network are represented as interval numbers. In this study, a generalized Dijkstra algorithm is proposed to handle the SP problem with interval weights. Here it is shown that once the acceptability index is chosen, the interval SP problem is converted into crisp one, which is easily solved by the standard SP algorithms. The main contribution here is the reduction of the computational complexity of the existing algorithm for solving interval SP problem. To show the advantages of the proposed algorithm over existing algorithm the numerical example presented in literature is solved using the proposed algorithm and the obtained results are discussed. Moreover, an small sized telecommunication network is provided to illustrate the potential application of the proposed method. Finally, the practical relevance of the proposed algorithm is evaluated by means of a large scale pilot case where a pharmaceutical shipment between the cities in Iran should be transported.<\/jats:p>","DOI":"10.1051\/ro\/2020033","type":"journal-article","created":{"date-parts":[[2020,3,28]],"date-time":"2020-03-28T19:55:47Z","timestamp":1585425347000},"page":"S1767-S1787","source":"Crossref","is-referenced-by-count":19,"special_numbering":"Supplement","title":["An acceptability index based approach for solving shortest path problem on a network with interval weights"],"prefix":"10.1051","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6003-6601","authenticated-orcid":false,"given":"Ali","family":"Ebrahimnejad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2021,3,2]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1111\/coin.12258","volume":"36","author":"Abbaszadeh Sori","year":"2019","journal-title":"Comput. Intell"},{"issue":"4","key":"R2","first-page":"1","volume":"38","author":"Abbaszadeh Sori","year":"2019","journal-title":"J. Intell. Fuzzy Syst"},{"key":"R3","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.procs.2018.10.295","volume":"140","author":"Ahmadi","year":"2018","journal-title":"Proc. Comput. Sci"},{"key":"R4","unstructured":"Ahuja R.K., Magnanti T.L. and Orlin J.B., Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs, NJ (1993)."},{"key":"R5","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1002\/(SICI)1097-0037(199708)30:1<9::AID-NET2>3.0.CO;2-H","volume":"30","author":"Alexopoulos","year":"1997","journal-title":"Networks"},{"key":"R6","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1287\/trsc.36.2.218.562","volume":"36","author":"Bander","year":"2002","journal-title":"Trans. Sci"},{"key":"R7","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1142\/S0218488506004217","volume":"14","author":"Beigy","year":"2006","journal-title":"Int. J. Uncertainty Fuzziness Knowledge Based Syst"},{"key":"R8","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s00224-017-9838-x","volume":"62","author":"Bosek","year":"2018","journal-title":"Theory Comput. Syst"},{"key":"R9","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s40747-019-0101-8","volume":"5","author":"Broumi","year":"2019","journal-title":"Complex Intell. Syst"},{"key":"R10","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1002\/(SICI)1520-6750(199812)45:8<769::AID-NAV2>3.0.CO;2-#","volume":"45","author":"Cheung","year":"1998","journal-title":"Nav. Res. Logist"},{"key":"R11","doi-asserted-by":"crossref","first-page":"1409","DOI":"10.1016\/j.cor.2003.11.011","volume":"32","author":"Chuang","year":"2005","journal-title":"Comput. Oper. Res"},{"key":"R12","first-page":"660","volume":"174","author":"Chuang","year":"2006","journal-title":"Appl. Math. Comput"},{"key":"R13","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1002\/nav.3800250415","volume":"25","author":"Croucher","year":"1978","journal-title":"Nav. Res. Logist"},{"key":"R14","doi-asserted-by":"crossref","first-page":"1231","DOI":"10.1016\/j.asoc.2011.11.011","volume":"12","author":"Deng","year":"2012","journal-title":"Appl. Soft Comput"},{"key":"R15","doi-asserted-by":"crossref","first-page":"255","DOI":"10.22452\/mjcs.vol31no4.2","volume":"31","author":"Dey","year":"2018","journal-title":"Malaysian J. Comput. Sci"},{"key":"R16","doi-asserted-by":"crossref","first-page":"1621","DOI":"10.1016\/j.asoc.2012.03.013","volume":"12","author":"Dou","year":"2012","journal-title":"Appl. Soft Comput"},{"key":"R17","unstructured":"Dubois D. and Prade H., Fuzzy Sets and Systems: Theory and Applications. Academic Press, New York, NY (1980)."},{"key":"R18","first-page":"203","volume":"8","author":"Ebrahimnejad","year":"2015","journal-title":"Int. J. Appl. Decis. Sci"},{"key":"R19","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.measurement.2016.06.050","volume":"93","author":"Ebrahimnejad","year":"2016","journal-title":"Measurement"},{"key":"R20","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s40747-018-0083-y","volume":"5","author":"Enayattabar","year":"2019","journal-title":"Complex Intell. Syst"},{"key":"R21","doi-asserted-by":"crossref","first-page":"6865","DOI":"10.3233\/JIFS-190711","volume":"37","author":"Enayattabar","year":"2019","journal-title":"J. Intell. Fuzzy Syst"},{"key":"R22","doi-asserted-by":"crossref","first-page":"1527","DOI":"10.1007\/s11063-018-9945-y","volume":"50","author":"Eshaghnezhad","year":"2019","journal-title":"Neural Proc. Lett"},{"key":"R23","first-page":"2591","volume":"62","author":"Gao","year":"2011","journal-title":"Comput. Math. App"},{"key":"R24","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1142\/S0218488511006897","volume":"19","author":"Ghiyasvand","year":"2011","journal-title":"Int. J. Uncertainty Fuzziness Knowledge Based Syst"},{"key":"R25","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1007\/s12046-012-0100-6","volume":"37","author":"Ghiyasvand","year":"2012","journal-title":"Sadhana"},{"issue":"1","key":"R26","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.ejor.2018.10.052","volume":"285","author":"Guillot","year":"2018","journal-title":"Eur. J. Oper. Res"},{"key":"R27","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/j.phycom.2017.06.010","volume":"25","author":"Guo","year":"2017","journal-title":"Phys. Commun"},{"key":"R28","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s00224-005-1260-0","volume":"39","author":"Hagerup","year":"2006","journal-title":"Theory Comput. Syst"},{"key":"R29","first-page":"1200","volume":"175","author":"Hashemi","year":"2006","journal-title":"Appl. Math. Comput"},{"key":"R30","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.mcm.2011.03.040","volume":"57","author":"Hassanzadeh","year":"2013","journal-title":"Math. Comput. Model"},{"key":"R31","doi-asserted-by":"crossref","first-page":"1561","DOI":"10.1016\/j.fss.2007.02.022","volume":"158","author":"Hernandes","year":"2007","journal-title":"Fuzzy Sets Syst"},{"key":"R32","unstructured":"Horoba C., Ant colony optimization for stochastic shortest path problems. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation. Association for Computing Machinery, New York, NY (2010) 1465\u20131472."},{"key":"R33","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1016\/j.cor.2007.10.016","volume":"36","author":"Hutson","year":"2009","journal-title":"Comput. Oper. Res"},{"key":"R34","first-page":"503","volume":"170","author":"Ji","year":"2005","journal-title":"Appl. Math. Comput"},{"key":"R35","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.apm.2005.09.001","volume":"31","author":"Ji","year":"2007","journal-title":"Appl. Math. Model"},{"key":"R36","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1287\/opre.33.3.696","volume":"33","author":"Kamburowski","year":"1985","journal-title":"Oper. Res"},{"key":"R37","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0165-0114(91)90063-V","volume":"39","author":"Klein","year":"1991","journal-title":"Fuzzy Sets Syst"},{"key":"R38","first-page":"602","volume":"6","author":"Kumar","year":"2011","journal-title":"App. Appl. Math. Int. J"},{"key":"R39","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1016\/S0360-8352(96)00278-1","volume":"31","author":"Li","year":"1996","journal-title":"Comput. Ind. Eng"},{"key":"R40","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0165-0114(93)90508-F","volume":"58","author":"Lin","year":"1993","journal-title":"Fuzzy Sets Syst"},{"key":"R41","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.asoc.2008.07.002","volume":"9","author":"Mahdavi","year":"2009","journal-title":"Appl. Soft Comput"},{"key":"R42","first-page":"52","volume":"27","author":"Mani","year":"2019","journal-title":"J. New Theory"},{"key":"R43","unstructured":"Motameni H. and Ebrahimnejad A., Constraint shortest path problem in a network with intuitionistic fuzzy arc weights, edited by Medina J., Ojeda-Aciego M., Verdegay J., Perfilieva I., Bouchon-Meunier B. and Yager R.. In: Vol. 855 of Communications in Computer and Information Science. Information Processing and Management of Uncertainty in Knowledge-Based Systems. Applications. IPMU 2018. Springer, New York, NY (2018)."},{"key":"R44","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1287\/trsc.30.3.220","volume":"30","author":"Murthy","year":"1996","journal-title":"Trans. Sci"},{"key":"R45","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1287\/mnsc.44.11.S125","volume":"44","author":"Murthy","year":"1998","journal-title":"Manage. Sci"},{"key":"R46","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10700-005-3665-2","volume":"4","author":"Nayeem","year":"2005","journal-title":"Fuzzy Optim. Decis. Making"},{"key":"R47","unstructured":"Nikolova E., Kelner J.A., Brand M. and Mitzenmacher M., Stochastic shortest paths via quasi-convex maximization. In: Vol. 4168 of Lecture Notes in Computer Science. Algorithms\u2013ESA 2006. Springer, New York, NY (2006) 552\u2013563."},{"key":"R48","first-page":"198","volume":"198","author":"Ohtsubo","year":"2008","journal-title":"Appl. Math. Comput"},{"key":"R49","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0165-0114(03)00225-2","volume":"142","author":"Okada","year":"2004","journal-title":"Fuzzy Sets Syst"},{"key":"R50","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0360-8352(93)90242-P","volume":"25","author":"Okada","year":"1993","journal-title":"Comput. Ind. Eng"},{"key":"R51","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0165-0114(98)00054-2","volume":"109","author":"Okada","year":"2000","journal-title":"Fuzzy Sets Syst"},{"key":"R52","first-page":"729","volume":"53","author":"Peer","year":"2007","journal-title":"Comput. Math. App"},{"key":"R53","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1002\/(SICI)1097-0037(199603)27:2<133::AID-NET5>3.0.CO;2-L","volume":"27","author":"Polychronopoulos","year":"1996","journal-title":"Networks"},{"key":"R54","first-page":"57","volume":"5","author":"Ramos","year":"2011","journal-title":"Morfismos"},{"key":"R55","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/S0377-2217(99)00319-7","volume":"127","author":"Sengupta","year":"2000","journal-title":"Eur. J. Oper. Res"},{"key":"R56","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10700-005-4916-y","volume":"5","author":"Sengupta","year":"2006","journal-title":"Fuzzy Optim. Decis. Making"},{"key":"R57","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.trc.2018.04.018","volume":"92","author":"Sever","year":"2018","journal-title":"Trans. Res. Part C: Emerg. Technol"},{"key":"R58","doi-asserted-by":"crossref","first-page":"1122","DOI":"10.1287\/opre.28.5.1122","volume":"28","author":"Sigal","year":"1980","journal-title":"Oper. Res"},{"key":"R59","first-page":"989","volume":"60","author":"Tajdin","year":"2010","journal-title":"Comput. Math. App"},{"key":"R60","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/moor.1120.0562","volume":"38","author":"Yu","year":"2013","journal-title":"Math. Oper. Res"},{"key":"R61","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.jhazmat.2019.02.101","volume":"375","author":"Zero","year":"2019","journal-title":"J. Hazard. Mater"},{"key":"R62","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.ress.2017.10.026","volume":"179","author":"Zhang","year":"2018","journal-title":"Reliab. Eng. Syst. Saf"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2020033\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T10:01:23Z","timestamp":1614679283000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2020033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":62,"alternative-id":["ro190140"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2020033","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}