Modified Teaching-Learning Based Optimization for 0-1 knapsack Optimization Problems

被引：0
|
作者：
Ouyang, Haibin [1 ]
Wang, Qing [1 ]
Kong, Xiangyong [2 ]
机构：
[1] Guangzhou Univ, Sch Mech & Elect Engn, Guangzhou 510006, Guangdong, Peoples R China
[2] Jiangsu Normal Univ, Sch Elect Engn & Automat, Xuzhou 221116, Peoples R China
来源：
2017 29TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC) | 2017年
关键词：
Teaching-learning-based optimization; 0-1 knapsack optimization problems; estimation of distribution operation; global learning operation; ALGORITHM;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this article, a modified teaching-learning-based optimization (MTLBO) algorithm is proposed for solving 0-1 knapsack optimization problems. The MTLBO incorporated estimation of distribution operation into teaching phases, which aims at reducing the possibility of premature and predicting an elite teacher. A stochastic local exploitation is used in teaching phase for improving local searching capability. Moreover, in the learning phase, a new global learning operation is presented to boost learning efficiency. Several classic 0-1 knapsack cases are selected to evaluate the performance of MTLBO. Numerical results reveal that the proposed algorithm surpasses TLBO and several other promising heuristic methods.
引用
收藏
页码：973 / 977
页数：5
相关论文
共 50 条
  • [31] Solving 0-1 knapsack problems based on amoeboid organism algorithm
    Zhang, Xiaoge
    Huang, Shiyan
    Hu, Yong
    Zhang, Yajuan
    Mahadevan, Sankaran
    Deng, Yong
    APPLIED MATHEMATICS AND COMPUTATION, 2013, 219 (19) : 9959 - 9970
  • [32] An improved particle swarm optimization algorithm for solving 0-1 knapsack problem
    Zhang, Guo-Li
    Wei, Yi
    PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2008, : 915 - +
  • [33] A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem
    Haddar, Boukthir
    Khemakhem, Mahdi
    Rhimi, Hamza
    Chabchoub, Habib
    NATURAL COMPUTING, 2016, 15 (01) : 153 - 164
  • [34] Binary social group optimization algorithm for solving 0-1 knapsack problem
    Naik, Anima
    Chokkalingam, Pradeep Kumar
    DECISION SCIENCE LETTERS, 2022, 11 (01) : 55 - 72
  • [35] Artificial Glowworm Swarm Optimization Algorithm for Solving 0-1 Knapsack Problem
    Gong, Qiaoqiao
    Zhou, Yongquan
    Yang, Yan
    SMART MATERIALS AND INTELLIGENT SYSTEMS, PTS 1 AND 2, 2011, 143-144 : 166 - 171
  • [36] On the max-min 0-1 knapsack problem with robust optimization applications
    Yu, G
    OPERATIONS RESEARCH, 1996, 44 (02) : 407 - 415
  • [37] On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems
    L. F. Escudero
    S. Martello
    P. Toth
    Annals of Operations Research, 1998, 81 (0) : 379 - 404
  • [38] On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
    Escudero, LF
    Martello, S
    Toth, P
    ANNALS OF OPERATIONS RESEARCH, 1998, 81 : 379 - 404
  • [39] A modified nature inspired meta-heuristic whale optimization algorithm for solving 0-1 knapsack problem
    Abdel-Basset, Mohamed
    El-Shahat, Doaa
    Sangaiah, Arun Kumar
    INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2019, 10 (03) : 495 - 514
  • [40] Binary Aquila Optimizer for 0-1 knapsack problems
    Bas, Emine
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2023, 118
12345