Zobrazeno 1 - 10
of 2 621
pro vyhledávání: '"Li, Wenhua"'
Most multimodal multi-objective evolutionary algorithms (MMEAs) aim to find all global Pareto optimal sets (PSs) for a multimodal multi-objective optimization problem (MMOP). However, in real-world problems, decision makers (DMs) may be also interest
Externí odkaz:
http://arxiv.org/abs/2212.01219
Autor:
Yang, Dewang1 (AUTHOR) yangdewang_lcu@126.com, Li, Wenhua1 (AUTHOR) wh1463425962@163.com, Tian, Haoyue2 (AUTHOR) thaoyue1999@163.com, Chen, Zhigao3 (AUTHOR) 15166344354@163.com, Ji, Yuhang3 (AUTHOR) ji3282466882@163.com, Dong, Hui4 (AUTHOR) dh_caep@163.com, Wang, Yongmei3 (AUTHOR) yongmeiwang2011@163.com
Publikováno v:
Sensors (14248220). Sep2024, Vol. 24 Issue 17, p5825. 9p.
Publikováno v:
Guan'gai paishui xuebao, Vol 43, Iss 3, Pp 45-51 (2024)
【Objective】 The Shendong mining region is the largest coal mine in China. Extensive coal mining for many years has altered the geological landscape and disrupted ecology, leading to surface subsidence, drop of groundwater table, loss of soil mois
Externí odkaz:
https://doaj.org/article/ddaf8384171645c1abaff367f3d48074
Binary matrix optimization commonly arise in the real world, e.g., multi-microgrid network structure design problem (MGNSDP), which is to minimize the total length of the power supply line under certain constraints. Finding the global optimal solutio
Externí odkaz:
http://arxiv.org/abs/2207.08327
Multimodal multi-objective problems (MMOPs) commonly arise in real-world problems where distant solutions in decision space correspond to very similar objective values. To obtain all solutions for MMOPs, many multimodal multi-objective evolutionary a
Externí odkaz:
http://arxiv.org/abs/2207.04730
Multi-objective orienteering problems (MO-OPs) are classical multi-objective routing problems and have received a lot of attention in the past decades. This study seeks to solve MO-OPs through a problem-decomposition framework, that is, a MO-OP is de
Externí odkaz:
http://arxiv.org/abs/2206.10464
This paper presents a new method for solving an orienteering problem (OP) by breaking it down into two parts: a knapsack problem (KP) and a traveling salesman problem (TSP). A KP solver is responsible for picking nodes, while a TSP solver is responsi
Externí odkaz:
http://arxiv.org/abs/2204.11575
Publikováno v:
In Ocean Engineering 1 November 2024 311 Part 2
Autor:
Chen, Hao, Shen, Zhihao, Guo, Wen-Tao, Jiang, Yan-Ping, Li, Wenhua, Zhang, Dan, Tang, Zhenhua, Sun, Qi-Jun, Tang, Xin-Gui
Publikováno v:
In Journal of Materiomics November 2024 10(6):1308-1316
Publikováno v:
In Environmental Research 1 November 2024 260