When the network optimization problem is discussed, in the actual situation, it is necessary to consider the uncertain factors in the network. This paper employs the theories of uncertainty, uncertain programming and network optimization to solve the uncertain network optimization problem. First, based on uncertainty theory and uncertainty graph, we redefine the concept of an uncertain network system, and propose a unified identification method for an uncertain network system based on a conditional uncertain measure matrix. Second, we establish the network optimization model for the shortest path problem based on a conditional uncertain measure matrix. Third, according to the measure simulation technology, a hybrid intelligent algorithm is designed to solve the model. Finally, the correctness and feasibility of the approach is illustrated by a numerical example of an underground logistics system.
Citation: Xiaodie Lv, Yi Liu, Yihua Zhong. A novel method to solve the optimization problem of uncertain network system based on uncertainty theory[J]. AIMS Mathematics, 2023, 8(3): 5445-5461. doi: 10.3934/math.2023274
When the network optimization problem is discussed, in the actual situation, it is necessary to consider the uncertain factors in the network. This paper employs the theories of uncertainty, uncertain programming and network optimization to solve the uncertain network optimization problem. First, based on uncertainty theory and uncertainty graph, we redefine the concept of an uncertain network system, and propose a unified identification method for an uncertain network system based on a conditional uncertain measure matrix. Second, we establish the network optimization model for the shortest path problem based on a conditional uncertain measure matrix. Third, according to the measure simulation technology, a hybrid intelligent algorithm is designed to solve the model. Finally, the correctness and feasibility of the approach is illustrated by a numerical example of an underground logistics system.
[1] | L. Wang, Z. Chen, G. Yang, Q. Sun, J. Ge, An interval uncertain optimization method using back-propagation neural network differentiation, Comput. Method. Appl. M., 366 (2020), 113065. https://doi.org/10.1016/j.cma.2020.113065 doi: 10.1016/j.cma.2020.113065 |
[2] | L. Wang, G. Yang, Z. Li, F. Xu, An efficient nonlinear interval uncertain optimization method using Legendre polynomial chaos expansion, Appl. Soft Comput., 108 (2021), 107454. https://doi.org/10.1016/j.asoc.2021.107454 doi: 10.1016/j.asoc.2021.107454 |
[3] | L. Wang, Z. Chen, G. Yang, An interval uncertainty analysis method for structural response bounds using feed forward neural network differentiation, Appl. Math. Model., 82 (2020), 449–468. https://doi.org/10.1016/j.apm.2020.01.059 doi: 10.1016/j.apm.2020.01.059 |
[4] | Y. Liu, X. Wang, L. Wang, Interval uncertainty analysis for static response of structures using radial basis functions, Appl. Math. Model., 69 (2019), 425–440. https://doi.org/10.1016/j.apm.2018.12.018 doi: 10.1016/j.apm.2018.12.018 |
[5] | X. Y. Ji, Network optimization in uncertain environment, Tsinghua University, Beijing, 2006. Available from: http://cdmd.cnki.com.cn/Article/CDMD-10003-2007070686.htm. |
[6] | F. G. He, Research on models and algorithms of some network optimization problems under uncertainty, Huazhong University of science and technology, Wuhan, 2009. Available from: http://cdmd.cnki.com.cn/Article/CDMD-10487-2009173370.htm. |
[7] | Y. H. Sheng, Uncertain stochastic network optimization, Tsinghua University, Beijing, 2015. Available from: http://cdmd.cnki.com.cn/Article/CDMD-10003-1016713018.htm. |
[8] | Y. Gao, Shortest path problem with uncertain arc lengths, Comput. Math. Appl., 62 (2011), 2591–2600. https://doi.org/10.1016/j.camwa.2011.07.058 doi: 10.1016/j.camwa.2011.07.058 |
[9] | M. Guillot, The stochastic shortest path problem: a polyhedral combinatory perspective, Eur. J. Oper. Res., 285 (2020), 148–158. https://doi.org/10.1016/j.ejor.2018.10.052 doi: 10.1016/j.ejor.2018.10.052 |
[10] | K. W. Jie, The shortest path problem and its critical edge in uncertain environment, IEEE Access, 2019. https://doi.org/10.1109/ACCESS.2019.2948958 doi: 10.1109/ACCESS.2019.2948958 |
[11] | Y. Gao, Uncertain models for single facility location problems on networks, Appl. Math. Model., 36 (2012), 2592–2599. https://doi.org/10.1016/j.apm.2011.09.042 doi: 10.1016/j.apm.2011.09.042 |
[12] | B. Liu, Uncertainty Theory, 2Eds., Berlin: Springer-Verlag, 2007. http://dx.doi.org/10.1007/978-3-540-73165-8_5 |
[13] | B. Liu, Why is there a need for uncertainty theory? J. Uncertain Syst., 6 (2012), 3–10. https://www.researchgate.net/publication/228449921 |
[14] | B. Liu, Uncertainty theory: A branch of mathematics for modeling human uncertainty, Berlin: Springer-Verlag, 2010. http://dx.doi.org/10.1007/978-3-642-13959-8_1 |
[15] | B. Liu, Theory and practice of uncertain programming, Berlin: Springer Berlin Heidelberg, 2009. https://dx.doi.org/10.1007/978-3-540-89484-1 |
[16] | Y. Gao, L. Yang, S. Li, S. Kar, On distribution function of the diameter in uncertain graph, Inf. Sci., 1 (2015), 61–74. https://doi.org/10.1016/j.ins.2014.10.048 doi: 10.1016/j.ins.2014.10.048 |
[17] | Y. Gao, X. Gao, Connectedness index of uncertain graphs, Int. J. Uncertain. Fuzz., 21 (2013), 127–137. https://doi.org/10.1142/S0218488513500074 doi: 10.1142/S0218488513500074 |
[18] | Y. Gao, Uncertain graph and network, Tsinghua University, Beijing, 2013. Available from: http://cdmd.cnki.com.cn/Article/CDMD-10003-1014020745.htm. |
[19] | S. M. Luo, Research on network optimization model and application based on uncertainty graph, Southwest Petroleum University, Chengdu, 2018. Available from: http://cdmd.cnki.com.cn/Article/CDMD-10615-1019002310.htm. |
[20] | D. M. Chibisov, Bernoulli's law of large numbers and the strong law of large numbers, Theor. Probab. Appl., 60 (2016), 318–319. https://doi.org/10.1137/S0040585X97T987696 doi: 10.1137/S0040585X97T987696 |
[21] | A. Migdalas, P. M. Pardalos, A note on open problems and challenges in optimization theory and algorithms, Open Prob. Optim. Data Anal., 141 (2018), 1–8. https://doi.org/10.1007/978-3-319-99142-9_1 doi: 10.1007/978-3-319-99142-9_1 |
[22] | O. N. Egbunike, A. T. Potter, Are freight pipelines a pipe dream? A critical review of the UK and European perspective, J. Tra. Geo., 19 (2011), 499–508. https://doi.org/10.1016/j.jtrangeo.2010.05.004 doi: 10.1016/j.jtrangeo.2010.05.004 |
[23] | I. E. Zevgolis, A. A. Mavrikos, D. C. Kaliampakos, Construction, storage capacity and economics of an underground warehousing-logistics center in Athens, Tunn. Undergr. Sp.Tech., 19 (2014), 165–173. https://doi.org/10.1016/j.tust.2003.11.004 |
[24] | M. G. He, L. Sun, Node layout plans for urban underground logistics systems based on heuristic Bat algorithm, Comput. Commun., 154 (2020), 465–480. https://doi.org/10.1016/j.comcom.2020.02.075 doi: 10.1016/j.comcom.2020.02.075 |
[25] | Y. P. Gao, D. F. Chang, Design and optimization of parking lot in an underground container logistics system, Comput. Ind. Eng., 130 (2019), 327–337. https://doi.org/10.1016/j.cie.2019.02.043 doi: 10.1016/j.cie.2019.02.043 |
[26] | Z. Y. Peng, D. Y. Zhong, Optimization model for closed-loop logistics network design in manufacturing and remanufacturing system, 2007 International Conference, 2007. https://doi.org/10.1109/ICSSSM.2007.4280246 |
[27] | W. J. Hu, J. J. Dong, Network planning of urban underground logistics system with hub-and-spoke layout: two phase cluster-based approach, Eng. Constr. Archit. Ma., 27 (2020), 2079–2105. https://doi.org/10.1108/ECAM-06-2019-0296 doi: 10.1108/ECAM-06-2019-0296 |
[28] | B. Erkayman, E. Gundogar, G. Akkaya, A fuzzy TOPSIS approach for logistics center location problem, J. Bus. Case Stud., 7 (2011), 49–54. https://doi.org/10.19030/jbcs.v7i3.4263 doi: 10.19030/jbcs.v7i3.4263 |
[29] | X. Bai, Y. Zhao, Y. Liu, A novel approach to study real-time dynamic optimization analysis and simulation of complex mine logistics transportation hybrid system with belt and surge links, Discrete Dyn. Nat. Soc., 2015, 1–8. http://doi.org/10.1155/2015/601578 doi: 10.1155/2015/601578 |