Population-Based Learning Algorithm to Solving Permutation Scheduling Problems

被引:0
|
作者
Ding, Caichang [1 ]
Peng, Wenxiu [1 ]
Lu, Lu [1 ]
Liu, Yuanchao [1 ]
机构
[1] Yangtze Univ, Sch Comp Sci, Jinzhou, Hubei Province, Peoples R China
关键词
optimization techniques; self-adaptation; information exchange; social phenomenon;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Population-based methods are optimization techniques inspired by natural evolution processes. They handle a population of individuals that evolves with the help of information exchange procedures. Each individual may also evolve independently. Periods of cooperation alternatewith periods of self-adaptation. Population-based Learning Algorithm (PBLA), is another population-based method, which can be applied to solve combinatorial optimization problems. PBLA has been inspired by analogies to a social phenomenon rather than to evolutionary processes.Whereas evolutionary algorithms emulate basic features of natural evolution including natural selection, hereditary variations, the survival of the fittest, and production of far more offspring than are necessary to replace current generation.
引用
收藏
页码:202 / 207
页数:6
相关论文
共 50 条
  • [1] Population-based Learning Algorithm to Solving Artificial Neural Network Problems
    Ding, Caichang
    Liu, Yuanchao
    Guo, Li
    Lu, Lu
    PROCEEDINGS OF 2011 INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND INDUSTRIAL ENGINEERING, 2011, : 123 - 126
  • [2] Improved Q-learning algorithm for solving permutation flow shop scheduling problems
    He, Zimiao
    Wang, Kunlan
    Li, Hanxiao
    Song, Hong
    Lin, Zhongjie
    Gao, Kaizhou
    Sadollah, Ali
    IET COLLABORATIVE INTELLIGENT MANUFACTURING, 2022, 4 (01) : 35 - 44
  • [3] Solving permutation flowshop scheduling problems with a discrete differential evolution algorithm
    Santucci, Valentino
    Baioletti, Marco
    Milani, Alfredo
    AI COMMUNICATIONS, 2016, 29 (02) : 269 - 286
  • [4] A Novel Cuckoo Search Algorithm for Solving Permutation Flowshop Scheduling Problems
    Tian, Shenshen
    Li, Xiangyu
    Wan, Jie
    Zhang, Yi
    IEEE INTERNATIONAL CONFERENCE ON RECENT ADVANCES IN SYSTEMS SCIENCE AND ENGINEERING (IEEE RASSE 2021), 2021,
  • [5] A Hybrid Population-based Incremental Learning Algorithm for M-machine Reentrant Permutation Flow-shop Scheduling
    Li, Zuo-Cheng
    Qian, Bin
    Hu, Rong
    Zhu, Xiao-Hong
    ENGINEERING SOLUTIONS FOR MANUFACTURING PROCESSES, PTS 1-3, 2013, 655-657 : 1636 - 1641
  • [6] A Hybrid Crow Search Algorithm for Solving Permutation Flow Shop Scheduling Problems
    Huang, Ko-Wei
    Girsang, Abba Suganda
    Wu, Ze-Xue
    Chuang, Yu-Wei
    APPLIED SCIENCES-BASEL, 2019, 9 (07):
  • [7] A population-based algorithm for solving linear assignment problems with two objectives
    Gandibleux, Xavier
    Morita, Hiroyuki
    Katoh, Naoki
    COMPUTERS & OPERATIONS RESEARCH, 2017, 79 : 291 - 303
  • [8] Solving project scheduling problems with a heuristic learning algorithm
    Zamani, R
    Shue, LY
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1998, 49 (07) : 709 - 716
  • [9] A cooperative population-based iterated greedy algorithm for distributed permutation flowshop group scheduling problem
    Zhao, Hui
    Pan, Quan-Ke
    Gao, Kai-Zhou
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2023, 125
  • [10] Robust Start for Population-Based Algorithms Solving Job-Shop Scheduling Problems
    Nezhad, Majid Abdolrazzagh
    Abdullah, Salwani
    2011 3RD CONFERENCE ON DATA MINING AND OPTIMIZATION (DMO), 2011, : 219 - 226