Improved social spider algorithm for partial disassembly line balancing problem considering the energy consumption involved in tool switching

References

• Adewumi, Aderemi Oluyinka, and Olawale Joshua Adeleke. 2018. “A Survey of Recent Advances in Vehicle Routing Problems.” International Journal of Systems Assurance Engineering and Management 9 (1): 155–172. doi:10.1007/s13198-016-0493-4.
   Web of Science ®Google Scholar
• Agrawal, S., and M. K. Tiwari. 2008. “A Collaborative Ant Colony Algorithm to Stochastic Mixed-Model U-Shaped Disassembly Line Balancing and Sequencing Problem.” International Journal of Production Research 46 (6): 1405–1429. doi:10.1080/00207540600943985.
   Web of Science ®Google Scholar
• Altekin, F. Tevhide, Levent Kandiller, and Nur Evin Ozdemirel. 2008. “Profit-Oriented Disassembly-Line Balancing.” International Journal of Production Research 46 (10): 2675–2693. doi:10.1080/00207540601137207.
   Web of Science ®Google Scholar
• Bader, Johannes, and Eckart Zitzler. 2011. “HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization.” Evolutionary Computation 19 (1): 45–76. doi:10.1162/EVCO_a_00009.
   PubMed Web of Science ®Google Scholar
• Baş, Emine, and Erkan Ülker. 2020. “A Binary Social Spider Algorithm for Uncapacitated Facility Location Problem.” Expert Systems with Applications 161: 1–27. doi:10.1016/j.eswa.2020.113618.
   Web of Science ®Google Scholar
• Baş, Emine, and Erkan Ülker. 2021. “Dıscrete Socıal Spıder Algorıthm for the Travelıng Salesman Problem.” Artificial Intelligence Review 54 (2): 1063–1085. doi:10.1007/s10462-020-09869-8.
   Web of Science ®Google Scholar
• Bentaha, Mohand Lounes, Alexandre Dolgui, Olga Battaia, Robert J Riggs, and Jack Hu. 2018. “Profit-Oriented Partial Disassembly Line Design: Dealing with Hazardous Parts and Task Processing Times Uncertainty.” International Journal of Production Research 56 (24): 7220–7242. doi:10.1080/00207543.2017.1418987.
   Web of Science ®Google Scholar
• Cevikcan, Emre, Dicle Aslan, and Fatma Betul Yeni. 2020. “Disassembly Line Design with Multi-Manned Workstations: A Novel Heuristic Optimisation Approach.” International Journal of Production Research 58 (3): 649–670. doi:10.1080/00207543.2019.1587190.
   Web of Science ®Google Scholar
• Cordeau, J. F., M. Gendreau, and G. Laporte. 1997. “A Tabu Search Heuristic for Periodic and Multi-Depot Vehicle Routing Problems.” Networks 30 (2): 105–119. doi:10.1002/(sici)1097-0037(199709)30:2<105::Aid-net5>3.3.Co;2-n.
   Web of Science ®Google Scholar
• Ding, Liping, Jianrong Tan, Yixiong Feng, and Yicong Gao. 2009. “Multiobjective Optimization for Disassembly Line Balancing Based on Pareto Ant Colony Algorithm.” Computer Integrated Manufacturing Systems 15 (7): 1406–1413+1429. doi:10.1061/41039(345)45.
   Google Scholar
• Fang, Yilin, Hao Ming, Miqing Li, Quan Liu, and Duc Truong Pham. 2020. “Multi-Objective Evolutionary Simulated Annealing Optimisation for Mixed-Model Multi-Robotic Disassembly Line Balancing with Interval Processing Time.” International Journal of Production Research 58 (3): 846–862. doi:10.1080/00207543.2019.1602290.
   Web of Science ®Google Scholar
• Gabay, Michaël, and Sofia Zaourar. 2016. “Vector Bin Packing with Heterogeneous Bins: Application to the Machine Reassignment Problem.” Annals of Operations Research 242 (1): 161–194. doi:10.1007/s10479-015-1973-7.
   Web of Science ®Google Scholar
• Gupta, S. M., E. Erbis, and S. M. McGovern, and Spie Ieice Commun Soc. 2004. “Disassembly Sequencing Problem: A Case Study of a Cell Phone.” In 4th International Conference on Environmentally Conscious Manufacturing, 5583:43–52. doi:10.1117/12.577196.
   Google Scholar
• Gupta, S. M., and A. Güngör. 2001. “Product Recovery Using a Disassembly Line: Challenges and Solution.” IEEE International Symposium on Electronics and the Environment (617): 36–40. doi:10.1109/isee.2001.924499.
   Google Scholar
