Roulette Wheel Selection To Encourage Discrete Particle Swarm Optimization Solving Toll-Keeper Scheduling Problem

被引:0
|
作者
Ounsrimuang, Pimolrat [1 ]
Nootyaskool, Supakit [2 ]
机构
[1] Mahasarakham Univ, Fac Informat, Polar Lab, Maha Sarakham, Thailand
[2] King Mongkuts Inst Technol Ladkrabang, Fac Informat Technol, Bangkok, Thailand
关键词
Particle swarm optimization; scheduling problem; roulette wheel selection; discrete space;
D O I
暂无
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Particle Swarm Optimization (PSO) has been proven to solve various applications by most applications using the real problem-space. In some specific problem, the discrete problem-space is selected on PSO that getting the solution result slowly by cause of sticky on local solution, and also the researcher cannot modify or difficult to understand how to improve the performance finding solution. The researcher many be tried to adjust velocity value by giving a new c1, c2 and weight to be a smaller or a larger value. This research proposed how to apply roulette wheel select to improve PSO on the discrete problem-space. Experiment tested the idea by a toll-keeper scheduling and a numerical function. Both problems created parameters inform discrete problem-space. The experiment result showed that PSO with roulette wheel selection taking the solution quickly.
引用
收藏
页码:390 / 393
页数:4
相关论文
共 50 条
  • [1] Discrete particle swarm optimization for solving WTA problem
    Qu, Zai-Bin
    Liu, Yan-Jun
    Xu, Xiao-Fei
    Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology, 2011, 43 (03): : 67 - 69
  • [2] A hybrid discrete particle swarm optimization algorithm for solving fuzzy job shop scheduling problem
    Jun-qing Li
    Yu-xia Pan
    The International Journal of Advanced Manufacturing Technology, 2013, 66 : 583 - 596
  • [3] A hybrid discrete particle swarm optimization algorithm for solving fuzzy job shop scheduling problem
    Li, Jun-qing
    Pan, Yu-xia
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 66 (1-4): : 583 - 596
  • [4] Parameters selection in the discrete particle swarm optimization algorithm solving gate and runway combinational optimization problem
    1600, Digital Information Research Foundation, 2 Srinivasamoorthy Avenue, L.B Road, Adyar, Chennai, 600 020, India (11):
  • [5] An Improved Discrete Particle Swarm Optimization for Berth Scheduling Problem
    Huang, Danhua
    Wang, Su
    MECHATRONICS, ROBOTICS AND AUTOMATION, PTS 1-3, 2013, 373-375 : 1192 - +
  • [6] Erratum to: A hybrid discrete particle swarm optimization algorithm for solving fuzzy job shop scheduling problem
    Jun-qing Li
    Yu-xia Pan
    The International Journal of Advanced Manufacturing Technology, 2013, 66 (1-4) : 597 - 600
  • [7] Solving the planning and scheduling problem simultaneously in a hospital with a bi-layer discrete particle swarm optimization
    Wu, Xiuli
    Shen, Xianli
    Zhang, Linjuan
    MATHEMATICAL BIOSCIENCES AND ENGINEERING, 2019, 16 (02) : 831 - 861
  • [8] Multi-swarm and chaotic whale-particle swarm optimization algorithm with a selection method based on roulette wheel
    Asghari, Kayvan
    Masdari, Mohammad
    Gharehchopogh, Farhad Soleimanian
    Saneifard, Rahim
    EXPERT SYSTEMS, 2021, 38 (08)
  • [9] Particle swarm optimization algorithm for solving airline crew scheduling problem
    Ezzinbi, Omar
    Sarhani, Malek
    El Afia, Abdellatif
    Benadada, Youssef
    PROCEEDINGS OF 2014 2ND IEEE INTERNATIONAL CONFERENCE ON LOGISTICS AND OPERATIONS MANAGEMENT (GOL 2014), 2014, : 52 - 56
  • [10] Fuzzy discrete particle swarm optimization for solving traveling salesman problem
    Pang, W
    Wang, KP
    Zhou, CG
    Dong, LJ
    FOURTH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY, PROCEEDINGS, 2004, : 796 - 800