A dynamic opposite learning assisted grasshopper optimization algorithm for the flexible job scheduling problem

Yi Feng, Mengru Liu, Yuqian Zhang, Jinglin Wang, Dan Selisteanu

Research output: Journal PublicationArticlepeer-review

2 Citations (Scopus)
1 Downloads (Pure)

Abstract

Job shop scheduling problem (JSP) is one of the most difficult optimization problems in manufacturing industry, and flexible job shop scheduling problem (FJSP) is an extension of the classical JSP, which further challenges the algorithm performance. In FJSP, a machine should be selected for each process from a given set, which introduces another decision element within the job path, making FJSP be more difficult than traditional JSP. In this paper, a variant of grasshopper optimization algorithm (GOA) named dynamic opposite learning assisted GOA (DOLGOA) is proposed to solve FJSP. )e recently proposed dynamic opposite learning (DOL) strategy adopts the asymmetric search space to improve the exploitation ability of the algorithm and increase the possibility of finding the global optimum. Various popular benchmarks from CEC 2014 and FJSP are used to evaluate the performance of DOLGOA. Numerical results with comparisons of other classic algorithms show that DOLGOA gets obvious improvement for solving global optimization problems and is well-performed when solving FJSP.
Original languageEnglish
Pages (from-to)1-19
JournalComplexity
Volume2020
DOIs
Publication statusPublished - 30 Dec 2020

Fingerprint

Dive into the research topics of 'A dynamic opposite learning assisted grasshopper optimization algorithm for the flexible job scheduling problem'. Together they form a unique fingerprint.

Cite this