Bi-objective lion swarm optimization based on teaching and learning algorithm

被引:0
作者
Zhang, Qi [1 ]
Jiang, Mingyan [1 ]
机构
[1] Shandong Univ, Sch Informat Sci & Engn, Qingdao 266237, Peoples R China
来源
PROCEEDINGS OF 2022 THE 6TH INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND SOFT COMPUTING, ICMLSC 20222 | 2022年
关键词
teaching and learning; bi-objective; lion swarm optimization algorithm; uniform distribution;
D O I
10.1145/3523150.3523160
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
To address the problem that it is difficult to obtain a good quality and uniformly distributed Pareto optimal solution set for a complex biobjective system model, this paper proposes a Teaching-Learning-based Bi-objective Lion Swarm Optimization algorithm (TLBLSO) for solving the bi-objective system uniform Pareto solution set problem. The idea and mechanism of teaching and learning optimization algorithm are introduced into the Lion Swarm algorithm. That is, the knowledge level of the whole group is improved by the way of individual teachers imparting knowledge and students exchanging knowledge, which effectively improves the spatial searching ability of the lion swarm. By comparing with other optimization algorithms, the experimental results show that the proposed TLBLSO can obtain well-distributed optimization solutions, which verifies the superiority of the proposed algorithm in this paper.
引用
收藏
页码:61 / 65
页数:5
相关论文
共 50 条
[41]   An Adaptive Lion Swarm Optimization Algorithm Incorporating Tent Chaotic Search and Information Entropy [J].
Liu, Miaomiao ;
Zhang, Yuying ;
Guo, Jingfeng ;
Chen, Jing ;
Liu, Zhigang .
INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2023, 16 (01)
[42]   Construction of Prioritized T-Way Test Suite Using Bi-Objective Dragonfly Algorithm [J].
Ahmed, Mashuk ;
Nasser, Abdullah B. ;
Zamli, Kamal Z. .
IEEE ACCESS, 2022, 10 (71683-71698) :71683-71698
[43]   An efficient matheuristic algorithm for bi-objective sustainable closed-loop supply chain networks [J].
Ade Irawan, Chandra ;
Dan-Asabe Abdulrahman, Muhammad ;
Salhi, Said ;
Luis, Martino .
IMA JOURNAL OF MANAGEMENT MATHEMATICS, 2022, 33 (04) :603-636
[44]   Multi-objective evolutionary algorithm on simplified bi-objective minimum weight minimum label spanning tree problems [J].
Lai, Xinsheng ;
Xia, Xiaoyun .
INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING, 2019, 20 (03) :354-361
[45]   Bi-objective programming approach for solving the metro timetable optimization problem with dwell time uncertainty [J].
Yang, Xin ;
Chen, Anthony ;
Ning, Bin ;
Tang, Tao .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2017, 97 :22-37
[46]   Bi-objective optimization for Scheduling and Multi-skilled Worker Assignments in the Hybrid Flow Shop [J].
Liu, Ming ;
Yang, Xuenan .
IFAC PAPERSONLINE, 2019, 52 (13) :2128-2133
[47]   A Deterministic Annealing Algorithm for a Bi-Objective Full Truckload Vehicle Routing Problem in Drayage Operations [J].
Braekers, Kris ;
Caris, An ;
Janssens, Gerrit K. .
STATE OF THE ART IN THE EUROPEAN QUANTITATIVE ORIENTED TRANSPORTATION AND LOGISTICS RESEARCH, 2011: 14TH EURO WORKING GROUP ON TRANSPORTATION & 26TH MINI EURO CONFERENCE & 1ST EUROPEAN SCIENTIFIC CONFERENCE ON AIR TRANSPORT, 2011, 20
[48]   Sensorless sequential charging guidance and control for multiple types of electric vehicles with ordered piles based on bi-objective hierarchical optimization [J].
Wang, Wen ;
Yang, Ye ;
Han, Qingwen ;
Li, Shuaihua ;
Li, Peijun ;
Wu, Fan ;
Zhong, Yulu .
ELECTRIC POWER SYSTEMS RESEARCH, 2025, 245
[49]   Solution for bi-objective single row facility layout problem using artificial bee colony algorithm [J].
Nagarajan, Lenin ;
Mahalingam, Siva Kumar ;
Gurusamy, Selvakumar ;
Dharmaraj, Vignesh Kumar .
EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2018, 12 (02) :252-275
[50]   Design of a genetic algorithm for bi-objective flow shop scheduling problems with re-entrant jobs [J].
Carman K. M. Lee ;
Danping Lin ;
William Ho ;
Zhang Wu .
The International Journal of Advanced Manufacturing Technology, 2011, 56 :1105-1113