Abstract：Owing to the incapability of traditional methods in solving multi-objective U-shaped disassembly line balancing problem (UDLBP), a multi-objective ant colony genetic algorithm based on Pareto set is proposed to solve the UDLBP. In constructing the initial solution phase, the maximum operation time and the minimum disassembly cost difference were collaboratively considered as the heuristic information of the ants. The feasible disassembly sequence was searched using the ant colony algorithm, and the Pareto solution set was obtained based on the dominance relationship among the multiple objectives. Further, the Pareto non-inferior solutions of the ant colony algorithm were used as the chromosomes of the genetic operator. Moreover, the results of the genetic operator were fed back to the accumulation of pheromone on the optimal disassembly sequence. The crowding distance was regarded as the global pheromone update strategy to balance the effect of multi-objective function regarding the pheromone and thereby make the algorithm obtain better solutions readily. The proposed algorithm was applied to 52 disassembly task examples and a printer disassembly line instance. Compared with the Pareto ant colony algorithm, the performances of the three evaluation indicators of the 8 non-inferior solutions obtained using the proposed algorithm are improved by 50.43%, 3.25%, and 14.10%, respectively. In the example application, the proposed algorithm obtained eight balancing schemes, which verifies the effectiveness, superiority, and practicability of the proposed algorithm.
GUNGOR A, GUPTA S M. Disassembly line in product recovery[J]. International Journal of Production Research, 2002, 40(11):2569-2589.
[3]
AVIKAL S, MISHRA P K, JAIN R. A Fuzzy AHP and PROMETHEE method-based heuristic for disassembly line balancing problems[J]. International Journal of Production Research, 2014, 52(5):1306-1317.
[4]
BENTAHA M L, BATTAIA O, DOLGUI A. Lagrangian relaxation for stochastic disassembly line balancing problem[J]. Procedia CIRP, 2014(17):56-60.
[5]
MCGOVERN S M, GUPTA S M. A balancing method and genetic algorithm for disassembly line balancing[J]. European Journal of Operational Research, 2007, 179(3):692-708.
[6]
朱兴涛,张则强,朱勋梦,等. 求解多目标拆卸线平衡问题的一种蚁群算法[J]. 中国机械工程,2014,25(8):1075-1079. ZHU Xingtao, ZHANG Zeqaing, ZHU Xunmeng, et al. An ant colony optimization algorithm for multi-objective disassembly line balancing problem[J]. China Mechanical Engineering, 2014, 25(8):1075-1079.
[7]
MCGOVERN S M, GUPTA S M. Ant colony optimization for disassembly sequencing with multiple objectives[J]. The International Journal of Advanced Manufacturing Technology, 2006, 30(5):481-496.
[8]
KALAYCI C B, GUPTA S M. A particle swarm optimization algorithm for solving disassembly line balancing problem[C]//Proceedings for the Northeast Region Decision Sciences Institute.:Newport, 2012:347-357.
[9]
KALAYCI C B, GUPTA S M, NAKASHIMA K. Bees colony intelligence in solving disassembly line balancing problem[C]//Proceedings of the 2011 Asian Conference of Management Science and Applications. Sanya:, 2011:34-41.
[10]
张则强,胡扬,陈冲. 求解拆卸线平衡问题的改进人工蜂群算法[J]. 西南交通大学学报,2016,51(5):910-917. ZHANG Zeqiang, HU Yang, CHEN Chong. An improved artificial bee colony algorithm for disassembly line balancing problem[J]. Journal of Southwest Jiaotong University, 2016, 51(5):910-917.
[11]
KALAYCI C B, POLAT O, GUPTA S M. A variable neighbourhood search algorithm for disassembly lines[J]. Journal of Manufacturing Technology Management, 2015, 26(2):182-194.
[12]
TUNCEL E, ZEID A, KAMARTHI S. Solving large scale disassembly line balancing problem with uncertainty using reinforcement learning[J]. Journal of Intelligent Manufacturing, 2014, 25(4):647-659.
[13]
KALAYCI C B, GUPTA S M. Tabu search for disassembly line balancing with multiple objectives[C]//Proceedings of the 41st International Conference on Computers & Industrial Engineering. Los Angeles:, 2011:477-482.
[14]
KALAYCI C B, GUPTA S M, NAKASHIMA K. A simulated annealing algorithm for balancing a disassembly line[C]//Proceedings of the Seventh International Symposium on Environmentally Conscious Design and Inverse Manufacturing. Netherlands:, 2011:713-718.
[15]
METE S, CIL Z A, AGPAK K, et al. A solution approach based on beam search algorithm for disassembly line balancing problem[J]. Journal of Manufacturing Systems, 2016, 41:188-200.
[16]
丁力平,谭建荣,冯毅雄,等. 基于Pareto蚁群算法的拆卸线平衡多目标优化[J]. 计算机集成制造系统,2009,15(7):1406-1413. DING Liping, TAN Jianrong, FENG Yixiong, et al. Multiobjective optimization for disassembly line balancing based on Pareto ant colony algorithm[J]. Computer Integrated Manufacturing Systems, 2009, 15(7):1406-1413, 1429.
[17]
ALAVIDOOST M, BABAZADEH H, SAYYARI S. An interactive fuzzy programming approach for bi-objective straight and U-shaped assembly line balancing problem[J]. Applied Soft Computing, 2016, 40:221-235.
[18]
ALAVIDOOST M H, ZARANDI M H, TARIMORADI M, et al. Modified genetic algorithm for simple straight and U-shaped assembly line balancing with fuzzy processing times[J]. Journal of Intelligent Manufacturing, 2017, 28(2):313-336.
[19]
AGRAWAL S, TIWARI M K. A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem[J]. International Journal of Production Research, 2008, 46(6):1405-1429.
[20]
李明,张则强,胡扬. U型布局的拆卸线平衡问题及其求解算法研究[J]. 现代制造工程,2015(7):7-12. LI Ming, ZHANG Zeqaing, HU Yang. Research on U-shaped disassembly line balancing problem and solving algorithm[J]. Modern Manufacturing Engineering, 2015(7):7-12.
[21]
张则强,胡俊逸,程文明. 第Ⅰ类双边装配线平衡问题的改进蚁群算法[J]. 西南交通大学学报,2013,48(4):724-730. ZHANG Zeqiang, HU Junyi, CHENG Wenming. Improved ant colony algorithms for two-sided assembly line balancing problem of type Ⅰ[J]. Journal of Southwest Jiaotong University, 2013, 48(4):724-730.
[22]
KUCUKKOC I, ZHANG D Z. Integrating ant colony and genetic algorithms in the balancing and scheduling of complex assembly lines[J]. The International Journal of Advanced Manufacturing Technology, 2016, 82(1/2/3/4):265-285.
[23]
DEB K, PRATAP A, AGARWAL S, et al. A fast and elitist multiobjective genetic algorithm:NSGA-Ⅱ[J]. IEEE Transactions on Evolutionary Computation, 2002, 6(2):182-197.
