Effective hierarchical optimization by a hierarchical multi-space competitive genetic algorithm for the flexible job-shop scheduling problem

被引:45
作者
Ishikawa, Shudai [1 ]
Kubota, Ryosuke [2 ]
Horio, Keiichi [1 ]
机构
[1] Kyushu Inst Technol, Grad Sch Life Sci & Syst Engn, Wakamatsu Ku, Kitakyushu, Fukuoka 804, Japan
[2] Ube Natl Coll Technol, Dept Intelligent Syst Engn, Ube, Yamaguchi, Japan
关键词
Multiple solution space; Solution space competition; Genetic algorithm; Hierarchical optimization; Flexible job-shop scheduling problem;
D O I
10.1016/j.eswa.2015.08.003
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we propose a new optimization technique, the hierarchical multi-space competitive distributed genetic algorithm (HmcDGA), which is effective for the hierarchical optimization problem. It is an extension of the multi-space competitive distributed genetic algorithm (mcDGA), which was proposed by the authors. The mcDGA efficiently finds an optimal solution with a low computational cost by increasing the number of individuals in a solution space in which it is likely to exist. An optimization method that is divided into several levels of hierarchy is called a hierarchical optimization. Several hierarchical optimization techniques have been proposed, including the hierarchical genetic algorithm (HGA). In hierarchical optimization, a complex problem is divided into a hierarchical collection of simpler problems, and each level is optimized independently. In this way, complex problems can be solved without the need to develop problem-specific operators. However, in the conventional HGA, this results in a high computational cost because the genetic algorithm (GA) is repeated many times at upper and lower level. The HmcDGA is a hybrid of the mcDGA and HGA, and it has some of the advantages of each one; for example, the HmcDGA can find an optimal solution at low computational cost and without requiring special operations. This allows it to be applied to a wide variety of optimization problems. Therefore, the HmcDGA may become the powerful optimization algorithm that can solve various problems. In this paper, we apply the proposed HmcDGA to the flexible job-shop scheduling problem (FJSP) which is one of the complex combinational optimization problem and confirm its effectiveness. Simulation results show that the HmcDGA can find solutions that are comparable to those found by using GAs developed specifically for the FJSP, the HmcDGA is not required a lot of computational costs comparing to the HGA. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码:9434 / 9440
页数:7
相关论文
共 27 条
[1]   An efficient hybridized genetic algorithm architecture for the flexible job shop scheduling problem [J].
Al-Hinai, Nasr ;
ElMekkawy, T. Y. .
FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2011, 23 (01) :64-85
[2]   A genetic algorithm for the vehicle routing problem [J].
Baker, BM ;
Ayechew, MA .
COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (05) :787-800
[3]  
Brandimarte P., 1993, Annals of Operations Research, V41, P157, DOI 10.1007/BF02023073
[4]   JOB-SHOP SCHEDULING WITH MULTIPURPOSE MACHINES [J].
BRUCKER, P ;
SCHLIE, R .
COMPUTING, 1990, 45 (04) :369-375
[5]  
Chen HX, 1999, ICRA '99: IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-4, PROCEEDINGS, P1120, DOI 10.1109/ROBOT.1999.772512
[6]  
Davis L., 1985, IJCAI, P162
[7]  
de Jong ED, 2004, LECT NOTES COMPUT SC, V3242, P232
[8]  
Garey M. R., 1976, Mathematics of Operations Research, V1, P117, DOI 10.1287/moor.1.2.117
[9]   FUTURE PATHS FOR INTEGER PROGRAMMING AND LINKS TO ARTIFICIAL-INTELLIGENCE [J].
GLOVER, F .
COMPUTERS & OPERATIONS RESEARCH, 1986, 13 (05) :533-549
[10]  
Goldberg D. E., 1985, P 1 INT C GEN ALG TH, P154