A Dynamic Opposite Learning Assisted Grasshopper Optimization Algorithm for the Flexible JobScheduling Problem
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 pro...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2020/8870783 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832547048515174400 |
|---|---|
| author | Yi Feng Mengru Liu Yuqian Zhang Jinglin Wang |
| author_facet | Yi Feng Mengru Liu Yuqian Zhang Jinglin Wang |
| author_sort | Yi Feng |
| collection | DOAJ |
| description | 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. The 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. |
| format | Article |
| id | doaj-art-e7a0e5a7b4754b9ea13ebe95f282b5ba |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2020-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-e7a0e5a7b4754b9ea13ebe95f282b5ba2025-02-03T06:46:20ZengWileyComplexity1076-27871099-05262020-01-01202010.1155/2020/88707838870783A Dynamic Opposite Learning Assisted Grasshopper Optimization Algorithm for the Flexible JobScheduling ProblemYi Feng0Mengru Liu1Yuqian Zhang2Jinglin Wang3Dalian University of Technology, Dalian, ChinaDalian University of Technology, Dalian, ChinaShenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, ChinaUniversity of Nottingham Ningbo China, Ningbo, ChinaJob 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. The 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.http://dx.doi.org/10.1155/2020/8870783 |
| spellingShingle | Yi Feng Mengru Liu Yuqian Zhang Jinglin Wang A Dynamic Opposite Learning Assisted Grasshopper Optimization Algorithm for the Flexible JobScheduling Problem Complexity |
| title | A Dynamic Opposite Learning Assisted Grasshopper Optimization Algorithm for the Flexible JobScheduling Problem |
| title_full | A Dynamic Opposite Learning Assisted Grasshopper Optimization Algorithm for the Flexible JobScheduling Problem |
| title_fullStr | A Dynamic Opposite Learning Assisted Grasshopper Optimization Algorithm for the Flexible JobScheduling Problem |
| title_full_unstemmed | A Dynamic Opposite Learning Assisted Grasshopper Optimization Algorithm for the Flexible JobScheduling Problem |
| title_short | A Dynamic Opposite Learning Assisted Grasshopper Optimization Algorithm for the Flexible JobScheduling Problem |
| title_sort | dynamic opposite learning assisted grasshopper optimization algorithm for the flexible jobscheduling problem |
| url | http://dx.doi.org/10.1155/2020/8870783 |
| work_keys_str_mv | AT yifeng adynamicoppositelearningassistedgrasshopperoptimizationalgorithmfortheflexiblejobschedulingproblem AT mengruliu adynamicoppositelearningassistedgrasshopperoptimizationalgorithmfortheflexiblejobschedulingproblem AT yuqianzhang adynamicoppositelearningassistedgrasshopperoptimizationalgorithmfortheflexiblejobschedulingproblem AT jinglinwang adynamicoppositelearningassistedgrasshopperoptimizationalgorithmfortheflexiblejobschedulingproblem AT yifeng dynamicoppositelearningassistedgrasshopperoptimizationalgorithmfortheflexiblejobschedulingproblem AT mengruliu dynamicoppositelearningassistedgrasshopperoptimizationalgorithmfortheflexiblejobschedulingproblem AT yuqianzhang dynamicoppositelearningassistedgrasshopperoptimizationalgorithmfortheflexiblejobschedulingproblem AT jinglinwang dynamicoppositelearningassistedgrasshopperoptimizationalgorithmfortheflexiblejobschedulingproblem |