{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T03:22:09Z","timestamp":1776828129251,"version":"3.51.2"},"reference-count":28,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T00:00:00Z","timestamp":1712448000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Symmetry is an important principle and characteristic that is prevalent in nature and artificial environments. In the three-dimensional packing problem, leveraging the inherent symmetry of goods and the symmetry of the packing space can enhance packing efficiency and utilization.The three-dimensional packing problem is an NP-hard combinatorial optimization problem in the field of modern logistics, with high computational complexity. This paper proposes an improved genetic algorithm by incorporating a fusion tabu search strategy to address this problem. The algorithm employs a three-dimensional loading mathematical model and utilizes a wall-building method under residual space constraints for stacking goods. Furthermore, adaptation of fitness variation strategy, chromosome adjustment, and tabu search algorithm are introduced to balance the algorithm\u2019s global and local search capabilities, as well as to enhance population diversity and convergence speed. Through testing on benchmark cases such as Bischoff and Ratcliff, the improved algorithm demonstrates an average increase of over 3% in packing space utilization compared to traditional genetic algorithms and other heuristic algorithms, validating its feasibility and effectiveness. The proposed improved genetic algorithm provides new insights for solving three-dimensional packing problems and optimizing logistics loading schedules, offering promising prospects for various applications.<\/jats:p>","DOI":"10.3390\/sym16040449","type":"journal-article","created":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T10:11:55Z","timestamp":1712571115000},"page":"449","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Research on Genetic Algorithm Optimization with Fusion Tabu Search Strategy and Its Application in Solving Three-Dimensional Packing Problems"],"prefix":"10.3390","volume":"16","author":[{"given":"Zhenjia","family":"Kang","sequence":"first","affiliation":[{"name":"School of Intelligent Manufacturing, Taizhou University, Taizhou 318000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Guan","sequence":"additional","affiliation":[{"name":"School of Intelligent Manufacturing, Taizhou University, Taizhou 318000, China"},{"name":"School of Electrical and Automation Engineering, East China Jiaotong University, Nanchang 330013, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiake","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Intelligent Manufacturing, Taizhou University, Taizhou 318000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pengzhan","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Intelligent Manufacturing, Taizhou University, Taizhou 318000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,4,7]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1287\/opre.48.2.256.12386","article-title":"The three-dimensional bin packing problem","volume":"48","author":"Martello","year":"2000","journal-title":"Oper. Res."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"2801","DOI":"10.1016\/j.cor.2008.12.015","article-title":"Three-dimensional packings with rotations","volume":"36","author":"Miyazawa","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1111\/j.1475-3995.1997.tb00095.x","article-title":"A genetic algorithm for solving the container loading problem","volume":"4","author":"Gehring","year":"1997","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0377-2217(00)00055-2","article-title":"A hybrid genetic algorithm for the container loading problem","volume":"131","author":"Bortfeldt","year":"2001","journal-title":"Eur. J. Oper. Res."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1016\/j.ijpe.2013.04.019","article-title":"A biased random key genetic algorithm for 2D and 3D bin packing problems","volume":"145","author":"Resende","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"ref_6","first-page":"1287","article-title":"A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem","volume":"219","author":"Kang","year":"2012","journal-title":"Appl. Math. Comput."},{"key":"ref_7","first-page":"1125","article-title":"Optimization of heterogeneous Bin packing using adaptive genetic algorithm","volume":"24","author":"Rajab","year":"2020","journal-title":"Mater. Today Proc."},{"key":"ref_8","first-page":"116390","article-title":"3D heterogeneous bin packing framework for multi-constrained problems using hybrid genetic approach","volume":"193","author":"Yousaf","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_9","first-page":"598","article-title":"Hybrid heuristic algorithms for the multiobjective load balancing of 2D bin packing problems","volume":"11","author":"Kh","year":"2020","journal-title":"Int. J. Adv. Comput. Sci. Appl."},{"key":"ref_10","first-page":"8190","article-title":"Solving a Profited 3D Bin Packing Problem Using a Hybrid Genetic Algorithm","volume":"12","author":"Rajapakshe","year":"2022","journal-title":"Appl. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Laabadi, S., Naimi, M., El Amri, H., and Achchab, B. (2019, January 23\u201326). A Crow Search-Based Genetic Algorithm for Solving Two-Dimensional Bin Packing Problem. Proceedings of the KI 2019: Advances in Artificial Intelligence: 42nd German Conference on AI, Kassel, Germany.","DOI":"10.1007\/978-3-030-30179-8_17"},{"key":"ref_12","first-page":"108426","article-title":"Hybridizing a genetic algorithm with reinforcement learning for automated design of genetic algorithms","volume":"117","author":"Wang","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"ref_13","first-page":"96","article-title":"Online 3D boxing method based on constrained deep reinforcement learning","volume":"41","author":"Zhang","year":"2023","journal-title":"Packag. Food Mach."},{"key":"ref_14","unstructured":"Sun, R. (2022). Research and Implementation of Threedimensional Multiple Bin-size Bin Packing Problem Based on Reinforcement Learning. [Ph.D. Thesis, Xidian Unversity]. (In Chinese)."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2864","DOI":"10.1109\/TCYB.2021.3121542","article-title":"Learning to Solve 3-D Bin Packing Problem via Deep Reinforcement Learning and Constraint Programming","volume":"53","author":"Jiang","year":"2023","journal-title":"IEEE Trans. Cybern."},{"key":"ref_16","first-page":"75","article-title":"Optimization Research of 3D Bin Packing Problem Based on Genetic Algorithm","volume":"50","author":"Jia","year":"2023","journal-title":"Metrol. Meas. Tech."},{"key":"ref_17","first-page":"32","article-title":"Study on hybrid genetic and simulated annealing algorithm for three-dimensional packing problems","volume":"55","author":"Zhang","year":"2019","journal-title":"Comput. Eng. Appl."},{"key":"ref_18","first-page":"211","article-title":"Three-Dimensional Container Loading Problem Based on Genetic Algorithm with Priority Retention Strategy","volume":"42","author":"Chen","year":"2021","journal-title":"Packag. Eng."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"2083","DOI":"10.1360\/jos182083","article-title":"A combinational heuristic algorithm for the threedimensional packing problem","volume":"18","author":"Zhang","year":"2007","journal-title":"J. Softw."},{"key":"ref_20","first-page":"1178","article-title":"A multi-level tree search algorithm for three dimensional container loading problem","volume":"46","author":"Liu","year":"2020","journal-title":"Acta Autom. Sin."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1016\/j.ins.2022.05.063","article-title":"A differential evolution algorithm with ternary search tree for solving the three-dimensional packing problem","volume":"606","author":"Huang","year":"2022","journal-title":"Inf. Sci."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1016\/j.cor.2010.09.002","article-title":"A novel hybrid tabu search approach to container loading","volume":"38","author":"Liu","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"ref_23","first-page":"255","article-title":"Dynamic Hybrid Strategy Optimization Algorithms for Container Loading Problem","volume":"59","author":"Gao","year":"2023","journal-title":"J. Comput. Eng. Appl."},{"key":"ref_24","first-page":"33","article-title":"Constrained-optimization in a 3D bin packing realistic problem","volume":"33","author":"Wahid","year":"2021","journal-title":"J. King Saud-Univ.-Comput. Inf. Sci."},{"key":"ref_25","first-page":"61","article-title":"Improvement grouping genetic algorithm for solving the bin packing problem","volume":"7","author":"Baatar","year":"2018","journal-title":"Int. J. Eng. Technol."},{"key":"ref_26","unstructured":"Trivedi, I.N., Pradeep, J., Narottam, J., Arvind, K., and Dilip, L. (2016, January 21\u201324). Genetic algorithm with random crossover and dynamic mutation on bin packing problem. Proceedings of the 2016 International Conference on Advances in Computing, Communications and Informatics (ICACCI), Jaipur, India."},{"key":"ref_27","first-page":"100750","article-title":"Building cross-platform application for optimized 3D bin packing algorithm","volume":"36","author":"Mao","year":"2022","journal-title":"Sustain. Comput. Inform. Syst."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0305-0483(95)00015-G","article-title":"Issues in the Development of Approaches to Container Loading","volume":"23","author":"Bischoff","year":"1995","journal-title":"Omega"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/16\/4\/449\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:24:26Z","timestamp":1760106266000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/16\/4\/449"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,7]]},"references-count":28,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2024,4]]}},"alternative-id":["sym16040449"],"URL":"https:\/\/doi.org\/10.3390\/sym16040449","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,7]]}}}