Abstract
Solving real world problems with large numbers of constraints and complex optimization functions is a challenging issue. For such problems, meta-heuristic algorithms are able to provide near optimal solutions. Shuffled Frog Leaping Algorithm(SFLA) is a population based meta-heuristic algorithm which employs the concept of population division for evolving the solutions over generations. To enhance the efficacy of SFLA for solving constrained optimization, this work presents Spectral Clustering based co-evolution technique. Spectral Clustering is a graph based clustering algorithm which is used to create memeplexes or partitioning of the population in SFLA. Proposed technique is able to improve the balance between the exploration and exploitation phase of SFLA. The performance of the proposed algorithm (SCSFLA) is evaluated over 24 real world constrained optimization problems. Success rate ratio ranking reveals that proposed Spectral clustering based SFLA (SCSFLA) technique outperforms existing Seed and distance based SFLA (SEEDSFLA), Random SFLA (RSFLA), conventional SFLA and Dynamic sub-swarm number strategy (DSFLA). SCSFLA also performs better than the well-known constrained optimization algorithms IUDE, MAgES, iLSHADE44 for 22 functions out of 24.
Similar content being viewed by others
Availability of data and material
Does not contain explicit data.
Code availability
On request.
References
Aggarwal CFA (1990) Synthesis of general distillation sequencesnonsharp separations. Comput Chem Eng 14:631–653
Andrei N, Andrei N (2013) Nonlinear optimization applications using the GAMS technology. Springer
Angira R, Babu B (2006) Optimization of process synthesis and design problems: A modified differential evolution approach. Chem Eng Sci 61:4707–4721
Babu RAB (2008) Optimization of industrial processes using improved and modified differential evolution. Soft Comput Appl Ind:1–22
Banati H, Mehta S (2013) Improved shuffled frog leaping algorithm for continuous optimisation adapted SEVO toolbox. Int J Adv Intell Paradig 5(1–2):31–44. https://doi.org/10.1504/IJAIP.2013.054670
Brazdil P, Soares C (2000) A comparison of ranking methods for classification algorithm selection. Mach Learn ECML 1810:63–75. https://doi.org/10.1007/3-540-45164-1_8
Cai J, Zhou R, Lei D (2020) Dynamic shuffled frog-leaping algorithm for distributed hybrid flow shop scheduling with multiprocessor tasks. Eng Appl Artif Intell 90:103540. https://doi.org/10.1016/j.engappai.2020.103540
Cai J, Lei D, Li M (2020) A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop. Int J Prod Res. https://doi.org/10.1080/00207543.2020.1780333
Chaudhary R, Banati H (2020) Study of population partitioning techniques on efficiency of swarm algorithms. Swarm Evol Comput 55:100672. https://doi.org/10.1016/j.swevo.2020.100672
Costa L, Oliveira P (2001) Evolutionary algorithms approach to the solution of mixed integer non-linear programming problems. Comput Chem Eng 25:257–266
Daoden K, Thaiupthump T (2016) A modified shuffled frog leaping algorithm using truncated Gaussian distribution in Frog’s position updating process
Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186(2–4):311–338. https://doi.org/10.1016/S0045-7825(99)00389-8
Del Ser J et al (2019) Bio-inspired computation: where we stand and what’s next. Swarm Evol Comput 48:220–250. https://doi.org/10.1016/j.swevo.2019.04.008
Ding W, Wang J (2013) A novel approach to minimum attribute reduction based on quantum-inspired self-adaptive cooperative co-evolution. Knowl Based Syst 50:1–13. https://doi.org/10.1016/j.knosys.2013.03.008
Duan QY, Gupta VK, Sorooshian S (1993) Shuffled complex evolution approach for effective and efficient global minimization. J Optim Theory Appl 76(3):501–521. https://doi.org/10.1007/BF00939380
Duan X, Niu T, Huang Q (2018) An improved shuffled frog leaping algorithm and its application in dynamic emergency vehicle dispatching. Math Probl Eng 2018. https://doi.org/10.1155/2018/7896926
Eusuff M, Lansey K, Pasha F (2006) Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Eng Optim 38(2):129–154. https://doi.org/10.1080/03052150500384759
Fan Z, Fang Y, Li W, Yuan Y, Wang Z, Bian X (2018) LSHADE44 with an improved constraint-handling method for solving constrained single-objective optimization problems. In: 2018 IEEE congress on evolutionary computation (CEC), pp 1–8. https://doi.org/10.1109/CEC.2018.8477943
Fay DL (1967) Migration policies in dynamic island models. Angew Chemie Int Ed 6(11), 951–952 18(1):163–179
Ferreira MP, Rocha ML, Silva Neto AJ, Sacco WF (2018) A constrained ITGO heuristic applied to engineering optimization. Expert Syst Appl 110:106–124. https://doi.org/10.1016/j.eswa.2018.05.027
Floudas CA (1995) Nonlinear and mixed-integer optimization:fundamentals and applications: fundamentals and applications
Floudas CA, Aggarwal A (1990) A decomposition strategy for global optimum search in the pooling problem. ORSA J Comput 2(3):225–235
Floudas CA, Pardalos PM (1990) A collection of test problems for constrained global optimization algorithms. Springer 455, no. Business Media
Guo Y, Tian X, Fang G, Xu YP (2020) Many-objective optimization with improved shuffled frog leaping algorithm for inter-basin water transfers. Adv Water Resour 138:103531. https://doi.org/10.1016/j.advwatres.2020.103531
Gupta D, Rani S, Ahmed SH, Verma S, Ijaz MF, Shafi J (2021) Edge caching based on collaborative filtering for heterogeneous ICN-IoT applications. Sensors. 21(16):5491. https://doi.org/10.3390/s21165491
He YZX (2018) Enhancing the performance of differential evolution with covariance matrix self-adaptation. Appl Soft Comput J 64:227–243
Hellwig M, Beyer H-G (2018) A matrix adaptation evolution strategy for constrained real-parameter optimization. In: 2018 IEEE congress on evolutionary computation (CEC), pp 1–8. https://doi.org/10.1109/CEC.2018.8477950
Jaballah S, Rouis K, Ben Abdallah F, Tahar JBH (2014) An improved shuffled frog leaping algorithm with a fast search strategy for optimization problems. https://doi.org/10.1109/ICCP.2014.6936975
Jaddi NS, Abdullah S, Hamdan AR (2015) Multi-population cooperative bat algorithm-based optimization of artificial neural network model. Inf Sci (NY) 294:628–644. https://doi.org/10.1016/j.ins.2014.08.050
Jadidoleslam M, Ebrahimi A (2015) Reliability constrained generation expansion planning by a modified shuffled frog leaping algorithm. Int J Electr Power Energy Syst 64:743–751. https://doi.org/10.1016/j.ijepes.2014.07.073
Karpagam M, Geetha K, Rajan C (2020) A modified shuffled frog leaping algorithm for scientific workflow scheduling using clustering techniques. Soft Comput 24(1):637–646. https://doi.org/10.1007/s00500-019-04484-4
Kashtiban AM, Ahandani MA (2009) Various strategies for partitioning of memeplexes in shuffled frog leaping algorithm. https://doi.org/10.1109/CSICC.2009.5349641
Kaur P, Mehta S (2017) Resource provisioning and work flow scheduling in clouds using augmented shuffled frog leaping algorithm. J Parallel Distrib Comput 101:41–50. https://doi.org/10.1016/j.jpdc.2016.11.003
Kordestani JK, Ranginkaman AE, Meybodi MR, Novoa-Hernández P (2019) A novel framework for improving multi-population algorithms for dynamic optimization problems: a scheduling approach. Swarm Evol Comput 44:788–805. https://doi.org/10.1016/j.swevo.2018.09.002
Kumar A, Wu G, Ali MZ, Mallipeddi R, Suganthan PN, Das S (2020) A test-suite of non-convex constrained optimization problems from the real-world and some baseline results. Swarm Evol Comput 56:100693. https://doi.org/10.1016/j.swevo.2020.100693
Lässig J, Sudholt D (2010) The benefit of migration in parallel evolutionary algorithms. https://doi.org/10.1145/1830483.1830687
Lei D, Wang T (2020) Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping. Eng Optim 52(9):1461–1474. https://doi.org/10.1080/0305215X.2019.1674295
Li X (2004) Adaptively choosing neighbourhood bests using species in a particle swarm optimizer for multimodal function optimization
Li C, Yang S (2012) A general framework of multipopulation methods with clustering in undetectable dynamic environments. IEEE Trans Evol Comput 16(4):556–577. https://doi.org/10.1109/TEVC.2011.2169966
Ma H, Shen S, Yu M, Yang Z, Fei M, Zhou H (2019) Multi-population techniques in nature inspired optimization algorithms: a comprehensive survey. Swarm Evol Comput 44:365–387. https://doi.org/10.1016/j.swevo.2018.04.011
Ma X, Bian Y, Gao F (2020) An improved shuffled frog leaping algorithm for multiload AGV dispatching in automated container terminals. Math Probl Eng 2020. https://doi.org/10.1155/2020/1260196
Mehta S, Banati H (2014) Context aware filtering using social behavior of frogs. Swarm Evol Comput 17:25–36. https://doi.org/10.1016/j.swevo.2014.02.003
Niknam T, Narimani MR, Jabbari M, Malekpour AR (2011) A modified shuffle frog leaping algorithm for multi-objective optimal power flow. Energy 36(11):6420–6432. https://doi.org/10.1016/j.energy.2011.09.027
Pant VSM, Thangaraj R (2009) Optimization of mechanical design problems using improved differential evolution algorithm. Int J Recent Trends Eng 1(21)
Parrott D, Li X (2006) Locating and tracking multiple dynamic optima by a particle swarm model using speciation. IEEE Trans Evol Comput 10(4):440–458. https://doi.org/10.1109/TEVC.2005.859468
Rani S, Koundal D, Kavita, Ijaz MF, Elhoseny M, Alghamdi MI (2021) An optimized framework for WSN routing in the context of industry 4.0. Sensors 21(19):6474. https://doi.org/10.3390/s21196474
Rao SS (2009) Engineering optimization: theory and practice. Wiley
Sauer CBR, Colville A (1995) Global optimization of nonconvex nlps and minlps with applications in process design. Comput Chem Eng Eng 19:551–566
Sauer R, Colville A, Burwick C (1964) Computer points way to more profits. Hydrocarb Process 84:2
Shadravan S, Naji H, Bardsiri VK (2019) The sailfish optimizer: a novel nature-inspired metaheuristic algorithm for solving constrained engineering optimization problems. Eng Appl Artif Intell 80:20–34
Shi J, Malik J Normalized cuts and image segmentation. https://doi.org/10.1109/CVPR.1997.609407
Siddall JN (1982) Optimal engineering design: principles and applications. CRC Press
Skolicki Z, De Jong K (2005) The influence of migration sizes and intervals on island models. https://doi.org/10.1145/1068009.1068219
Tang J, Zhang R, Wang P, Zhao Z, Fan L, Liu X (2020) A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks. Knowl Based Syst 187:104833. https://doi.org/10.1016/j.knosys.2019.07.004
Trivedi NBA, Srinivasan D (2018) An improved unified differential evolution algorithm for constrained optimization problems. In: 2018 528 IEEE Congress on Evolutionary Computation (CEC), 2018, pp 1–10
Wang L, Gong Y (2013) Quantum binary shuffled frog leaping algorithm. https://doi.org/10.1109/IMCCC.2013.366
Xia X, Gui L, Zhan ZH (2018) A multi-swarm particle swarm optimization algorithm based on dynamical topology and purposeful detecting. Appl Soft Comput J 67:126–140. https://doi.org/10.1016/j.asoc.2018.02.042
Yan Z, Wang J, Li G (2014) A collective neurodynamic optimization approach to bound-constrained nonconvex optimization. Neural Netw 55:20–29. https://doi.org/10.1016/j.neunet.2014.03.006
Yang X-S (2014) Swarm intelligence based algorithms: a critical analysi. Evol Intell 7(1):17–28. https://doi.org/10.1007/s12065-013-0102-2
Zhang J, Xiao M, Gao L, Pan Q (2018) Queuing search algorithm: a novel metaheuristic algorithm for solving engineering optimization problems. Appl Math Model 63:464–490. https://doi.org/10.1016/j.apm.2018.06.036
Author information
Authors and Affiliations
Contributions
All work is done by the author only.
Corresponding author
Ethics declarations
Conflicts of interest/competing interests
Not applicable.
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Annexure 1
Annexure 1
Symbol | Description |
---|---|
SC | Spectral Clustering |
SFLA | Shuffled Frog Leaping Algorithm |
SCSFLA | Shuffled Frog Leaping Algorithm with Spectral Clustering |
SEEDSFLA | Seed and distance based SFLA |
RSFLA | Random SFLA |
DSFLA | Dynamic sub-swarm number strategy based SFLA |
DNS | Dynamic sub-swarm number strategy |
IUDE | Improved Unified Differential Evolution Algorithm |
MAgES | Matrix Adaptation Evolution Strategy |
iLSHADE 44 | Improved Constraint-handling Method |
D | Dimension |
MaxFES | Maximum fitness function evaluations |
N | Population size |
m | Memeplex number |
Slb | local best solution |
Sw | local worst solution |
Sgb | global best solution |
Dmax | Max value for D |
Dmin | Min value for D |
Fw | Fitness of worst solution |
\( {\mathrm{F}}_{\mathrm{n}}^{\mathrm{w}} \) | New Fitness of worst solution |
M | Similarity/affinity matrix |
Dg | Diagonal Matrix |
L | Laplacian Matrix |
V | Matrix of largest eigen vectors |
C | Cluster |
K | Number of clusters |
SRR | Success Rate Ratio Ranks |
BFV | Best Fitness Values |
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
Mehta, S. Enhanced SFLA with spectral clustering based co-evolution for 24 constrained industrial optimization problems. Multimed Tools Appl 82, 17853–17878 (2023). https://doi.org/10.1007/s11042-022-13790-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11042-022-13790-3