• Hezer, Seda, and Yakup Kara. 2015. “A Network-Based Shortest Route Model for Parallel Disassembly Line Balancing Problem.” International Journal of Production Research 53 (6): 1849–1865. doi:10.1080/00207543.2014.965348.
   Web of Science ®Google Scholar
• Kalayci, Can B, and Surendra M Gupta. 2013. “A Simulated Annealing Algorithm for Balancing a Disassembly Line.” Applications of Management Science 16: 81–103. doi:10.1108/S0276-8976(2013)0000016008.
   Google Scholar
• Kalayci, Can B., and Surendra M. Gupta. 2014. “A Tabu Search Algorithm for Balancing a Sequence-Dependent Disassembly Line.” Production Planning and Control 25 (2): 149–160. doi:10.1080/09537287.2013.782949.
   Web of Science ®Google Scholar
• Kalayci, C. B., S. M. Gupta, and K. Nakashima. 2012. “A Simulated Annealing Algorithm for Balancing a Disassembly Line.” In Design for Innovative Value Towards a Sustainable Society: Proceedings of EcoDesign 2011: 7th International Symposium on Environmentally Conscious Design and Inverse Manufacturing, edited by Mitsutaka Matsumoto, Yasushi Umeda, Keijiro Masui, and Shinichi Fukushige, 714-719. Dordrecht: Springer Netherlands. doi:10.1007/978-94-007-3010-6_143.
   Google Scholar
• Kalayci, Can B., Olcay Polat, and Surendra M. Gupta. 2016. “A Hybrid Genetic Algorithm for Sequence-Dependent Disassembly Line Balancing Problem.” Annals of Operations Research 242 (2): 321–354. doi:10.1007/s10479-014-1641-3.
   Web of Science ®Google Scholar
• Kim, J. K., H. Lee-Kwang, and S. W. Yoo. 2001. “Fuzzy Bin Packing Problem.” Fuzzy Sets and Systems 120 (3): 429–434. doi:10.1016/s0165-0114(99)00073-1.
   Web of Science ®Google Scholar
• Koc, Ali, Ihsan Sabuncuoglu, and Erdal Erel. 2009. “Two Exact Formulations for Disassembly Line Balancing Problems with Task Precedence Diagram Construction Using an AND/OR Graph.” IIE Transactions 41 (10): 866–881. doi:10.1080/07408170802510390.
   Web of Science ®Google Scholar
• McGovern, S. M., and S. M. Gupta. 2006. “Ant Colony Optimization for Disassembly Sequencing with Multiple Objectives.” International Journal of Advanced Manufacturing Technology 30: 481–496. doi:10.1007/s00170-005-0037-6.
   Web of Science ®Google Scholar
• McGovern, S. M., and S. M. Gupta. 2007a. “Combinatorial Optimization Analysis of the Unary NP-Complete Disassembly Line Balancing Problem.” International Journal of Production Research 45 (18–19): 4485–4511. doi:10.1080/00207540701476281.
   Web of Science ®Google Scholar
• McGovern, Seamus M, and Surendra M Gupta. 2007b. “A Balancing Method and Genetic Algorithm for Disassembly Line Balancing.” European Journal of Operational Research 179 (3): 692–708. doi:10.1016/j.ejor.2005.03.055.
   Web of Science ®Google Scholar
• Nowakowski, Piotr. 2018. “A Novel, Cost Efficient Identification Method for Disassembly Planning of Waste Electrical and Electronic Equipment.” Journal of Cleaner Production 172: 2695–2707. doi:10.1016/j.jclepro.2017.11.142.
   Web of Science ®Google Scholar
• Özceylan, Eren, Can B. Kalayci, Aşkıner Güngör, and Surendra M. Gupta. 2019. “Disassembly Line Balancing Problem: A Review of the State of the Art and Future Directions.” International Journal of Production Research 57 (15–16): 4805–4827. doi:10.1080/00207543.2018.1428775.
   Web of Science ®Google Scholar
• Paksoy, Turan, Aşkiner Güngör, Eren Özceylan, and Arif Hancilar. 2013. “Mixed Model Disassembly Line Balancing Problem with Fuzzy Goals.” International Journal of Production Research 51 (20): 6082–6096. doi:10.1080/00207543.2013.795251.
   Web of Science ®Google Scholar
• Vu, D. T., X. L. Tran, M. T. Cao, T. C. Tran, and N. D. Hoang. 2020. “Machine Learning Based Soil Erosion Susceptibility Prediction Using Social Spider Algorithm Optimized Multivariate Adaptive Regression Spline.” Measurement 164: 1–15. doi:10.1016/j.measurement.2020.108066.
   Web of Science ®Google Scholar
• Wang, Kaipu, Liang Gao, and Xinyu Li. 2020. “A Multi-Objective Algorithm for U-Shaped Disassembly Line Balancing with Partial Destructive Mode.” Neural Computing & Applications 32: 12715–12736. doi:10.1007/s00521-020-04721-0.
   Web of Science ®Google Scholar
