Influence of encoding and neighborhood in landscape analysis and tabu search performance for job shop scheduling problem

被引:0
|
作者
Tsogbetse, Israel [1 ]
Bernard, Julien [2 ]
Manier, Herve [1 ]
Manier, Marie-Ange [1 ]
机构
[1] UTBM, CNRS, FEMTO ST, F-90010 Belfort, France
[2] Univ Franche Comte, CNRS, FEMTO ST, F-25000 Besancon, France
关键词
Scheduling; Metaheuristics; Evolutionary computations; GENETIC ALGORITHMS; BENCHMARKS; INSTANCES;
D O I
10.1016/j.ejor.2024.07.028
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Fitness landscape analysis is used to understand search spaces of combinatorial problems that can hardly be solved exactly, such as the job shop scheduling problem. We analyze the influence of the solution encodings and the neighborhood operators on usual metrics for landscape analysis, and try to correlate the results to the performance of a local search method such as tabu search using these encodings and operators for a wide range of instances of the job shop scheduling problem.
引用
收藏
页码:739 / 746
页数:8
相关论文
共 50 条
  • [1] Impact of Encoding and Neighborhood on Landscape Analysis for the Job Shop Scheduling Problem
    Tsogbetse, Israel
    Bernard, Julien
    Manier, Herve
    Manier, Marie-Ange
    [J]. IFAC PAPERSONLINE, 2022, 55 (10): : 1237 - 1242
  • [2] A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
    Zhang, ChaoYong
    Li, PeiGen
    Guan, ZaiLin
    Rao, YunQing
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (11) : 3229 - 3242
  • [3] A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem
    Escamilla Serna, Nayeli Jazmin
    Carlos Seck-Tuoh-Mora, Juan
    Medina-Marin, Joselito
    Hernandez-Romero, Norberto
    Barragan-Vite, Irving
    Corona Armenta, Jose Ramon
    [J]. PEERJ COMPUTER SCIENCE, 2021,
  • [4] A Global-local Neighborhood Search Algorithm and Tabu Search for Flexible Job Shop Scheduling Problem
    Serna, Nayeli Jazmin Escamilla
    Seck-Tuoh-Mora, Juan Carlos
    Medina-Marin, Joselito
    Hernandez-Romero, Norberto
    Barragan-Vite, Irving
    Armenta, Jose Ramon Corona
    [J]. PeerJ Computer Science, 2021, 7 : 1 - 32
  • [5] A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem
    Jun-Qing Li
    Quan-Ke Pan
    P. N. Suganthan
    T. J. Chua
    [J]. The International Journal of Advanced Manufacturing Technology, 2011, 52 : 683 - 697
  • [6] A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem
    Li, Jun-Qing
    Pan, Quan-Ke
    Suganthan, P. N.
    Chua, T. J.
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 52 (5-8): : 683 - 697
  • [7] Parallel tabu search for the cyclic job shop scheduling problem
    Bozejko, Wojciech
    Gnatowski, Andrzej
    Pempera, Jaroslaw
    Wodecki, Mieczyslaw
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 113 : 512 - 524
  • [8] SOLVING THE JOB-SHOP SCHEDULING PROBLEM WITH TABU SEARCH
    BARNES, JW
    CHAMBERS, JB
    [J]. IIE TRANSACTIONS, 1995, 27 (02) : 257 - 263
  • [9] Problem difficulty for tabu search in job-shop scheduling
    Watson, JP
    Beck, JC
    Howe, AE
    Whitley, LD
    [J]. ARTIFICIAL INTELLIGENCE, 2003, 143 (02) : 189 - 217
  • [10] AN EFFICIENT TABU SEARCH NEIGHBORHOOD BASED ON RECONSTRUCTION STRATEGY TO SOLVE THE BLOCKING JOB SHOP SCHEDULING PROBLEM
    Dabah, Adel
    Bendjoudi, Ahcene
    AitZai, Abdelhakim
    [J]. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2017, 13 (04) : 2015 - 2031