{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T17:08:06Z","timestamp":1776877686662,"version":"3.51.2"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T00:00:00Z","timestamp":1571875200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T00:00:00Z","timestamp":1571875200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00500-019-04423-3","type":"journal-article","created":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T16:28:14Z","timestamp":1572020894000},"page":"8975-8996","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":33,"title":["Uncertain programming models for multi-objective shortest path problem with uncertain parameters"],"prefix":"10.1007","volume":"24","author":[{"given":"Saibal","family":"Majumder","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohuya B.","family":"Kar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samarjit","family":"Kar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tandra","family":"Pal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,24]]},"reference":[{"issue":"1","key":"4423_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"E Bellman","year":"1958","unstructured":"Bellman E (1958) On a routing problem. Q Appl Math 16(1):87\u201390","journal-title":"Q Appl Math"},{"issue":"1","key":"4423_CR2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/mnsc.6.1.73","volume":"6","author":"A Charnes","year":"1959","unstructured":"Charnes A, Cooper WW (1959) Chance-constrained programming. Manage Sci 6(1):73\u201379","journal-title":"Manage Sci"},{"key":"4423_CR3","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/j.trb.2013.05.008","volume":"57","author":"P Chen","year":"2013","unstructured":"Chen P, Nie Y (2013) Bi-criterion shortest path problem with a general nonadditive cost. Transp Res Part B Methodol 57:419\u2013435","journal-title":"Transp Res Part B Methodol"},{"issue":"2","key":"4423_CR4","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1080\/13658816.2011.598133","volume":"26","author":"BY Chen","year":"2012","unstructured":"Chen BY, Lam WHK, Sumalee A, Li Z (2012) Reliable shortest path finding in stochastic networks with spatial correlated link travel times. Int J Geogr Inf Sci 26(2):365\u2013386","journal-title":"Int J Geogr Inf Sci"},{"key":"4423_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-017-0535-z","author":"B Chen","year":"2017","unstructured":"Chen B, Liu Y, Zhou T (2017a) An entropy based solid transportation problem in uncertain environment. J Ambient Intell Humaniz Comput. https:\/\/doi.org\/10.1007\/s12652-017-0535-z","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"4423_CR6","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.asoc.2016.11.027","volume":"51","author":"L Chen","year":"2017","unstructured":"Chen L, Peng J, Zhang B (2017b) Uncertain goal programming models for bicriteria solid transportation problem. Appl Soft Comput 51:49\u201359","journal-title":"Appl Soft Comput"},{"key":"4423_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-016-0538-7","author":"H Dalman","year":"2016","unstructured":"Dalman H (2016) Uncertain programming model for multi-item solid transportation problem. Int J Mach Learn Cybernet. https:\/\/doi.org\/10.1007\/s13042-016-0538-7","journal-title":"Int J Mach Learn Cybernet"},{"issue":"2","key":"4423_CR8","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"4423_CR9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connection with graphs. Numer Math 1(1):269\u2013271","journal-title":"Numer Math"},{"key":"4423_CR10","doi-asserted-by":"crossref","first-page":"2201","DOI":"10.1007\/s00500-013-1194-4","volume":"18","author":"S Ding","year":"2014","unstructured":"Ding S (2014) Uncertain minimum cost flow problem. Soft Comput 18:2201\u20132207","journal-title":"Soft Comput"},{"issue":"3","key":"4423_CR11","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"S Dreyfus","year":"1969","unstructured":"Dreyfus S (1969) An appraisal of some shortest path algorithms. Oper Res 17(3):395\u2013412","journal-title":"Oper Res"},{"issue":"10","key":"4423_CR12","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1016\/j.advengsoft.2011.05.014","volume":"42","author":"JJ Durillo","year":"2011","unstructured":"Durillo JJ, Nebro AJ (2011) jMetal: a Java framework for multi-objective optimization. Adv Eng Softw 42(10):760\u2013771","journal-title":"Adv Eng Softw"},{"key":"4423_CR13","first-page":"265","volume":"1","author":"LJ Eshelman","year":"1991","unstructured":"Eshelman LJ (1991) The CHC adaptive search algorithm: how to have safe search when engaging. Found Genet Algorithm 1:265\u2013283","journal-title":"Found Genet Algorithm"},{"issue":"6","key":"4423_CR14","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd RW (1962) Algorithm-97-shortest path. Commun ACM 5(6):345","journal-title":"Commun ACM"},{"key":"4423_CR15","unstructured":"Fonseca CM, Fleming PJ (1993) Genetic algorithms for multi-objective optimization: formulation, discussion and generalization. In: Proceedings of the fifth international conference on genetic algorithms, San Francisco, CA, USA, pp 416\u2013423"},{"issue":"4","key":"4423_CR16","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1287\/opre.17.4.583","volume":"17","author":"H Frank","year":"1969","unstructured":"Frank H (1969) Shortest paths in probability graphs. Oper Res 17(4):583\u2013599","journal-title":"Oper Res"},{"issue":"3","key":"4423_CR17","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1109\/TCT.1965.1082452","volume":"12","author":"H Frank","year":"1965","unstructured":"Frank H, Hakimi SL (1965) Probabilistic flows through a communication network. IEEE Trans Circuit Theory 12(3):413\u2013414","journal-title":"IEEE Trans Circuit Theory"},{"issue":"1","key":"4423_CR18","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10288-005-0074-x","volume":"4","author":"X Gandibleux","year":"2006","unstructured":"Gandibleux X, Beugnies F, Randriamasy S (2006) Martins\u2019 algorithm revisited for multi-objective shortest path problems with a MaxMin cost function. 4OR 4(1):47\u201359","journal-title":"4OR"},{"key":"4423_CR19","doi-asserted-by":"crossref","first-page":"2591","DOI":"10.1016\/j.camwa.2011.07.058","volume":"62","author":"Y Gao","year":"2011","unstructured":"Gao Y (2011) Shortest path problem with uncertain arc lengths. Comput Math Appl 62:2591\u20132600","journal-title":"Comput Math Appl"},{"issue":"6","key":"4423_CR20","doi-asserted-by":"crossref","first-page":"2592","DOI":"10.1016\/j.apm.2011.09.042","volume":"36","author":"Y Gao","year":"2012","unstructured":"Gao Y (2012) Uncertain models for single facility location problems on networks. Appl Math Model 36(6):2592\u20132599","journal-title":"Appl Math Model"},{"issue":"12","key":"4423_CR21","first-page":"270","volume":"15","author":"X Gao","year":"2013","unstructured":"Gao X (2013) Cycle index of uncertain graph. Information 15(12):270\u2013277","journal-title":"Information"},{"issue":"1","key":"4423_CR22","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1142\/S0218488513500074","volume":"21","author":"X Gao","year":"2013","unstructured":"Gao X, Gao Y (2013) Connectedness index of uncertain graphs. Int J Uncertain Fuzziness Knowl Based Syst 21(1):127\u2013137","journal-title":"Int J Uncertain Fuzziness Knowl Based Syst"},{"issue":"6","key":"4423_CR23","doi-asserted-by":"crossref","first-page":"1916","DOI":"10.1007\/s40815-016-0282-x","volume":"19","author":"Y Gao","year":"2017","unstructured":"Gao Y, Kar S (2017) Int J Fuzzy Syst 19(6):1916\u20131926","journal-title":"Int J Fuzzy Syst"},{"issue":"2","key":"4423_CR24","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1109\/TFUZZ.2015.2500267","volume":"24","author":"Y Gao","year":"2016","unstructured":"Gao Y, Qin Z (2016) On computing the edge-connectivity of an uncertain graph. IEEE Trans Fuzzy Syst 24(2):981\u2013991","journal-title":"IEEE Trans Fuzzy Syst"},{"key":"4423_CR25","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.ins.2014.10.048","volume":"296","author":"Y Gao","year":"2015","unstructured":"Gao Y, Yang L, Li S, Kar S (2015) On distribution function of the diameter in uncertain graph. Inf Sci 296:61\u201374","journal-title":"Inf Sci"},{"issue":"3","key":"4423_CR26","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1007\/s10845-014-1002-8","volume":"28","author":"C Guo","year":"2017","unstructured":"Guo C, Gao J (2017) Optimal dealer pricing under transaction uncertainty. J Intell Manuf 28(3):657\u2013665","journal-title":"J Intell Manuf"},{"issue":"3","key":"4423_CR27","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1287\/trsc.20.3.182","volume":"20","author":"R Hall","year":"1986","unstructured":"Hall R (1986) The fastest path through a network with random time-dependent travel time. Transp Sci 20(3):182\u2013188","journal-title":"Transp Sci"},{"key":"4423_CR28","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/j.ins.2013.11.029","volume":"265","author":"S Han","year":"2014","unstructured":"Han S, Peng Z, Wang S (2014) The maximum flow problem of uncertain network. Inf Sci 265:167\u2013175","journal-title":"Inf Sci"},{"key":"4423_CR29","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-3-642-48782-8_9","volume-title":"Multiple criteria decision making theory and application","author":"P Hansen","year":"1980","unstructured":"Hansen P (1980) Bi-criterion path problems. In: Fandel G, Gal T (eds) Multiple criteria decision making theory and application, vol 177. Lecture Notes in Economics and Mathematical Systems. Springer, Berlin, pp 109\u2013127"},{"key":"4423_CR30","unstructured":"Horn J, Nafploitis N, Goldberg DE (1994) A niched Pareto genetic algorithm for multi-objective optimization. In: Proceedings of the first IEEE conference on evolutionary computation, Piscataway, NJ, pp 82\u201387"},{"key":"4423_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-3611-1","author":"Z Hu","year":"2018","unstructured":"Hu Z, Gao J (2018) Uncertain Gompertz regression model with imprecise observations. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-018-3611-1","journal-title":"Soft Comput"},{"issue":"2","key":"4423_CR32","doi-asserted-by":"crossref","first-page":"263","DOI":"10.2307\/1914185","volume":"47","author":"D Kahneman","year":"1979","unstructured":"Kahneman D, Tversky A (1979) Prospect theory: an analysis of decision under risk. Econometrica 47(2):263\u2013292","journal-title":"Econometrica"},{"issue":"6","key":"4423_CR33","doi-asserted-by":"crossref","first-page":"4467","DOI":"10.3233\/JIFS-169212","volume":"32","author":"MB Kar","year":"2017","unstructured":"Kar MB, Majumder S, Kar S, Pal T (2017) Cross-entropy based multi-objective uncertain portfolio selection problem. J Intell Fuzzy Syst 32(6):4467\u20134483","journal-title":"J Intell Fuzzy Syst"},{"issue":"1","key":"4423_CR34","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1006\/jmaa.1993.1067","volume":"173","author":"MM Kostreva","year":"1993","unstructured":"Kostreva MM, Wiecek MM (1993) Time dependency in multiple objective dynamic programming. J Math Anal Appl 173(1):289\u2013307","journal-title":"J Math Anal Appl"},{"key":"4423_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-7908-1781-2","volume-title":"Theory and practice of uncertain programming","author":"B Liu","year":"2002","unstructured":"Liu B (2002) Theory and practice of uncertain programming. Springer, Berlin"},{"key":"4423_CR36","volume-title":"Uncertainty theory","author":"B Liu","year":"2007","unstructured":"Liu B (2007) Uncertainty theory, 2nd edn. Springer, Berlin","edition":"2"},{"issue":"1","key":"4423_CR37","first-page":"3","volume":"3","author":"B Liu","year":"2009","unstructured":"Liu B (2009a) Some research problems in uncertainty theory. J Uncertain Syst 3(1):3\u201310","journal-title":"J Uncertain Syst"},{"key":"4423_CR38","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-89484-1","volume-title":"Theory and practice of uncertain programming","author":"B Liu","year":"2009","unstructured":"Liu B (2009b) Theory and practice of uncertain programming, 2nd edn. Springer, Berlin","edition":"2"},{"key":"4423_CR39","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-13959-8","volume-title":"Uncertainty theory: a branch of mathematics for modeling human uncertainty","author":"B Liu","year":"2010","unstructured":"Liu B (2010) Uncertainty theory: a branch of mathematics for modeling human uncertainty. Springer, Berlin"},{"issue":"1","key":"4423_CR40","first-page":"3","volume":"6","author":"B Liu","year":"2012","unstructured":"Liu B (2012) Why is there a need for uncertainty theory? J Uncertain Syst 6(1):3\u201310","journal-title":"J Uncertain Syst"},{"issue":"3","key":"4423_CR41","first-page":"181","volume":"4","author":"YH Liu","year":"2010","unstructured":"Liu YH, Ha MH (2010) Expected value of function of uncertain variables. J Uncertain Syst 4(3):181\u2013186","journal-title":"J Uncertain Syst"},{"issue":"4","key":"4423_CR42","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/TFUZZ.2002.800692","volume":"10","author":"B Liu","year":"2002","unstructured":"Liu B, Liu YK (2002) Expected value of fuzzy variable and fuzzy expected value models. IEEE Trans Fuzzy Syst 10(4):445\u2013450","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"17","key":"4423_CR43","doi-asserted-by":"crossref","first-page":"5825","DOI":"10.1007\/s00500-017-2718-0","volume":"22","author":"L Liu","year":"2018","unstructured":"Liu L, Zhang B, Ma W (2018) Uncertain programming models for fixed charge multi-item solid transportation problem. Soft Comput 22(17):5825\u20135833","journal-title":"Soft Comput"},{"key":"4423_CR44","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-017-2987-7","author":"S Majumder","year":"2018","unstructured":"Majumder S, Kundu P, Kar S, Pal T (2018a) Uncertain multi-objective multi-item fixed charge solid transportation problem with budget constraint. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-017-2987-7","journal-title":"Soft Comput"},{"key":"4423_CR45","doi-asserted-by":"publisher","unstructured":"Majumder S, Kar S, Pal T (2018b) Mean-entropy model of uncertain portfolio selection problem. In: Mandal JK, Mukhopadhyay S, Dutta P (eds) Multi-objective optimization: evolutionary to hybrid framework. Springer, Singapore https:\/\/doi.org\/10.1007\/978-981-13-1471-1_2","DOI":"10.1007\/978-981-13-1471-1_2"},{"key":"4423_CR46","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-03697-3","author":"S Majumder","year":"2018","unstructured":"Majumder S, Kar S, Pal T (2018c) Uncertain multi-objective Chinese postman problem. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-018-03697-3","journal-title":"Soft Comput"},{"issue":"4","key":"4423_CR47","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0305-0548(76)90017-4","volume":"3","author":"PB Mirchandani","year":"1976","unstructured":"Mirchandani PB (1976) Shortest distance and reliability of probabilistic networks. Comput Oper Res 3(4):347\u2013676","journal-title":"Comput Oper Res"},{"issue":"1","key":"4423_CR48","first-page":"30","volume":"12","author":"D Mou","year":"2013","unstructured":"Mou D, Zhao W, Chen X (2013) Transportation problem with uncertain truck times and unit costs. Ind Eng Manage Syst 12(1):30\u201335","journal-title":"Ind Eng Manage Syst"},{"issue":"1","key":"4423_CR49","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/TCYB.2014.2317693","volume":"45","author":"K Nag","year":"2015","unstructured":"Nag K, Pal T, Pal NR (2015) ASMiGA: an archive-based steady-state micro genetic algorithm. IEEE Trans Cybernet 45(1):40\u201352","journal-title":"IEEE Trans Cybernet"},{"key":"4423_CR50","doi-asserted-by":"crossref","unstructured":"Nebro AJ, Alba E, Molina G, Chicano F, Luna F, Durillo JJ (2007) Optimal antenna placement using a new multi-objective CHC algorithm. In: GECCO \u201807 proceedings of the 9th annual conference on genetic and evolutionary computation, New York, NY, USA, pp 876\u2013883","DOI":"10.1145\/1276958.1277128"},{"issue":"6","key":"4423_CR51","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/j.trb.2009.01.008","volume":"43","author":"Y Nie","year":"2009","unstructured":"Nie Y, Wu X (2009) Shortest path problem considering on-time arrival probability. Transp Res Part B Methodol 43(6):597\u2013613","journal-title":"Transp Res Part B Methodol"},{"key":"4423_CR52","unstructured":"Papadimitriou CH, Yannakakis M (2000) On the approximability of trade-offs and optimal access of web sources. In: Proceedings 41st annual IEEE symposium on foundations of computer science, Redondo Beach, CA, USA, pp 86\u201392"},{"key":"4423_CR53","volume-title":"Engineering optimization-theory and practice","author":"SS Rao","year":"2006","unstructured":"Rao SS (2006) Engineering optimization-theory and practice, 3rd edn. New Age International Publishers, New Delhi","edition":"3"},{"key":"4423_CR54","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.cor.2014.11.010","volume":"57","author":"A Sede\u00f1o-Noda","year":"2015","unstructured":"Sede\u00f1o-Noda A, Raith A (2015) A Dijkstra-like method computing all extreme supported nondominated solutions of the bi-objective shortest path problem. Comput Oper Res 57:83\u201394","journal-title":"Comput Oper Res"},{"key":"4423_CR55","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.cie.2016.07.011","volume":"99","author":"Y Sheng","year":"2016","unstructured":"Sheng Y, Gao Y (2016) Shortest path problem of uncertain random network. Comput Ind Eng 99:97\u2013105","journal-title":"Comput Ind Eng"},{"issue":"8","key":"4423_CR56","first-page":"3179","volume":"15","author":"Y Sheng","year":"2012","unstructured":"Sheng Y, Yao K (2012) A transportation model with uncertain costs and demands. Information 15(8):3179\u20133186","journal-title":"Information"},{"key":"4423_CR57","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.enavi.2015.06.008","volume":"2","author":"G Shi","year":"2015","unstructured":"Shi G, Sheng Y, Cui Q (2015) Relative entropy model of uncertain random shortest path. Int J e-Navigation Marit Econ 2:87\u2013100","journal-title":"Int J e-Navigation Marit Econ"},{"key":"4423_CR58","unstructured":"Van Veldhuizen DA, Lamont GB (1998) Multi-objective evolutionary algorithm research: a history and analysis, Technical Report TR-98-03, Dept. Elec. Comput. Eng., Graduate School of Eng., Air Force Inst. Technol., Wright-Patterson, AFB, OH"},{"issue":"4","key":"4423_CR59","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1109\/TFUZZ.2015.2486809","volume":"24","author":"X Yang","year":"2016","unstructured":"Yang X, Gao J (2016) Linear-quadratic uncertain differential game with application to resource extraction problem. IEEE Trans Fuzzy Syst 24(4):819\u2013826","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"3","key":"4423_CR60","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s10845-014-1010-8","volume":"28","author":"X Yang","year":"2017","unstructured":"Yang X, Gao J (2017) Bayesian equilibria for uncertain bimatrix game with asymmetric information. J Intell Manuf 28(3):515\u2013525","journal-title":"J Intell Manuf"},{"key":"4423_CR61","unstructured":"Yao K (2010) Expected value of lognormal uncertain variable. In: Proceedings of the first international conference on uncertainty theory, Urumchi, China, pp 241\u2013243"},{"issue":"10","key":"4423_CR62","first-page":"3901","volume":"15","author":"X Zhang","year":"2012","unstructured":"Zhang X, Chen X (2012) A new uncertain programming model for project scheduling problem. Information 15(10):3901\u20133910","journal-title":"Information"},{"issue":"6","key":"4423_CR63","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: a multi-objective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"4423_CR64","first-page":"18","volume":"11","author":"B Zhang","year":"2012","unstructured":"Zhang B, Peng J (2012) Uncertain programming model for Chinese postman problem with uncertain weights. Ind Eng Manage Syst 11(1):18\u201325","journal-title":"Ind Eng Manage Syst"},{"issue":"9","key":"4423_CR65","doi-asserted-by":"crossref","first-page":"6458","DOI":"10.1016\/j.apm.2013.01.032","volume":"37","author":"B Zhang","year":"2013","unstructured":"Zhang B, Peng J (2013) Uncertain programming model for uncertain optimal assignment problem. Appl Math Model 37(9):6458\u20136468","journal-title":"Appl Math Model"},{"issue":"2016","key":"4423_CR66","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.cie.2016.10.030","volume":"102","author":"B Zhang","year":"2016","unstructured":"Zhang B, Peng J, Li S, Chen L (2016) Fixed charge solid transportation problem in uncertain environment and its algorithm. Comput Ind Eng 102(2016):186\u2013197","journal-title":"Comput Ind Eng"},{"key":"4423_CR67","first-page":"506","volume":"333","author":"B Zhang","year":"2018","unstructured":"Zhang B, Li H, Li S, Peng J (2018a) Sustainable multi-depot emergency facilities location-routing problem with uncertain information. Appl Math Comput 333:506\u2013520","journal-title":"Appl Math Comput"},{"issue":"16","key":"4423_CR68","doi-asserted-by":"crossref","first-page":"5335","DOI":"10.1007\/s00500-018-3028-x","volume":"22","author":"Y Zhang","year":"2018","unstructured":"Zhang Y, Gao J, An Q (2018b) International investing in uncertain financial market. Soft Comput 22(16):5335\u20135346","journal-title":"Soft Comput"},{"key":"4423_CR69","unstructured":"Zhou A, Jin Y, Zhang Q, Sendho B, Tsang E (2006) Combining model-based and genetics-based offspring generation for multi-objective optimization using a convergence criterion. In: IEEE congress on evolutionary computation, Sheraton Vancouver Wall Center Vancouver, BC, Canada, pp 3234\u20133241"},{"issue":"9","key":"4423_CR70","first-page":"2353","volume":"9","author":"J Zhou","year":"2014","unstructured":"Zhou J, Yang F, Wang K (2014a) An inverse shortest path problem on an uncertain graph. J Netw 9(9):2353\u20132359","journal-title":"J Netw"},{"issue":"5","key":"4423_CR71","doi-asserted-by":"crossref","first-page":"385","DOI":"10.12720\/jcm.9.5.385-390","volume":"9","author":"J Zhou","year":"2014","unstructured":"Zhou J, He X, Wang K (2014b) Uncertain quadratic minimum spanning tree problem. J Commun 9(5):385\u2013390","journal-title":"J Commun"},{"issue":"1","key":"4423_CR72","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1142\/S0218488515500038","volume":"23","author":"J Zhou","year":"2015","unstructured":"Zhou J, Chen L, Wang K (2015) Path optimality conditions for minimum spanning tree problem with uncertain edge weights. Int J Uncertain Fuzziness Knowl Based Syst 23(1):49\u201371","journal-title":"Int J Uncertain Fuzziness Knowl Based Syst"},{"issue":"4","key":"4423_CR73","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multi-objective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evol Comput"},{"key":"4423_CR74","doi-asserted-by":"crossref","unstructured":"Zockaie A, Nie Y, Mahmassani HS (2014) Plan B: a simulation-based method for finding minimum travel time budget paths in stochastic networks with correlated link times. Transportation Research Record: Journal of the Transportation Research Board (2467, pp 140\u2013148). Washington, DC: Transportation Research Board of the National Academies","DOI":"10.3141\/2467-15"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04423-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-04423-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04423-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,2]],"date-time":"2022-10-02T16:57:34Z","timestamp":1664729854000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-04423-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,24]]},"references-count":74,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["4423"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-04423-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,24]]},"assertion":[{"value":"24 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that there is no conflict of interest regarding the publication of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Informed consent is obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}