A Study of New Gravitational Coefficient Function in Gravitational Search Algorithm for the One-dimensional Bin Packing Problem
Article Sidebar
Main Article Content
Abstract
The bin packaging problems cause many cost losses in logistics activities. Therefore, it is necessary to study appropriate solutions. This research aimed to study the New Gravitational Coefficient Function Performance in the Gravitational Search Algorithm (NGCFGSA) for one-dimensional bin packaging problems (1DBPP). This research begins to investigate such algorithms and optimize parameters that can solve a wide range of 1DBPP. In which the test is divided into 3 cases, (1) simple problem, (2) moderate problem, and (3) complex problem; in addition, a comparative test is performed with three algorithms, namely (1) the quantum evolution algorithm, (2) Particle Swarm Optimization, and (3) Gravitational Search Algorithm, to confirm the ability to solve problems. Results found that the NGCFGSA has high performance in searching for the answers of 1DBPP for simple and moderate cases and having answers close to the best solution compared with other algorithms. In the case of difficult 1DBPP, the NGCFGSA could not search optimization solutions better than other algorithms, and the answer was found at the local optimum. It can be concluded that the NGCFGSA is suitable for searching for simple and moderate problems and unimodal landscape function problems.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
The content and information in articles published in the Journal of Advanced Development in Engineering and Science are the opinions and responsibility of the article's author. The journal editors do not need to agree or share any responsibility.
Articles, information, content, etc. that are published in the Journal of Advanced Development in Engineering and Science are copyrighted by the Journal of Advanced Development in Engineering and Science. If any person or organization wishes to publish all or any part of it or to do anything. Only prior written permission from the Journal of Advanced Development in Engineering and Science is required.
References
Kondratjev, J. (2015). Logistics Transportation and Warehouse in Supply Chain, (Master thesis, Centria University of Applied Sciences).
Rushton, A., et al. (2014). The Handbook of Logistics and Distribution Management: Understanding the Supply Chain. London: Kogan Page.
Manyika, J., et al. (2017). A future that works: AI, automation, employment, and productivity. McKinsey Global Institute Research, 60, 1-135.
Wei, L., et al. (2020). A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems. INFORMS Journal on Computing, 32(2), 428-443.
Abdel-Basset, M., et al. (2018). An improved nature inspired meta-heuristic algorithm for 1-D bin packing problems. Personal and Ubiquitous Computing, 22(5-6), 1117-1132.
Hannenhalli, S. (1996). Polynomial-time algorithm for computing translocation distance between genomes. Discrete Applied Mathematics, 71(1-3), 137-151.
Alvim, A. C., et al. (2004). A hybrid improvement heuristic for the one-dimensional bin packing problem. Journal of Heuristics, 10(2), 205-229.
Delorme, M., et al. (2016). Bin packing and cutting stock problems: Mathematical models and exact algorithms. European Journal of Operational Research, 255(1), 1-20.
Duan, J., et al. (2022). A Data-Driven Column Generation Algorithm for Bin Packing Problem in Manufacturing Industry. Available from https://arxiv.org/pdf/2202.1246 6.pdf. Accessed date: 27 December 2022.
Davis, L. (1985). Applying adaptive algorithms to epistatic domains. In 9th International Joint Conferences on Artificial Intelligence Organization (p. 162-164). 18 – 23 August, 1985, Los Angeles, California, USA.
Lodi, A., et al. (2002). Two-dimensional packing problems: A survey. European Journal of Operational Research, 141(2), 241-252.
Dorigo, M. & Blum, C. (2005). Ant colony optimization theory: A survey. Theoretical Computer Science, 344(2-3), 243-278.
Srinivas, M. & Patnaik, L. M. (1994). Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Transactions on Systems, Man, and Cybernetics, 24(4), 656-667.
Rashedi, E., et al. (2009). GSA: a gravitational search algorithm. Information Sciences, 179(13), 2232-2248.
Tharawetcharak, P., et al. (2019). An improved gravitational coefficient function for enhancing gravitational search algorithm’s performance. International Journal of Machine Learning and Computing, 9(3), 261-266.
Sidhu, J. S., et al. (2007). The multifaceted nature of exploration and exploitation: Value of supply, demand, and spatial search for innovation. Organization Science, 18(1), 20-38.
Mansouri, R., et al. (1999). Effective time variation of G in a model universe with variable space dimension. Physics Letters A, 259(3-4), 194-200.
Scholl, A. & Klein, R. (2022). Bin Packing. Available from https://www2.wiwi.uni-jena.de/Entscheidung /binpp/bin1dat.htm. Accessed date: 01 Mar 2022.
Swain, B., et al. (2014). Quantum evolutionary algorithm for solving bin packing problem. International Journal of Engineering Science Invention, 3(8), 1-7.
Laurent, A. & Klement, N. (2019). Bin packing problem with priorities and incompatibilities using PSO: Application in a health care community. IFAC-PapersOnLine, 52(13), 2596-2601.