Yanggang Teng* | Jinjie Chen | Ting Chen | Guilin Ge
OPEN ACCESS
Although the problem of disassembly line balance has been studied in depth, there are fewer starting points from green, economy and position as the basis for path planning. This paper considers the disassembly path from the three perspective. For green perspective, even if the product doesn’t have the economic value, the toxic solid and liquid must be excluded; For economic, the re-utilize value of the disassembled object is fewer, the complete disassembly will abandon; Furthermore, the three-dimensional information is difficult to obtain. In this paper, the reducer drawn by Solidworks to obtain the position and mass, and then the improved R-AOG (Rectangle-AND/OR Graph) used to represent the directional relationship of large-scale component disassembly. And use R-AOG de-sign Allowedk, Lastly, compare I-ACO with other ACO to prove the efficiency and quality, and ap-plies it to the reducer disassembly planning to obtain the optimal disassembly path, these experimental results help company to better plan the disassembly line, reduce the maintenance threshold of the reducer, and also beneficial to build automated disassembly lines.
R-AOG, three-dimension disassembly line, dynamic table update, green and economic disassembly, I-ACO
This work was financially supported by Chinese University Students Innovation Fund Project (201411585002Y).
[1] Ministry of Commerce of the People's Republic of China Department of Circulation Industry Development. Development report of Recycled Resources Recycling Industry of China (2016). Recycling Research 9(6): 15-21.
[2] Zhang ZQ, Wang KP, Li LK. (2018). Multi-objective optimization for U-shaped disassembly line balancing problem with stochastic operation times. Computer Integrated Manufacturing Systems 24(1): 89-100.
[3] Zhang L, Liu ZF, Yang M. (2011). Disassembly sequence planning based on interpretative structual model. Journal of Computer-Aided Design & Computer Graphics 23(4): 667-675.
[4] Song XW, Pan XX. (2011). Electromechanical product disassembly sequence planning based on partial destruction mode. Computer Integrated Manufacturing Systems 18(5): 927-931.
[5] Kalaycılar EG, Azizoğlu M, Yeralan S. (2016). A disassem-blyine balancing problem with fixed number of workstations. European Journal of Operational Research 249(2). https://doi.org/10.1016/j.ejor.2015.09.004
[6] Kalayci CB, Hancilar A, Gupta AM. (2014). Multi-objective fuzzy disassembly line balancing using a hybrid discrete artificial bee colony algorithm. Journal of Manufacturing Systems 37. https://doi.org/10.1016/j.jmsy.2014.11.015
[7] Mete S, Çil ZA, Ağpak K, Özceylan E, Dolgui A. (2016). A solution approach based on beam search algorithm for disassembly line balancing problem. Journal of Manufactuing Systems 41. https://doi.org/10.1016/j.jmsy.2016.09.002
[8] Ren YP, Zhang CY, Zhao F, Tian GD, Lin WW, Meng LL, Li HL. (2018). Disassembly line balancing problem using interdependent weights-based multi-criteria decision making and 2-Optimal algorithm. Journal of Cleaner Prodution 174. https://doi.org/10.1016/j.jmsy.2016.09.002
[9] Tian G, Zhou MC, Chu JA. (2013). Chance constrained programming approach to determine the optimal disassembly sequence. IEEE Transactions on Automation Science & Engineering 10(4): 1004-1013. http//doi.org/10.1109/TASE.2013.2249663
[10] Ren YP, Tian GD, Zhao F, Yu DY, Zhang CY. (2017). Selective cooperative disassembly plannining based on multi-objective discrete artificial bee colony algorithm. Engineering Applications of Artificial Intelligence 64. https://doi.org/10.1016/j.engappai.2017.06.025
[11] Zhang ZQ, Wang KP, Zhu LX, Wang Y. (2017). A Pareto improved artificial fish swarm algorithm for solving a multi-objective fuzzy disassembly line balancing problem. Expert Systems with Applications 86. https://doi.org/10.1016/j.eswa.2017.05.053
[12] Liu JY, Zhou ZD, Duc Truong Pham, Xu WJ, Yan JW, Liu AM, Ji CQ, Liu Q. (2018). An improved multi-objective discrete bees algorithm for robotic disassembly line balancing problem in remanufacturing. The International Journal of Advanced Manufacturing Technology 97(9-12). https://doi.org/10.1007/s00170-018-2183-7
[13] Mohand LB, Olga B, Alexandre D. (2014). Lagrangian relaxation for stochastic disassembly line balancing problem. Procedia CIRP 17. https://doi.org/10.1016/j.procir.2014.02.049
[14] Süleyman M, Zeynel AÇ, Eren Ö, Kürşad A. (2016). Resource constrained disassembly line balancing problem. IFAC Papers on Line 49(12). https://doi.org/10.1016/j.procir.2014.02.049
[15] Robert JR, Olga BS, Jack H. (2015). Disassembly line balancing under high variety of end of life states using a joint precedence graph approach. Journal of Manufact Uring Systems 37. https://doi.org/10.1016/j.jmsy.2014.11.002
[16] Naveen K, Doshi JB, Vijayan PK. (2011). Invest-igations on the phenomenon of hysteresis in single-phase natural circulation loops. Smirt. https://doi.org/10.18280/mmep.050305
[17] Turan P, Aşkıner G, Eren Ö, Arif H. (2013). Mixed model disassembly line balancing problem with fuzzy goals. International Journal of Production Research 51(20). https://doi.org/10.1080/00207543.2013.795251
[18] Agrawal S, Tiwari MK. (2006). A collaborative ant colony optimization to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem. International Journal of Production Research 46(6). https://doi.org/10.1080/00207540600943985
[19] Mohand LB, Olga B, Alexandre D. (2013). Chance constrained programming model for stochastic profit–oriented disassembly line balancing in the presence of hazardous parts. Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-41266-0_13
[20] Ali K, Ihsan S, Erdal E. (2009). Two exact formulations for disassembly line balancing problems with task precedence diagram construction using an AND/OR graph. IIE Transactions 41(10). https://doi.org/10.1080/07408170802510390
[21] Tevhide F, Altekin, Levent K, Nur EO. (2007). Profit-oriented disassembly line balancing. International Journal of Production Research 46(10). https://doi.org/10.1080/00207540601137207
[22] Yigit K, Yucel O. (2018). Integrated framework of disassembly line balancing with Green and business objectives using a mixed MCDM. Journal of Cleaner Production 191. https://doi.org/10.1016/j.jclepro.2018.04.189
[23] Yu B, Yang ZZ, Yao BZ. (2008). An improved ant colony optimization for vehicle routing problem. European Journal of Operational Research 196(1). https://doi.org/10.1016/j.ejor.2008.02.028
[24] Dorigo M, Gambardella LM. (1997). Ant colony system: A cooperative learning approach to the traveling sales-man problem. IEEE Trans. on Evolutionary Computation 1(1):53-66.
[25] Dorigo M, Maniezzo V. (1991). Positive Feedback as a Search Strategy. Technical Report.
[26] Yang ZZ, Yu B, Cheng CT. (2007). A parallel ant colony algorithm for bus network optimization. Computer Aided Civil and Infrastructure Engineering 22(1). https://doi.org/10.1111/j.1467-8667.2006.00469.x
[27] Croes GA. (1958). A method for solving traveling salesman problems. Operations Research 6(6). https://doi.org/10.1287/opre.6.6.791
[28] McGovern SM, Gupta SM. (2005). A balancing method and genetic algorithm for disassembly line balancing. European Journal of Operational Research 179(3). https://doi.org/10.1016/j.ejor.2005.03.055
[29] Ravi K, Diptesh G. (2013). Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods. European Journal of Operational Research 224(1). https://doi.org/10.1016/j.ejor.2012.07.037
[30] Montemanni R, Gambardella LM, Rizzoli AE. (2002). A new algorithm for a dynamic vehicle routing problem based on ant colony system. Second International Workshop on Freight Transportation & Logistics, 27-30.
[31] Xu HT, Pu P, Duan F, Gabriella Bretti. (2018). Dynamic vehicle routing problems with enhanced ant colony optimization. Discrete Dynamics in Nature and Society 2018. https://doi.org/10.1155/2018/1295485
[32] Gao SC, Wang YR, Cheng JJ, Inazumi Y, Tang Z. (2016). Ant colony optimization with clustering for solving the dynamic location routing problem. Applied Mathematics and Computation 285. https://doi.org/10.1016/j.amc.2016.03.035
[33] Su MC, Chou CH. (2001). A modified version of the K-means algorithm with a distance based on cluster symmetry. IEEE Computer Society, https://doi.org/2001.10.1109/34.927