A dragonfly algorithm for solving the Fixed Charge Transportation Problem FCTP
DOI:
https://doi.org/10.56294/dm2024218Keywords:
Optimization, Dragonfly Algorithm, fixed charge transportation problem, NP-hard problemAbstract
The primary focus of this article is dedicated to a thorough investigation of the Fixed Load Transportation Problem (FCTP) and the proposition of an exceedingly efficient resolution method, with a specific emphasis on the achievement of optimal transportation plans within practical time constraints. The FCTP, recognized for its intricate nature, falls into the NP-complete category, notorious for its exponential growth in solution time as the problem's size escalates. Within the realm of combinatorial optimization, metaheuristic techniques like the Dragonfly algorithm and genetic algorithms have garnered substantial acclaim due to their remarkable capacity to deliver high-quality solutions to the challenging FCTP. These techniques demonstrate substantial potential in accelerating the resolution of this formidable problem. The central goal revolves around the exploration of groundbreaking solutions for the Fixed Load Transportation Problem, all while concurrently minimizing the time investment required to attain these optimal solutions. This undertaking necessitates the adept utilization of the Dragonfly algorithm, an algorithm inspired by natural processes, known for its adaptability and robustness in solving complex problems. The FCTP, functioning as an optimization problem, grapples with the multifaceted task of formulating distribution plans for products originating from multiple sources and destined for various endpoints. The overarching aspiration is to minimize overall transportation costs, a challenge that mandates meticulous considerations, including product availability at source locations and demand projections at destination points. The proposed methodology introduces an innovative approach tailored explicitly for addressing the Fixed Charge Transport Problem (FCTP) by harnessing the inherent capabilities of the Dragonfly algorithm. This adaptation of the algorithm's underlying processes is precisely engineered to handle large-scale FCTP instances, with the ultimate objective of unveiling solutions that have hitherto remained elusive. The numerical results stemming from our rigorous experiments unequivocally underscore the remarkable prowess of the Dragonfly algorithm in discovering novel and exceptionally efficient solutions. This demonstration unequivocally reaffirms its effectiveness in overcoming the inherent challenges posed by substantial FCTP instances. In summary, the research represents a significant leap forward in the domain of FCTP solution methodologies by seamlessly integrating the formidable capabilities of the Dragonfly algorithm into the problem-solving process. The insights and solutions presented in this article hold immense promise for significantly enhancing the efficiency and effectiveness of FCTP resolution, ultimately benefiting a broad spectrum of industries and logistics systems, and promising advancements in the optimization of transportation processes
References
1. CHASSEIN, André, GOERIGK, Marc, KASPERSKI, Adam, al. Approximating combinatorial optimization problems with the ordered weighted averaging criterion. European Journal of Operational Research, 2020, vol. 286, no 3, p. 828-838. DOI: https://doi.org/10.1016/j.ejor.2020.04.018
2. WEINAND, Jann Michael, SÖRENSEN, Kenneth, SAN SEGUNDO, Pablo, al. Research trends in combinatorial optimization. International Transactions in Operational Research, 2022, vol. 29, no 2, p. 667-705. DOI : https://doi.org/10.1111/itor.12996
3. Nicholson, C. D. and Zhang, W. Optimal network flow: A predictive analytics perspective on the fixed-charge network flow problem. Computers & Industrial Engineering, 2016, vol. 99, pp. 260-268. DOI: 10.1016/J.CIE.2016.07.030
4. Gottlieb, J. and Paulmann, L. Genetic algorithms for the fixed charge transportation problem. 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360), Anchorage, AK, USA, 1998, pp. 330-335. DOI: 10.1109/ICEC.1998.699754
5. Midya, S., Roy, S. K. and Yu, V. F. Intuitionistic fuzzy multi-stage multi-objective fixed-charge solid transportation problem in a green supply chain. International Journal of Machine Learning and Cybernetics, 2021, vol. 12, pp. 699-717. DOI: 10.1007/s13042-020-01197-1
6. Veena Adlakha, Krzysztof Kowalski, Benjamin Lev, A branching method for the fixed charge transportation problem, Omega, Volume 38, Issue 5, 2010, p. 393-397, https://doi.org/10.1016/j.omega.2009.10.005
7. Krzysztof Kowalski, Benjamin Lev, On step fixed-charge transportation problem, Omega, Volume 36, Issue 5, 2008, p. 913-917, ISSN 0305-0483, DOI: https://doi.org/10.1016/j.omega.2007.11.001.
8. JO, Jung-Bok, LI, Yinzhen, GEN, Mitsuo. Nonlinear fixed charge transportation problem by spanning tree-based genetic algorithm. Computers & Industrial Engineering, 2007, vol. 53, no 2, p. 290-298. DOI: https://doi.org/10.1016/j.cie.2007.06.022
9. Adlakha, V. and Kowalski, K. A simple heuristic for solving small fixed-charge transportation problems. Omega, 2003, vol. 31, iss. 3, pp. 205-211. DOI: 10.1016/S0305-0483(03)00025-2.
10. Ahmed Lahjouji El Idrissi; Chakir Tajani, Genetic algorithm with immigration strategy to solve the fixed charge transportation problem, Indonesian Journal of Electrical Engineering and Computer Sciencethis link is disabled, 2023, 31(1), pp. 313–320. DOI: 10.11591/ijeecs.v31.i1.pp313-320
11. Neskorodieva, T., Fedorov, E., Chychuzhko, M., et al. Metaheuristic method for searching quasi-optimal route based on the ant algorithm and annealing simulation. Radioelectronic and Computer Systems, 2022, no. 1, pp. 92-102. DOI: 10.32620/reks.2022.1.07
12. ABDULRAHMAN, Saman M. Using swarm intelligence for solving np-hard problems. Academic Journal of Nawroz University, 2017, vol. 6, no 3, p. 46-50. DOI: https://doi.org/10.25007/ajnu.v6n3a78
13. HONG, Jiangtao, DIABAT, Ali, PANICKER, Vinay V., et al. A two-stage supply chain problem with fixed costs: An ant colony optimization approach. International Journal of Production Economics, 2018, vol. 204, p. 214-226. DOI : https://doi.org/10.1016/j.ijpe.2018.07.019
14. JÜNGER, Michael, REINELT, Gerhard, et RINALDI, Giovanni. The traveling salesman problem. Handbooks in operations research and management science, 1995, vol. 7, p. 225-330. DOI : https://doi.org/10.1016/S0927-0507(05)80121-5
15. KONSTANTAKOPOULOS, Grigorios D., GAYIALIS, Sotiris P., et KECHAGIAS, Evripidis P. Vehicle routing problem and related algorithms for logistics distribution: A literature review and classification. Operational research, 2020, p. 1-30. DOI : https://doi.org/10.1007/s12351-020-00600-7
16. M. A. Al-Betar, al., “Natural selection methods for Grey Wolf Optimizer,” Expert Systems with Applications, vol. 113, pp. 481-498, 2018. https://doi.org/10.1016/j.eswa.2018.07.022
17. S. Mirjalili, “Dragonfly algorithm: a new meta- heuristic optimization technique for solving single-objective, discrete, and multi-objective problems,” Neural Computing and Applications, vol. 27, no. 4, pp. 1053-1073, 2016. DOI: https://doi.org/10.1007/s00521-015-1920-1
18. R. K. Sambandam, and S. Jayaraman, “Self- adaptive dragonfly based optimal thresholding for multilevel segmentation of digital images,” Journal of King Saud University - Computer and Information Sciences, 2016/11/10/, 2016. https://doi.org/10.1016/j.jksuci.2016.11.002
19. HAMMOURI, Abdelaziz I., MAFARJA, Majdi, AL-BETAR, Mohammed Azmi, al. An improved dragonfly algorithm for feature selection. Knowledge-Based Systems, 2020, vol. 203, p. 106131. DOI: https://doi.org/10.1016/j.knosys.2020.106131
20. MERAIHI, Yassine, RAMDANE-CHERIF, Amar, ACHELI, Dalila, al. Dragonfly algorithm: a comprehensive review and applications. Neural Computing and Applications, 2020, vol. 32, p. 16625-16646. DOI: https://doi.org/10.1007/s00521-020-04866-y
21. Mirjalili, S. Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput & Applic 27, p. 1053–1073 (2016). DOI: https://doi.org/10.1007/s00521-015-1920-1
22. Auza-Santiváñez JC, Díaz JAC, Cruz OAV, Robles-Nina SM, Escalante CS, Huanca BA. Bibliometric Analysis of the Worldwide Scholarly Output on Artificial Intelligence in Scopus. Gamification and Augmented Reality 2023;1:11–11. https://doi.org/10.56294/gr202311.
23. Castillo JIR. Aumented reality im surgery: improving precision and reducing ridk. Gamification and Augmented Reality 2023;1:15–15. https://doi.org/10.56294/gr202315.
24. Castillo-Gonzalez W, Lepez CO, Bonardi MC. Augmented reality and environmental education: strategy for greater awareness. Gamification and Augmented Reality 2023;1:10–10. https://doi.org/10.56294/gr202310.
25. Aveiro-Róbalo TR, Pérez-Del-Vallín V. Gamification for well-being: applications for health and fitness. Gamification and Augmented Reality 2023;1:16–16. https://doi.org/10.56294/gr202316.
26. MAFARJA, Majdi, HEIDARI, Ali Asghar, FARIS, Hossam, et al. Dragonfly algorithm: theory, literature review, and application in feature selection. Nature-Inspired Optimizers: Theories, Literature Reviews and Applications, 2020, p. 47-67. https://doi.org/10.1007/978-3-030-12127-3_4
27. Alshinwan, M., Abualigah, L., Shehab, M. et al. Dragonfly algorithm: a comprehensive survey of its results, variants, and applications. Multimed Tools Appl 80, 14979–15016 (2021). https://doi.org/10.1007/s11042-020-10255-3
28. KHADANGA, Rajendra Kumar, PADHY, Sasmita, PANDA, Sidhartha, et al. Design and analysis of tilt integral derivative controller for frequency control in an islanded microgrid: a novel hybrid dragonfly and pattern search algorithm approach. Arabian Journal for Science and Engineering, 2018, vol. 43, p. 3103-3114. DOI: https://doi.org/10.1007/s13369-018-3151-0
29. LOTFI, Mohammad Mahdi et TAVAKKOLI-MOGHADDAM, Reza. A genetic algorithm using priority-based encoding with new operators for fixed charge transportation problems. Applied Soft Computing, 2013, vol. 13, no 5, p. 2711-2726. DOI : https://doi.org/10.1016/j.asoc.2012.11.016
30. HAJIAGHAEI-KESHTELI Mostafa, MOLLA-ALIZADEH-ZAVARDEHI, S., et TAVAKKOLI-MOGHADDAM, Reza. Addressing a nonlinear fixed-charge transportation problem using a spanning tree-based genetic algorithm. Computers & Industrial Engineering, 2010, vol. 59, no 2, p. 259-271. DOI: https://doi.org/10.1016/j.cie.2010.04.007
Published
Issue
Section
License
Copyright (c) 2024 Ismail Ezzerrifi Amrani, Ahmed Lahjouji El Idrissi, Abdelkhalek Bahri, Ahmad El Allaoui (Author)
This work is licensed under a Creative Commons Attribution 4.0 International License.
The article is distributed under the Creative Commons Attribution 4.0 License. Unless otherwise stated, associated published material is distributed under the same licence.