• Wang, Kaipu, Zeqiang Zhang, Lili Mao, and Liuke Li. 2017a. “Pareto Artificial Fish Swarm Algorithm for Multi-Objective Disassembly Line Balancing Problems.” China Mechanical Engineering 28 (2): 183–190. doi:10.3969/j.issn.1004-132X.2017.02.010.
   Google Scholar
• Wang, Kaipu, Zeqiang Zhang, Lixia Zhu, and Binsen Zou. 2017b. “Pareto Genetic Simulated Annealing Algorithm for Multi-Objective Disassembly Line Balancing Problem.” Computer Integrated Manufacturing Systems 23 (6): 1277–1285. doi:10.13196/j.cims.2017.06.013.
   Google Scholar
• Xiao, Qinxin, Xiuping Guo, and Dong Li. 2020. “Partial Disassembly Line Balancing Under Uncertainty: Robust Optimisation Models and an Improved Migrating Birds Optimisation Algorithm.” International Journal of Production Research 59 (10): 2977–2995. doi:10.1080/00207543.2020.1744765.
   Web of Science ®Google Scholar
• Xiao, Shanli, Yujia Wang, Hui Yu, and Shankun Nie. 2017. “An Entropy-Based Adaptive Hybrid Particle Swarm Optimization for Disassembly Line Balancing Problems.” Entropy 19 (11): 1–14. doi:10.3390/e19110596.
   Web of Science ®Google Scholar
• Yang, Hu, Zhang Zeqiang, Wang Kaipu, and Mao Lili. 2016. “Pareto Based Bacteria Foraging Optimization Algorithm for Multi-Objective Disassembly Line Balancing Problem.” Application Research of Computers 33 (11): 3265–3269. doi:10.3969/j.issn.1001–3695.2016.11.015.
   Google Scholar
• Yin, Tao, Zeqiang Zhang, and Jin Jiang. 2021. “A Pareto-Discrete Hummingbird Algorithm for Partial Sequence-Dependent Disassembly Line Balancing Problem Considering Tool Requirements.” Journal of Manufacturing Systems 60: 406–428. doi:10.1016/j.jmsy.2021.07.005.
   Web of Science ®Google Scholar
• Yu, James J.Q., and Victor O.K. Li. 2015. “A Social Spider Algorithm for Global Optimization.” Applied Soft Computing 30: 614–627. doi:10.1016/j.asoc.2015.02.014.
   Web of Science ®Google Scholar
• Zhang, Zeqiang, Yang Hu, and Chong Chen. 2016. “Improved Artificial Bee Colony Algorithm for Disassembly Line Balancing Problem.” Journal of Southwest Jiaotong University 51 (5): 910–917. doi:10.3969/j.issn.0258-2724.2016.05.013.
   Google Scholar
• Zhang, Zeqiang, Kaipu Wang, Lixia Zhu, and Wenming Cheng. 2018. “Pareto Hybrid Ant Colony and Genetic Algorithm for Multi-Objective U-Shaped Disassembly Line Balancing Problem.” Journal of Southwest Jiaotong University 53 (03): 628–637. doi:10.3969/j.issn.0258-2724.2018.03.026.
   Google Scholar
• Zhang, Zeqiang, Kaipu Wang, Lixia Zhu, and Yi Wang. 2017. “A Pareto Improved Artificial Fish Swarm Algorithm for Solving a Multi-Objective Fuzzy Disassembly Line Balancing Problem.” Expert Systems with Applications 86: 1339–1351. doi:10.1016/j.eswa.2017.05.053.
   Web of Science ®Google Scholar
• Zhang, Yu, Zeqiang Zhang, Chao Guan, and Peiyu Xu. 2021. “Improved Whale Optimisation Algorithm for Two-Sided Disassembly Line Balancing Problems Considering Part Characteristic Indexes.” International Journal of Production Research, 60 (8): 2553–2571. doi:10.1080/00207543.2021.1897178.
   Web of Science ®Google Scholar
• Zhou, Guo, Yongquan Zhou, and Ruxin Zhao. 2021. “Hybrid Social Spider Optimization Algorithm with Differential Mutation Operator for the Job-Shop Scheduling Problem.” Journal of Industrial and Management Optimization 17 (2): 533–548. doi:10.3934/jimo.2019122.
   Web of Science ®Google Scholar
• Zhu, Lixia, Zeqiang Zhang, and Yi Wang. 2018. “A Pareto Firefly Algorithm for Multi-Objective Disassembly Line Balancing Problems with Hazard Evaluation.” International Journal of Production Research 56 (24): 7354–7374. doi:10.1080/00207543.2018.1471238.
   Web of Science ®Google Scholar