An Improved Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling Problem

Algorithms

Kong Lu¹  Li Ting¹  Wang Keming¹  Zhu Hanbing¹  Takano Makoto³  Yu Bin² 

[1] Transportation Management College, Dalian Maritime University, Dalian 116026, China; E-Mails:;Traffic and transportation college, Beijing Jiaotong University, Beijing 100044, China;Department of transportation Engineering, Indian Institute of Technology, Kharagpur 721302, India; E-Mail:

关键词: shuffled frog-leaping algorithm;    flexible job shop scheduling problem;    local search;    extremal optimization;   

DOI  :  10.3390/a8010019

来源: mdpi

【 摘 要 】

The flexible job shop scheduling problem is a well-known combinatorial optimization problem. This paper proposes an improved shuffled frog-leaping algorithm to solve the flexible job shop scheduling problem. The algorithm possesses an adjustment sequence to design the strategy of local searching and an extremal optimization in information exchange. The computational result shows that the proposed algorithm has a powerful search capability in solving the flexible job shop scheduling problem compared with other heuristic algorithms, such as the genetic algorithm, tabu search and ant colony optimization. Moreover, the results also show that the improved strategies could improve the performance of the algorithm effectively.

【 授权许可】

CC BY   
© 2015 by the authors; licensee MDPI, Basel, Switzerland