TLBO with variable weights applied to shop scheduling problems  

作　　者：Leonardo Ramos Rodrigues Joao Paulo Pordeus Gomes 

机构地区：[1]Electronics Division,Institute of Aeronautics and Space,Praca Marechal Eduardo Gomes,50,Sao Josedos Campos 12228-904,Brazil [2]Computer Science Department,Federal University of Ceara,Rua Campus do Pici,Sn,Fortaleza 60440-554,Brazil

出　　处：《CAAI Transactions on Intelligence Technology》2019年第3期148-158,共11页智能技术学报（英文）

摘　　要：The teaching–learning-based optimisation (TLBO) algorithm is a population-based metaheuristic inspired on the teaching–learning process observed in a classroom. It has been successfully used in a wide range of applications. In this study, the authors present a variant version of TLBO. In the proposed version, different weights are assigned to students during the student phase, with higher weights being assigned to students with better solutions. Three different approaches to assign weights are investigated. Numerical experiments with benchmark instances of the flow-shop and the job-shop scheduling problems are carried out to investigate the performance of the proposed approaches. They compare the proposed approaches with the original TLBO algorithm and with two variants of TLBOs proposed in the literature in terms of solution quality, convergence speed and simulation time. The results obtained by the application of a Friedman statistical test showed that the proposed approaches outperformed the original version of TLBO in terms of convergence, with no significant losses in the average makespan. The additional simulation time required by the proposed approaches is small. The best performance was achieved with the approach of assigning a fixed weight to half the students with the best solutions and assigning zero to other students.

关 键 词：TLBO VARIABLE WEIGHTS SHOP SCHEDULING PROBLEMS 

分 类 号：G[文化科学]