An Adaptive Multi-Strategy Artificial Bee Colony Algorithm for Integrated Process Planning and Scheduling

被引:14
作者
Cao, Yang [1 ,2 ,3 ,4 ,5 ,6 ]
Shi, Haibo [2 ,3 ,5 ]
机构
[1] Northeastern Univ, Coll Informat Sci & Engn, Shenyang 110819, Peoples R China
[2] Chinese Acad Sci, Shenyang Inst Automat, Shenyang 110016, Peoples R China
[3] Chinese Acad Sci, Inst Robot & Intelligent Mfg, Shenyang 110169, Peoples R China
[4] Univ Chinese Acad Sci, Beijing 100049, Peoples R China
[5] Chinese Acad Sci, Key Lab Network Control Syst, Shenyang 110016, Peoples R China
[6] Shenyang Jianzhu Univ, Informat & Control Engn Fac, Shenyang 110168, Peoples R China
关键词
Process planning; Job shop scheduling; Search problems; Scheduling; Optimization; Heuristic algorithms; Artificial bee colony algorithm; Integrated process planning and scheduling; artificial bee colony algorithm; multi-objective optimization; multi-strategy collaboration; strategy adaptation; PARTICLE SWARM OPTIMIZATION; GENETIC ALGORITHM;
D O I
10.1109/ACCESS.2021.3075948
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Traditionally, process planning and scheduling were performed sequentially, where scheduling depended on the result of process planning. Considering their complementarity, the two functions are more tightly integrated to improve the performance of job shop flexible manufacturing environment. This study proposes an adaptive multi-strategy artificial bee colony (AMSABC) algorithm to solve integrated process planning and scheduling (IPPS) problem. In AMSABC, two search strategies with different characteristics are introduced into employed bees and onlooker bees to take on the responsibility of both exploration and exploitation. The selection probability of each search strategy is dynamically adjusted according to previous experiences. To further improve the exploitation performance of the approach, a problem-specific multi-objective local search has been embedded in the proposed algorithm. Furthermore, AMSABC algorithm presents a unique solution representation where a food source is represented by three discrete vectors, and a well-designed decoding scheme is developed. Next, the corresponding neighborhood structure is adopted that it can directly generate feasible solutions in the search space. The proposed algorithm is tested on the well-known benchmark instances and compared with the state-of-the-art algorithms. Through detail analysis of experimental results, AMSABC algorithm is more beneficial in the quality and efficiency of solution.
引用
收藏
页码:65622 / 65637
页数:16
相关论文
共 55 条
[1]   Chaotic bee colony algorithms for global numerical optimization [J].
Alatas, Bilal .
EXPERT SYSTEMS WITH APPLICATIONS, 2010, 37 (08) :5682-5687
[2]  
[Anonymous], 2015, INT J ADV MANUF TECH
[3]  
[Anonymous], SET DATA INTEGRATION
[4]  
Baker KeithR., 2009, PRINCIPLES SEQUENCIN, DOI DOI 10.1002/9780470451793
[5]   Constraint-directed techniques for scheduling alternative activities [J].
Beck, JC ;
Fox, MS .
ARTIFICIAL INTELLIGENCE, 2000, 121 (1-2) :211-250
[6]   Differential Evolution With Neighborhood and Direction Information for Numerical Optimization [J].
Cai, Yiqiao ;
Wang, Jiahai .
IEEE TRANSACTIONS ON CYBERNETICS, 2013, 43 (06) :2202-2215
[7]   Exploration and Exploitation in Evolutionary Algorithms: A Survey [J].
Crepinsek, Matej ;
Liu, Shih-Hsi ;
Mernik, Marjan .
ACM COMPUTING SURVEYS, 2013, 45 (03)
[8]   A novel artificial bee colony algorithm with depth-first search framework and elite-guided search equation [J].
Cui, Laizhong ;
Li, Genghui ;
Lin, Qiuzhen ;
Du, Zhihua ;
Gao, Weifeng ;
Chen, Jianyong ;
Lu, Nan .
INFORMATION SCIENCES, 2016, 367 :1012-1044
[9]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[10]  
Demsar J, 2006, J MACH LEARN RES, V7, P1