Abstract
The purpose of this paper is to introduce a new rich source of ideas and techniques that could be used to build new algorithms capable to solve numerous encountered optimisation problems in different fields of science and engineering. The art of war is one of the most rich disciplines in terms of already experimented strategies and tactics that can inspire researchers to design new powerful and efficient metaheuristics. The framework of the proposed method are inspired by the main war phases and contains seven components: initialization, intelligence, conception, suppression, advance, assault and exploitation. The basic fire and manoeuvre tactic is adopted in the suppression and advance phases. The proposed fire and manoeuvre algorithm (FMA) is a hybridization of a greedy algorithm with a multi-neighbouring search procedure. The developed algorithm has been employed to minimize makespan of the classical flow shop scheduling problem. A mathematical model is presented to describe the studied optimisation problem. Comparative experiments on Taillard’s data set confirmed that the (FMA) results are more accurate than already published data. A comparison between the FMA and other popular nature-inspired algorithms has been conducted. It was revealed that the proposed metaheuristic outperforms the classical genetic algorithm, the migrating birds optimisation and the whale optimisation algorithm.
Similar content being viewed by others
Data availability
The data used the support the findings of this study are available from the corresponding author upon request.
References
Alan A, Pritsker B, Waiters LJ, Wolfe PM (1969) Multiproject scheduling with limited resources: a zero-one programming approach. Manag Sci 16(1):93–108. https://doi.org/10.1287/mnsc.16.1.93
Ignall E, Schrage L (1965) Application of the branch and bound technique to some flow-shop scheduling problems. Oper Res 13(3):400–412. https://doi.org/10.1287/opre.13.3.400
Selmer MJ (1954) Optimal two-and three-stage production schedules with setup times included. Naval Res Log Quart 1(1):61–68. https://doi.org/10.1002/nav.3800010110
Xin-She Y (2012) Artificial intelligence, evolutionary computing and metaheuristics: in the footsteps of Alan Turing, volume 427. Springer
Fouad B, Rajib Kumar B (2020) Nature inspired methods for metaheuristics optimization: algorithms and applications in science and engineering: vol 16. Springer. https://doi.org/10.1007/978-3-030-26458-1
Samaher A-J, Ayad A (2022) A novel optimization algorithm (lion-ayad) to find optimal dna protein synthesis. Egypt Inform J 23(2):271–290. ISSN 1110-8665. https://doi.org/10.1016/j.eij.2022.01.004
Samaher A-J, Ayad A, Ehab A-, Aseel A, Mustafa M (2021) Intelligent forecaster of concentrations (pm2. 5, pm10, no2, co, o3, so2) caused air pollution (ifcsap). Neural Comput Appl 33(21):14199–14229. https://doi.org/10.1007/s00521-021-06067-7
Al-Janabi S, Alkaim AF, Adel Z (2020) An innovative synthesis of deep learning techniques (dcapsnet and dcom) for generation electrical renewable energy from wind energy. Soft Comput 24(14):10943–10962. https://doi.org/10.1007/s00500-020-04905-9
Al-Janabi S, Mohammad M, Al-Sultan A (2020) A new method for prediction of air pollution based on intelligent computation. Soft Comput 24(1):661–680. https://doi.org/10.1007/s00500-019-04495-1
Samaher A-J, Ahmed P, Hayder F, Kenan K, Ibrahim AS (2014)Empirical rapid and accurate prediction model for data mining tasks in cloud computing environments. In: 2014 International Congress on Technology, Communication and Knowledge (ICTCK), pages 1–8. https://doi.org/10.1109/ICTCK.2014.7033495
Muhammed AM, Samaher A-J (2020). A novel software to improve healthcare base on predictive analytics and mobile services for cloud data centers. In: Yousef Farhaoui, editor, Big Data and Networks Technologies, pages 320–339, Cham, . Springer International Publishing. https://doi.org/10.1007/978-3-030-23672-4_23
Samaher A-J, Mahdi Abed S, Maha M (2019)Pragmatic text mining method to find the topics of citation network. In: International Conference on Big Data and Networks Technologies, pages 190–205. Springer. https://doi.org/10.1007/978-3-030-23672-4_15
Jabrane B, Said A, Karam A (2020) Solving permutation flow shop scheduling problem with sequence-independent setup time. J Appl Math. https://doi.org/10.1155/2020/7132469
Allali K, Aqil S, Belabid J (2022) Distributed no-wait flow shop problem with sequence dependent setup time: Optimization of makespan and maximum tardiness. Simulat Model Pract Theory 116:102455. https://doi.org/10.1016/j.simpat.2021.102455
Framinan JM, Gupta JND, Leisten R (2004) A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. J Oper Res Soc 55(12):1243–1255. https://doi.org/10.1057/palgrave.jors.2601784
Ying K-C, Liao C-J (2004) An ant colony system for permutation flow-shop sequencing. Comput Oper Res 31(5):791–801. https://doi.org/10.1016/S0305-0548(03)00038-8
Alisantoso D, Khoo LP, Jiang PY (2003) An immune algorithm approach to the scheduling of a flexible pcb flow shop. Int J Adv Manuf Technol 22(11):819–827. https://doi.org/10.1007/s00170-002-1498-5
Komaki GM, Teymourian E, Kayvanfar V (2016) Minimising makespan in the two-stage assembly hybrid flow shop scheduling problem using artificial immune systems. Int J Prod Res 54(4):963–983. https://doi.org/10.1080/00207543.2015.1035815
Chakravorty A, Laha D (2017) A heuristically directed immune algorithm to minimize makespan and total flow time in permutation flow shops. Int J Adv Manuf Technol 93(9):3759–3776. https://doi.org/10.1007/s00170-017-0679-1
Reeves CR (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22(1):5–13. https://doi.org/10.1016/0305-0548(93)E0014-K
Wen-Jie X, He L-J, Zhu G-Y (2021) Many-objective flow shop scheduling optimisation with genetic algorithm based on fuzzy sets. Int J Prod Res 59(3):702–726. https://doi.org/10.1080/00207543.2019.1705418
Pan Q-K, Dong Y (2014) An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation. Inform Sci 277:643–655. https://doi.org/10.1016/j.ins.2014.02.152
Marichelvam MK (2012) An improved hybrid cuckoo search (ihcs) metaheuristics algorithm for permutation flow shop scheduling problems. Int J Bio Inspired Comput 4(4):200–205. https://doi.org/10.1504/IJBIC.2012.048061
Tosun Ö, Marichelvam MK (2016) Hybrid bat algorithm for flow shop scheduling problems. Int J Math Oper Res 9(1):125–138. https://doi.org/10.1504/IJMOR.2016.077560
Dian SW, Dana MU (2020) The hybrid ant lion optimization flow shop scheduling problem for minimizing completion time. J Phys Conf Ser 1569: 022097. IOP Publishing. https://doi.org/10.1088/1742-6596/1569/2/022097
Utama DM, Baroto T, Widodo DS (2020) Energy-efficient flow shop scheduling using hybrid grasshopper algorithm optimization. Jurnal Ilmiah Teknik Industri 19(1):30–38. https://doi.org/10.23917/jiti.v19i1.10079
Qi X, Yuan Z, Han X, Liu S (2020) A discrete butterfly-inspired optimization algorithm for solving permutation flow-shop scheduling problems. Neural Netw World 30(4):211. https://doi.org/10.14311/nnw.2020.30.015
Marichelvam MK, Azhagurajan A, Geetha M (2018) Minimisation of total tardiness in hybrid flowshop scheduling problems with sequence dependent setup times using a discrete firefly algorithm. Int J Oper Res 32(1):114–126. https://doi.org/10.1504/IJOR.2018.091204
Deb S, Tian Z, Fong S, Tang R, Wong R, Dey Nilanjan (2018) Solving permutation flow-shop scheduling problem by rhinoceros search algorithm. Soft Comput 22(18):6025–6034. https://doi.org/10.1007/s00500-018-3075-3
Zhu H, Qi X, Chen F, He X, Chen L, Zhang Z (2019) Quantum-inspired cuckoo co-search algorithm for no-wait flow shop scheduling. Appl Intell 49(2):791–803. https://doi.org/10.1007/s10489-018-1285-0
Guangchen W, Liang G, Xinyu L, Peigen L, Fatih Tasgetiren M (2020) Energy-efficient distributed permutation flow shop scheduling problem using a multi-objective whale swarm algorithm. Swarm Evolut Comput 57:100716. https://doi.org/10.1016/j.swevo.2020.100716
Marichelvam MK, Geetha M, Ömür T (2020) An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors—a case study. Comput Oper Rese 114:104812. https://doi.org/10.1016/j.cor.2019.104812
Shao Z, Pi D, Shao W (2020) Hybrid enhanced discrete fruit fly optimization algorithm for scheduling blocking flow-shop in distributed environment. Expert Syst Appl 145:113147. https://doi.org/10.1016/j.eswa.2019.113147
Li H, Li X, Gao L (2021) A discrete artificial bee colony algorithm for the distributed heterogeneous no-wait flowshop scheduling problem. Appl Soft Comput 100:106946. https://doi.org/10.1016/j.asoc.2020.106946
Yankai W, Shilong W, Dong L, Chunfeng S, Bo Y (2021) An improved multi-objective whale optimization algorithm for the hybrid flow shop scheduling problem considering device dynamic reconfiguration processes. Expert Syst Appl 174:114793. https://doi.org/10.1016/j.eswa.2021.114793
Ding J, Schulz S, Shen L, Buscher U, Lü Z (2021) Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization. Comput Oper Res 125:105088. https://doi.org/10.1016/j.cor.2020.105088
Tummala SLV, Ayyarao, NSSR, Rajvikram ME, Nishanth P, MR, Gaurav S, Baseem K, and Bilal A (2022) War strategy optimization algorithm: a new effective metaheuristic algorithm for global optimization. IEEE Access 10:25073–25105. https://doi.org/10.1109/ACCESS.2022.3153493
Ostwald M (1996) Peace and war in plato and aristotle. Scripta Classica Israelica 15:102–118
Tzu Sun (1971) The art of war, vol 361. Oxford University Press
Jomini A-He (2007) George Henry Mendell, and William Price Craighill. The art of war. ourier Corporation
Von Clausewitz C (2008) On war. Princeton University Press
Hart BHL (1991) Strategy. A Meridian book. Meridian
Douhet G, Harahan JP, Kohn RH, Ferrari D (2009) The command of the air. Fire ant books, University of Alabama Press
Jones JR (2004) William Billy Mitchell’s Air Power. University Press of the Pacific
Mahan AT(1918). The Influence of Sea Power Upon History, 1660–1783. American century series, S-10. Little, Brown
Valeriano B, Jensen B, Maness RC (2018) Cyber strategy: the evolving character of power and coercion. Oxford University Press
Van Wie Davis E (2021) Shadow Warfare: Cyberwar Policy in the United States, Russia and China. Security and Professional Intelligence Education Series. Rowman & Littlefield Publishers
Conway RW, Maxwell WL, Miller LW (2003) Theory of scheduling. Dover Books on Computer Science Series, Dover
Ronald LG, Eugene LL, Jan KL, Rinnooy Kan AHG (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Annals of discrete mathematics, volume 5, pages 287–326. Elsevier, https://doi.org/10.1016/S0167-5060(08)70356-X
Stafford EF (1988) On the development of a mixed-integer linear programming model for the flowshop sequencing problem. J Oper Res Soc 39(12):1163–1174. https://doi.org/10.1057/jors.1988.193
Šeda M (2007) Mathematical models of flow shop and job shop scheduling problems. Int J Appl Math Comput Sci 4(4):241–246. https://doi.org/10.5281/zenodo.1082307
Débora PR, Ernesto GB (2012) Mixed-integer programming models for flowshop scheduling problems minimizing the total earliness and tardiness. In: Just-in-Time systems, pages 91–105. Springer, 2012. https://doi.org/10.1007/978-1-4614-1123-9
Meng L, Zhang C, Ren Y, Zhang B, Lv C (2020) Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem. Comput Ind Eng 142:106347. https://doi.org/10.1016/j.cie.2020.106347
Genlin J (2004) Survey on genetic algorithm. Comput Appl Softw 2:69–73
Guilherme CS, Eduardo EOC, Walmir MC (2020) An artificial immune systems approach to case-based reasoning applied to fault detection and diagnosis. Expert Syst Appl 140:112906. https://doi.org/10.1016/j.eswa.2019.112906
Marco D, Luca MG (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evolut Comput 1(1):53–66. https://doi.org/10.1109/4235.585892
Emrah H (2020) Artificial bee colony: theory, literature review, and application in image segmentation. In: Recent Advances on Memetic Algorithms and its Applications in Image Processing, pages 47–67. Springer, 2020. https://doi.org/10.1007/978-981-15-1362-6_3
Kumar A, Kumar D, Jarial SK (2017) A review on artificial bee colony algorithms and their applications to data clustering. Cybern Inform Technol 17(3):3–28. https://doi.org/10.1515/cait-2017-0027
Murat A, Kemal P (2020) Binary particle swarm optimization (bpso) based channel selection in the eeg signals and its application to speller systems. J Artifi Intell Syst 2(1):27–37. https://doi.org/10.33969/AIS.2020.21003
Jeffrey OA, Absalom EE, Laith A (2022) Dwarf mongoose optimization algorithm. Computer Methods Appl Mech Eng 391:114570 . ISSN 0045-7825. https://doi.org/10.1016/j.cma.2022.114570
Laith A, Ali D, Seyedali M, Mohamed AE, Amir H (2021a) Gandomi. the arithmetic optimization algorithm. Comput Methods Appl Mecha Eng 376:113609. ISSN 0045-7825. https://doi.org/10.1016/j.cma.2020.113609
Laith A, Dalia Y, Mohamed AE, Ahmed AE, Mohammed AAA-G, Amir HG (2021b) Aquila optimizer: a novel meta-heuristic optimization algorithm. Comput Ind Eng 157:107250. ISSN 0360-8352. https://doi.org/10.1016/j.cie.2021.107250
Laith A, Mohamed AE, Putra S, Zong WG, Amir H (2022) Gandomi. reptile search algorithm (rsa): a nature-inspired meta-heuristic optimizer. Expert Syst Appl 191:116158. ISSN 0957-4174. https://doi.org/10.1016/j.eswa.2021.116158
Oyelade ON, Ezugwu AE-S, Mohamed TIA, Abualigah L (2022) Ebola optimization search algorithm: a new nature-inspired metaheuristic optimization algorithm. IEEE Access 10(16150–16177):2022. https://doi.org/10.1109/ACCESS.2022.3147821
Alatas B, Bingol H (2019) A physics based novel approach for travelling tournament problem: optics inspired optimization. Inform Technol Control 48(3):373–388. https://doi.org/10.5755/j01.itc.48.3.20627
Bilal A, Harun B (2020) Comparative assessment of light-based intelligent search and optimization algorithms. Light Eng 28(6). https://doi.org/10.33383/2019-029
McAndrew WJ (1987) Fire or movement? Canadian tactical doctrine, sicily-1943. Military Affairs 51(3):140–145. https://doi.org/10.2307/1987517
Akyol S, Alatas B (2017) Plant intelligence based metaheuristic optimization algorithms. Artif Intell Rev 47(4):417–462. https://doi.org/10.1007/s10462-016-9486-6
Wang H, Wang W, Sun H, Cui Z, Rahnamayan S, Zeng S (2017) A new cuckoo search algorithm with hybrid strategies for flow shop scheduling problems. Soft Comput 21(15):4297–4307. https://doi.org/10.1007/s00500-016-2062-9
Feo Thomas A, Resende Mauricio GC (1995) Greedy randomized adaptive search procedures. J Global Optim 6(2):109–133. https://doi.org/10.1007/BF01096763
Prabhaharan G, Shahul Hamid Khan B, Rakesh L (2006) Implementation of grasp in flow shop scheduling. Int J Adv Manuf Technol 30(11):1126–1131. https://doi.org/10.1007/s00170-005-0134-6
Nawaz M, Enscore Jr EE, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1):91–95. https://doi.org/10.1016/0305-0483(83)90088-9
Mauricio GCR, Celso CR (2010) Greedy randomized adaptive search procedures: Advances, hybridizations, and applications. In: Handbook of metaheuristics, pages 283–319. Springer. https://doi.org/10.1007/978-1-4419-1665-5_10
Pardalos Panos M , Tianbing Q, Mauricio GCR (1998) A greedy randomized adaptive search procedure for the feedback vertex set problem. J Combin Optim 2(4):399–412. https://doi.org/10.1023/A:1009736921890
Gevezes Theodoros, Pitsoulis Leonidas (2015) A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem. J Combin Optim 29(4):859–883. https://doi.org/10.1007/s10878-013-9622-z
Mauricio GC, Resende C, Ribeiro C (2019) Greedy randomized adaptive search procedures: Advances and extensions. In: Handbook of metaheuristics, pages 169–220. Springer, 2019. https://doi.org/10.1007/978-3-319-91086-4_6
Claudio Arroyo José Elias, de Souza Pereira Ana Amélia (2011) A grasp heuristic for the multi-objective permutation flowshop scheduling problem. Int J Adv Manuf Technol 55(5–8):741–753. https://doi.org/10.1007/s00170-010-3100-x
Shahul Hamid Khan B, Prabhaharan G, Asokan P (2007) A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness. Int J Comput Math 84(12):1731–1741. https://doi.org/10.1080/00207160701331376
Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evolut Comput 1(1):67–82. https://doi.org/10.1109/4235.585893
Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278–285. https://doi.org/10.1016/0377-2217(93)90182-M
Lian Z, Xingsheng G, Jiao B (2008) A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan. Chaos Solit Fract 35(5):851–861. https://doi.org/10.1016/j.chaos.2006.05.082
Zobolas GI, Tarantilis CD, Ioannou G (2009) Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Comput Oper Res 36(4):1249–1267. https://doi.org/10.1016/j.cor.2008.01.007 (ISSN 0305-0548)
Duman E, Uysal M, Alkaya AF (2012) Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem. Inform Sci 217:65–77. https://doi.org/10.1016/j.ins.2012.06.032
Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51–67. https://doi.org/10.1016/j.advengsoft.2016.01.008
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that there are no conflicts of interest regarding the publication of this paper.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Belabid, J. Fire and manoeuvrer optimizer for flow shop scheduling problems. Evol. Intel. 17, 977–991 (2024). https://doi.org/10.1007/s12065-022-00767-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12065-022-00767-2