Research on uncertain bi-objective UAV mission allocation problem

被引:0
|
作者
Lisheng Zhang
Mingfa Zheng
Haitao Zhong
Aoyu Zheng
机构
[1] Air Force Engineering University,Fundamentals Department
来源
Evolutionary Intelligence | 2024年 / 17卷
关键词
Uncertainty theory; Bi-objective optimization; UAV mission allocation; Ant colony algorithm;
D O I
暂无
中图分类号
学科分类号
摘要
Based on the uncertainty theory, this paper studies the uncertain bi-objective UAV mission allocation problem in uncertain environment. Firstly, by regarding uncertainty factors in the mission allocation planning as uncertain variables and considering two missions of combat mission gains and flight fuel consumption, a uncertain bi-objective UAV mission allocation (UBUMA) model is established. Secondly, in order to overcome the disconnection between the objective functions caused by the traditional method to deal with uncertain factors, this paper proposes a so-called uncertain method to solve UBMUA problem by defining the relationship of order between uncertain variables. According the real decision-making process, the UBUMA is transformed into a single-objective programming problem by using CE\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_E$$\end{document} principle relation. Finally, the ant algorithm is employed to solve the single-objective programming problem and then the CE\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_E$$\end{document} efficient mission routes are obtained. The simulation results show that this method can effectively deal with UBUMA problem, and the mission allocation efficient routes is reasonable.
引用
收藏
页码:229 / 237
页数:8
相关论文
共 50 条
  • [21] The bi-objective covering tour problem
    Jozefowiez, Nicolas
    Semet, Frederic
    Talbi, El-Ghazali
    COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (07) : 1929 - 1942
  • [22] A Bi-Objective Green Closed Loop Supply Chain Design Problem with Uncertain Demand
    Liu, Ming
    Liu, Rongfan
    Zhu, Zhanguo
    Chu, Chengbin
    Man, Xiaoyi
    SUSTAINABILITY, 2018, 10 (04)
  • [23] Allocation balancing and minimization of the expected costs in a bi-objective stochastic capacitated location problem
    Shiripour, Saber
    INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE AND ENGINEERING MANAGEMENT, 2019, 14 (01) : 1 - 8
  • [24] Efficient methods for a bi-objective nursing home location and allocation problem: A case study
    Wang, Shijin
    Ma, Shuan
    APPLIED SOFT COMPUTING, 2018, 65 : 280 - 291
  • [25] Uncertain location-allocation decisions for a bi-objective two-stage supply chain network design problem with environmental impacts
    Mahmoodirad, Ali
    Niroomand, Sadegh
    EXPERT SYSTEMS, 2020, 37 (05)
  • [26] A bi-objective model for robust berth allocation scheduling
    Zhen, Lu
    Chang, Dao-Fang
    COMPUTERS & INDUSTRIAL ENGINEERING, 2012, 63 (01) : 262 - 273
  • [27] Metaheuristics for the bi-objective ring star problem
    Liefooghe, Arnaud
    Jourdan, Laetitia
    Basseur, Matthieu
    Talbi, El-Ghazali
    Burke, Edmund K.
    EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2008, 4972 : 206 - +
  • [28] The bi-objective Pollution-Routing Problem
    Demir, Emrah
    Bektas, Tolga
    Laporte, Gilbert
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 232 (03) : 464 - 478
  • [29] A study of the bi-objective next release problem
    Durillo, Juan J.
    Zhang, Yuanyuan
    Alba, Enrique
    Harman, Mark
    Nebro, Antonio J.
    EMPIRICAL SOFTWARE ENGINEERING, 2011, 16 (01) : 29 - 60
  • [30] A bi-objective study of the minimum latency problem
    N. A. Arellano-Arriaga
    J. Molina
    S. E. Schaeffer
    A. M. Álvarez-Socarrás
    I. A. Martínez-Salazar
    Journal of Heuristics, 2019, 25 : 431 - 454