Skip to main content
Top

2019 | OriginalPaper | Chapter

3. Swarm Intelligence-Based Methods

Authors : Nikolaos E. Karkalos, Angelos P. Markopoulos, J. Paulo Davim

Published in: Computational Methods for Application in Industry 4.0

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The term “Swarm Intelligence” refers directly to the collective behavior of a group of animals, which are following very basic rules, or to an Artificial Intelligence approach, which aims at the solution of a problem using algorithms based on collective behavior of social animals. For over three decades, several algorithms based on the observation of the behavior of groups of animals were developed, such as Particle Swarm Optimization, from the observation of flocks of birds. Some of the most established Swarm Intelligence (SI) methods include the Ant Colony Optimization method, the Harmony Search method and the Artificial Bee Colony algorithm.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
2.
go back to reference Kennedy J, Eberhart R (1995) Particle swarm optimization. In: IEEE international conference on neural networks, Perth, WA, Australia, pp 1942–1948 Kennedy J, Eberhart R (1995) Particle swarm optimization. In: IEEE international conference on neural networks, Perth, WA, Australia, pp 1942–1948
3.
go back to reference Khare A, Rangnekar S (2013) A review of particle swarm optimization and its applications in solar photovoltaic system. Appl Soft Comput 13:2997–3006CrossRef Khare A, Rangnekar S (2013) A review of particle swarm optimization and its applications in solar photovoltaic system. Appl Soft Comput 13:2997–3006CrossRef
4.
go back to reference Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization. Swarm Intell 1:33–57CrossRef Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization. Swarm Intell 1:33–57CrossRef
5.
go back to reference Fatih Tasgetiren M, Liang Y-C, Sevkli M, Gencyilmaz G (2006) Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem. Int J Prod Res 44:4737–4754CrossRef Fatih Tasgetiren M, Liang Y-C, Sevkli M, Gencyilmaz G (2006) Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem. Int J Prod Res 44:4737–4754CrossRef
6.
go back to reference Guo YW, Li WD, Mileham AR, Owen GW (2009) Optimisation of integrated process planning and scheduling using a particle swarm optimisation approach. Int J Prod Res 47:3775–3796CrossRef Guo YW, Li WD, Mileham AR, Owen GW (2009) Optimisation of integrated process planning and scheduling using a particle swarm optimisation approach. Int J Prod Res 47:3775–3796CrossRef
7.
go back to reference Tsai C-Y, Kao I-W (2011) Particle swarm optimization with selective particle regeneration for data clustering. Expert Syst Appl 38:6565–6576CrossRef Tsai C-Y, Kao I-W (2011) Particle swarm optimization with selective particle regeneration for data clustering. Expert Syst Appl 38:6565–6576CrossRef
8.
go back to reference Esmin AAA, Coelho RA, Matwin S (2015) A review on particle swarm optimization algorithm and its variants to clustering high-dimensional data. Artif Intell Rev 44:23–45CrossRef Esmin AAA, Coelho RA, Matwin S (2015) A review on particle swarm optimization algorithm and its variants to clustering high-dimensional data. Artif Intell Rev 44:23–45CrossRef
9.
go back to reference Zhang Y, Wang S, Ji G (2015) A comprehensive survey on particle swarm optimization algorithm and its applications. J Math Probl Eng 931256 Zhang Y, Wang S, Ji G (2015) A comprehensive survey on particle swarm optimization algorithm and its applications. J Math Probl Eng 931256
10.
go back to reference Wang YF, Zhang YF, Fuh JYH (2012) A hybrid particle swarm based method for process planning optimisation. Int J Prod Res 50:277–292CrossRef Wang YF, Zhang YF, Fuh JYH (2012) A hybrid particle swarm based method for process planning optimisation. Int J Prod Res 50:277–292CrossRef
11.
go back to reference Samarghandi H, ElMekkawy TY (2014) Solving the no-wait flow-shop problem with sequence-dependent set-up times. Int J Comput Integr Manuf 27:213–228CrossRef Samarghandi H, ElMekkawy TY (2014) Solving the no-wait flow-shop problem with sequence-dependent set-up times. Int J Comput Integr Manuf 27:213–228CrossRef
12.
go back to reference Attar SF, Mohammadi M, Tavakkoli-Moghaddam R, Yaghoubi S (2014) Solving a new multi-objective hybrid flexible flowshop problem with limited waiting times and machine-sequence-dependent set-up time constraints. Int J Comput Integr Manuf 27:450–469CrossRef Attar SF, Mohammadi M, Tavakkoli-Moghaddam R, Yaghoubi S (2014) Solving a new multi-objective hybrid flexible flowshop problem with limited waiting times and machine-sequence-dependent set-up time constraints. Int J Comput Integr Manuf 27:450–469CrossRef
13.
go back to reference Che ZH (2017) A multi-objective optimization algorithm for solving the supplier selection problem with assembly sequence planning and assembly line balancing. Comput Ind Eng 105:247–259CrossRef Che ZH (2017) A multi-objective optimization algorithm for solving the supplier selection problem with assembly sequence planning and assembly line balancing. Comput Ind Eng 105:247–259CrossRef
14.
go back to reference Keshtzari M, Naderi B, Mehdizadeh E (2016) An improved mathematical model and a hybrid metaheuristic for truck scheduling in cross-dock problems. Comput Ind Eng 91:197–204CrossRef Keshtzari M, Naderi B, Mehdizadeh E (2016) An improved mathematical model and a hybrid metaheuristic for truck scheduling in cross-dock problems. Comput Ind Eng 91:197–204CrossRef
15.
go back to reference Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Techical report tr-06, Erciyes Engineering Faculty, Kayseri Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Techical report tr-06, Erciyes Engineering Faculty, Kayseri
16.
go back to reference Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214:108–132MathSciNetMATH Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214:108–132MathSciNetMATH
17.
go back to reference Dunder E, Gumustekin S, Cengiz MA (2018) Variable selection in gamma regression models via artificial bee colony algorithm. J Appl Stat 45:8–16MathSciNetCrossRef Dunder E, Gumustekin S, Cengiz MA (2018) Variable selection in gamma regression models via artificial bee colony algorithm. J Appl Stat 45:8–16MathSciNetCrossRef
18.
go back to reference Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8:687–697CrossRef Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8:687–697CrossRef
19.
go back to reference Bulut O, Tasgetiren MF (2014) An artificial bee colony algorithm for the economic lot scheduling problem. Int J Prod Res 52:1150–1170CrossRef Bulut O, Tasgetiren MF (2014) An artificial bee colony algorithm for the economic lot scheduling problem. Int J Prod Res 52:1150–1170CrossRef
20.
go back to reference Li X, Yang G (2016) Artificial bee colony algorithm with memory. Appl Soft Comput 41:362–372CrossRef Li X, Yang G (2016) Artificial bee colony algorithm with memory. Appl Soft Comput 41:362–372CrossRef
21.
go back to reference Hemamalini S, Simon SP (2010) Artificial bee colony algorithm for economic load dispatch problem with non-smooth cost functions. Electr Power Components Syst 38:786–803CrossRef Hemamalini S, Simon SP (2010) Artificial bee colony algorithm for economic load dispatch problem with non-smooth cost functions. Electr Power Components Syst 38:786–803CrossRef
22.
go back to reference Lei D, Guo X (2013) Scheduling job shop with lot streaming and transportation through a modified artificial bee colony. Int J Prod Res 51:4930–4941MathSciNetCrossRef Lei D, Guo X (2013) Scheduling job shop with lot streaming and transportation through a modified artificial bee colony. Int J Prod Res 51:4930–4941MathSciNetCrossRef
23.
go back to reference Ng KKH, Lee CKM, Zhang SZ, Wu K, Ho W (2017) A multiple colonies artificial bee colony algorithm for a capacitated vehicle routing problem and re-routing strategies under time-dependent traffic congestion. Comput Ind Eng 109:151–168CrossRef Ng KKH, Lee CKM, Zhang SZ, Wu K, Ho W (2017) A multiple colonies artificial bee colony algorithm for a capacitated vehicle routing problem and re-routing strategies under time-dependent traffic congestion. Comput Ind Eng 109:151–168CrossRef
24.
go back to reference Yazdani M, Gohari S, Naderi B (2015) Multi-factory parallel machine problems: improved mathematical models and artificial bee colony algorithm. Comput Ind Eng 81:36–45CrossRef Yazdani M, Gohari S, Naderi B (2015) Multi-factory parallel machine problems: improved mathematical models and artificial bee colony algorithm. Comput Ind Eng 81:36–45CrossRef
25.
go back to reference Wang X, Xie X, Cheng TCE (2013) A modified artificial bee colony algorithm for order acceptance in two-machine flow shops. Int J Prod Econ 141:14–23CrossRef Wang X, Xie X, Cheng TCE (2013) A modified artificial bee colony algorithm for order acceptance in two-machine flow shops. Int J Prod Econ 141:14–23CrossRef
26.
go back to reference Zhang R, Song S, Wu C (2013) A hybrid artificial bee colony algorithm for the job shop scheduling problem. Int J Prod Econ 141:167–178CrossRef Zhang R, Song S, Wu C (2013) A hybrid artificial bee colony algorithm for the job shop scheduling problem. Int J Prod Econ 141:167–178CrossRef
27.
go back to reference Dorigo M (1992) Optimization, LEARNING AND NATURAL ALGorithms (in Italian). Dipartimento di Elettronica, Politecnico di Milano Dorigo M (1992) Optimization, LEARNING AND NATURAL ALGorithms (in Italian). Dipartimento di Elettronica, Politecnico di Milano
28.
go back to reference Osman H, Baki MF (2014) Balancing transfer lines using benders decomposition and ant colony optimisation techniques. Int J Prod Res 52:1334–1350CrossRef Osman H, Baki MF (2014) Balancing transfer lines using benders decomposition and ant colony optimisation techniques. Int J Prod Res 52:1334–1350CrossRef
29.
go back to reference Adubi SA, Misra S (2014) A comparative study on the ant colony optimization algorithms. In: 2014 11th international conference on electronics, computer and computation (ICECCO), Abuja, Nigeria, pp 1–4 Adubi SA, Misra S (2014) A comparative study on the ant colony optimization algorithms. In: 2014 11th international conference on electronics, computer and computation (ICECCO), Abuja, Nigeria, pp 1–4
30.
go back to reference Shyu SJ, Yin PY, Lin BMT, Haouari M (2003) Ant-tree: an ant colony optimization approach to the generalized minimum spanning tree problem. J Exp Theor Artif Intell 15:103–112CrossRef Shyu SJ, Yin PY, Lin BMT, Haouari M (2003) Ant-tree: an ant colony optimization approach to the generalized minimum spanning tree problem. J Exp Theor Artif Intell 15:103–112CrossRef
31.
go back to reference Cordon O, Herrera F, Stützle T (2003) A review on the ant colony optimization metaheuristic: basis, models and new trends. Mathware Soft Comput 9 (2–3) Cordon O, Herrera F, Stützle T (2003) A review on the ant colony optimization metaheuristic: basis, models and new trends. Mathware Soft Comput 9 (2–3)
32.
go back to reference Zecchin AC, Simpson AR, Maier HR, Leonard M, Roberts AJ, Berrisford MJ (2006) Application of two ant colony optimisation algorithms to water distribution system optimisation. Math Comput Model 44:451–468CrossRef Zecchin AC, Simpson AR, Maier HR, Leonard M, Roberts AJ, Berrisford MJ (2006) Application of two ant colony optimisation algorithms to water distribution system optimisation. Math Comput Model 44:451–468CrossRef
33.
go back to reference Wong TN, Zhang S, Wang G, Zhang L (2012) Integrated process planning and scheduling—multi-agent system with two-stage ant colony optimisation algorithm. Int J Prod Res 50:6188–6201CrossRef Wong TN, Zhang S, Wang G, Zhang L (2012) Integrated process planning and scheduling—multi-agent system with two-stage ant colony optimisation algorithm. Int J Prod Res 50:6188–6201CrossRef
34.
go back to reference Maniezzo V, Gambardella LM, de Luigi F (2004) Ant colony optimization. In: Onwubolu GC, Babu BV (eds) New optimization techniques in engineering. Springer, Berlin, pp 101–121CrossRef Maniezzo V, Gambardella LM, de Luigi F (2004) Ant colony optimization. In: Onwubolu GC, Babu BV (eds) New optimization techniques in engineering. Springer, Berlin, pp 101–121CrossRef
35.
go back to reference Blum C (2005) Ant colony optimization: introduction and recent trends. Phys Life Rev 2:353–373CrossRef Blum C (2005) Ant colony optimization: introduction and recent trends. Phys Life Rev 2:353–373CrossRef
36.
go back to reference Yakıcı E (2017) A heuristic approach for solving a rich min-max vehicle routing problem with mixed fleet and mixed demand. Comput Ind Eng 109:288–294CrossRef Yakıcı E (2017) A heuristic approach for solving a rich min-max vehicle routing problem with mixed fleet and mixed demand. Comput Ind Eng 109:288–294CrossRef
37.
go back to reference Seo M, Kim D (2010) Ant colony optimisation with parameterised search space for the job shop scheduling problem. Int J Prod Res 48:1143–1154CrossRef Seo M, Kim D (2010) Ant colony optimisation with parameterised search space for the job shop scheduling problem. Int J Prod Res 48:1143–1154CrossRef
38.
go back to reference Huang R-H (2010) Multi-objective job-shop scheduling with lot-splitting production. Int J Prod Econ 124:206–213CrossRef Huang R-H (2010) Multi-objective job-shop scheduling with lot-splitting production. Int J Prod Econ 124:206–213CrossRef
39.
go back to reference Chen H, Du B, Huang GQ (2010) Metaheuristics to minimise makespan on parallel batch processing machines with dynamic job arrivals. Int J Comput Integr Manuf 23:942–956CrossRef Chen H, Du B, Huang GQ (2010) Metaheuristics to minimise makespan on parallel batch processing machines with dynamic job arrivals. Int J Comput Integr Manuf 23:942–956CrossRef
40.
go back to reference Yagmahan B, Yenisey MM (2008) Ant colony optimization for multi-objective flow shop scheduling problem. Comput Ind Eng 54:411–420CrossRef Yagmahan B, Yenisey MM (2008) Ant colony optimization for multi-objective flow shop scheduling problem. Comput Ind Eng 54:411–420CrossRef
41.
go back to reference Moncayo-Martínez LA, Zhang DZ (2013) Optimising safety stock placement and lead time in an assembly supply chain using bi-objective MAX–MIN ant system. Int J Prod Econ 145:18–28CrossRef Moncayo-Martínez LA, Zhang DZ (2013) Optimising safety stock placement and lead time in an assembly supply chain using bi-objective MAX–MIN ant system. Int J Prod Econ 145:18–28CrossRef
42.
go back to reference Hosseini HS (2007) Problem solving by intelligent water drops. In: 2007 IEEE congress on evolutionary computation, Singapore, Singapore, pp 3226–3231 Hosseini HS (2007) Problem solving by intelligent water drops. In: 2007 IEEE congress on evolutionary computation, Singapore, Singapore, pp 3226–3231
43.
go back to reference Niu SH, Ong SK, Nee AYC (2012) An improved intelligent water drops algorithm for achieving optimal job-shop scheduling solutions. Int J Prod Res 50:4192–4205CrossRef Niu SH, Ong SK, Nee AYC (2012) An improved intelligent water drops algorithm for achieving optimal job-shop scheduling solutions. Int J Prod Res 50:4192–4205CrossRef
44.
go back to reference Hosseini HS (2009) The intelligent water drops algorithm, a nature inspired swarm based optimization algorithm. J Int J Bio-Inspired Comput 1:71–79CrossRef Hosseini HS (2009) The intelligent water drops algorithm, a nature inspired swarm based optimization algorithm. J Int J Bio-Inspired Comput 1:71–79CrossRef
45.
go back to reference Alijla BO, Wong L-P, Lim CP, Khader AT, Al-Betar MA (2014) A modified intelligent water drops algorithm and its application to optimization problems. Expert Syst Appl 41:6555–6569CrossRef Alijla BO, Wong L-P, Lim CP, Khader AT, Al-Betar MA (2014) A modified intelligent water drops algorithm and its application to optimization problems. Expert Syst Appl 41:6555–6569CrossRef
46.
go back to reference Niu SH, Ong SK, Nee AYC (2013) An improved intelligent water drops algorithm for solving multi-objective job shop scheduling. Eng Appl Artif Intell 26:2431–2442CrossRef Niu SH, Ong SK, Nee AYC (2013) An improved intelligent water drops algorithm for solving multi-objective job shop scheduling. Eng Appl Artif Intell 26:2431–2442CrossRef
47.
go back to reference Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76:60–68CrossRef Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76:60–68CrossRef
48.
go back to reference Yang X-S (2009) Harmony search as a metaheuristic algorithm. In: Geem ZW (ed) Music-inspired harmony search algorithm: theory and applications. Springer, Berlin, pp 1–14 Yang X-S (2009) Harmony search as a metaheuristic algorithm. In: Geem ZW (ed) Music-inspired harmony search algorithm: theory and applications. Springer, Berlin, pp 1–14
49.
go back to reference Wang X, Gao X-Z, Zenger K (2015) The overview of harmony search. In: Wang X, Gao X-Z, Zenger K (eds) An introduction to harmony search optimization method. Springer International Publishing, Cham, pp 5–11 Wang X, Gao X-Z, Zenger K (2015) The overview of harmony search. In: Wang X, Gao X-Z, Zenger K (eds) An introduction to harmony search optimization method. Springer International Publishing, Cham, pp 5–11
50.
go back to reference Gao XZ, Govindasamy V, Xu H, Wang X, Zenger K (2015) Harmony search method: theory and applications. Comput Intell Neurosci 258491 Gao XZ, Govindasamy V, Xu H, Wang X, Zenger K (2015) Harmony search method: theory and applications. Comput Intell Neurosci 258491
51.
go back to reference Mahdavi M, Fesanghary M, Damangir E (2007) An improved harmony search algorithm for solving optimization problems. Appl Math Comput 188:1567–1579MathSciNetMATH Mahdavi M, Fesanghary M, Damangir E (2007) An improved harmony search algorithm for solving optimization problems. Appl Math Comput 188:1567–1579MathSciNetMATH
52.
go back to reference Manjarres D, Landa-Torres I, Gil-Lopez S, Del Ser J, Bilbao MN, Salcedo-Sanz S, Geem ZW (2013) A survey on applications of the harmony search algorithm. Eng Appl Artif Intell 26:1818–1831CrossRef Manjarres D, Landa-Torres I, Gil-Lopez S, Del Ser J, Bilbao MN, Salcedo-Sanz S, Geem ZW (2013) A survey on applications of the harmony search algorithm. Eng Appl Artif Intell 26:1818–1831CrossRef
53.
go back to reference Purnomo HD, Wee H-M (2014) Maximizing production rate and workload balancing in a two-sided assembly line using harmony search. Comput Ind Eng 76:222–230CrossRef Purnomo HD, Wee H-M (2014) Maximizing production rate and workload balancing in a two-sided assembly line using harmony search. Comput Ind Eng 76:222–230CrossRef
54.
go back to reference Zammori F, Braglia M, Castellano D (2014) Harmony search algorithm for single-machine scheduling problem with planned maintenance. Comput Ind Eng 76:333–346CrossRef Zammori F, Braglia M, Castellano D (2014) Harmony search algorithm for single-machine scheduling problem with planned maintenance. Comput Ind Eng 76:333–346CrossRef
55.
go back to reference Alaei S, Setak M (2015) Multi objective coordination of a supply chain with routing and service level consideration. Int J Prod Econ 167:271–281CrossRef Alaei S, Setak M (2015) Multi objective coordination of a supply chain with routing and service level consideration. Int J Prod Econ 167:271–281CrossRef
56.
go back to reference Wong WK, Guo ZX (2010) A hybrid intelligent model for medium-term sales forecasting in fashion retail supply chains using extreme learning machine and harmony search algorithm. Int J Prod Econ 128:614–624CrossRef Wong WK, Guo ZX (2010) A hybrid intelligent model for medium-term sales forecasting in fashion retail supply chains using extreme learning machine and harmony search algorithm. Int J Prod Econ 128:614–624CrossRef
57.
go back to reference Vahedi Nouri B, Fattahi P, Ramezanian R (2013) Hybrid firefly-simulated annealing algorithm for the flow shop problem with learning effects and flexible maintenance activities. Int J Prod Res 51:3501–3515CrossRef Vahedi Nouri B, Fattahi P, Ramezanian R (2013) Hybrid firefly-simulated annealing algorithm for the flow shop problem with learning effects and flexible maintenance activities. Int J Prod Res 51:3501–3515CrossRef
58.
go back to reference Rohaninejad M, Kheirkhah AS, Vahedi Nouri B, Fattahi P (2015) Two hybrid tabu search–firefly algorithms for the capacitated job shop scheduling problem with sequence-dependent setup cost. Int J Comput Integr Manuf 28:470–487CrossRef Rohaninejad M, Kheirkhah AS, Vahedi Nouri B, Fattahi P (2015) Two hybrid tabu search–firefly algorithms for the capacitated job shop scheduling problem with sequence-dependent setup cost. Int J Comput Integr Manuf 28:470–487CrossRef
59.
go back to reference Yang X-S (2009) Firefly algorithms for multimodal optimization. In: Watanabe O, Zeugmann T (eds) Stochastic algorithms: foundations and applications. Springer, Berlin, pp 169–178CrossRef Yang X-S (2009) Firefly algorithms for multimodal optimization. In: Watanabe O, Zeugmann T (eds) Stochastic algorithms: foundations and applications. Springer, Berlin, pp 169–178CrossRef
60.
go back to reference Sayadi MK, Hafezalkotob A, Naini SGJ (2013) Firefly-inspired algorithm for discrete optimization problems: an application to manufacturing cell formation. J Manuf Syst 32:78–84CrossRef Sayadi MK, Hafezalkotob A, Naini SGJ (2013) Firefly-inspired algorithm for discrete optimization problems: an application to manufacturing cell formation. J Manuf Syst 32:78–84CrossRef
61.
go back to reference Yu S, Su S, Lu Q, Huang L (2014) A novel wise step strategy for firefly algorithm. Int J Comput Math 91:2507–2513MathSciNetCrossRef Yu S, Su S, Lu Q, Huang L (2014) A novel wise step strategy for firefly algorithm. Int J Comput Math 91:2507–2513MathSciNetCrossRef
62.
go back to reference Fister I, Fister I, Yang X-S, Brest J (2013) A comprehensive review of firefly algorithms. Swarm Evol Comput 13:34–46CrossRef Fister I, Fister I, Yang X-S, Brest J (2013) A comprehensive review of firefly algorithms. Swarm Evol Comput 13:34–46CrossRef
63.
go back to reference Hackl A, Magele C, Renhart W (2016) Extended firefly algorithm for multimodal optimization. In: 2016 19th international symposium on electrical apparatus and technologies (SIELA), Bourgas, Bulgaria, pp 1–4 Hackl A, Magele C, Renhart W (2016) Extended firefly algorithm for multimodal optimization. In: 2016 19th international symposium on electrical apparatus and technologies (SIELA), Bourgas, Bulgaria, pp 1–4
64.
go back to reference Gandomi AH, Yang X-S, Talatahari S, Alavi AH (2013) Firefly algorithm with chaos. Commun Nonlinear Sci Numer Simul 18:89–98MathSciNetCrossRef Gandomi AH, Yang X-S, Talatahari S, Alavi AH (2013) Firefly algorithm with chaos. Commun Nonlinear Sci Numer Simul 18:89–98MathSciNetCrossRef
65.
go back to reference Alinaghian M, Naderipour M (2016) A novel comprehensive macroscopic model for time-dependent vehicle routing problem with multi-alternative graph to reduce fuel consumption: a case study. Comput Ind Eng 99:210–222CrossRef Alinaghian M, Naderipour M (2016) A novel comprehensive macroscopic model for time-dependent vehicle routing problem with multi-alternative graph to reduce fuel consumption: a case study. Comput Ind Eng 99:210–222CrossRef
66.
go back to reference Madani-Isfahani M, Tavakkoli-Moghaddam R, Naderi B (2014) Multiple cross-docks scheduling using two meta-heuristic algorithms. Comput Ind Eng 74:129–138CrossRef Madani-Isfahani M, Tavakkoli-Moghaddam R, Naderi B (2014) Multiple cross-docks scheduling using two meta-heuristic algorithms. Comput Ind Eng 74:129–138CrossRef
67.
go back to reference Yang XS, Deb S (2009) Cuckoo search via levy flights. In: 2009 world congress on nature & biologically inspired computing (NaBIC), Coimbatore, India, pp 210–214 Yang XS, Deb S (2009) Cuckoo search via levy flights. In: 2009 world congress on nature & biologically inspired computing (NaBIC), Coimbatore, India, pp 210–214
68.
go back to reference Yildiz AR (2013) Cuckoo search algorithm for the selection of optimal machining parameters in milling operations. Int J Adv Manuf Technol 64:55–61CrossRef Yildiz AR (2013) Cuckoo search algorithm for the selection of optimal machining parameters in milling operations. Int J Adv Manuf Technol 64:55–61CrossRef
69.
go back to reference Bulatović RR, Đorđević SR, Đorđević VS (2013) Cuckoo search algorithm: a metaheuristic approach to solving the problem of optimum synthesis of a six-bar double dwell linkage. Mech Mach Theory 61:1–13CrossRef Bulatović RR, Đorđević SR, Đorđević VS (2013) Cuckoo search algorithm: a metaheuristic approach to solving the problem of optimum synthesis of a six-bar double dwell linkage. Mech Mach Theory 61:1–13CrossRef
70.
go back to reference Gandomi AH, Yang X-S, Alavi AH (2013) Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng Comput 29:17–35CrossRef Gandomi AH, Yang X-S, Alavi AH (2013) Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng Comput 29:17–35CrossRef
71.
go back to reference Mohamad AB, Zain AM, Nazira Bazin NE (2014) Cuckoo search algorithm for optimization problems—a literature review and its applications. Appl Artif Intell 28:419–448CrossRef Mohamad AB, Zain AM, Nazira Bazin NE (2014) Cuckoo search algorithm for optimization problems—a literature review and its applications. Appl Artif Intell 28:419–448CrossRef
72.
go back to reference Valian E, Tavakoli S, Mohanna S, Haghi A (2013) Improved cuckoo search for reliability optimization problems. Comput Ind Eng 64:459–468CrossRef Valian E, Tavakoli S, Mohanna S, Haghi A (2013) Improved cuckoo search for reliability optimization problems. Comput Ind Eng 64:459–468CrossRef
73.
go back to reference Kanagaraj G, Ponnambalam SG, Jawahar N (2013) A hybrid cuckoo search and genetic algorithm for reliability–redundancy allocation problems. Comput Ind Eng 66:1115–1124CrossRef Kanagaraj G, Ponnambalam SG, Jawahar N (2013) A hybrid cuckoo search and genetic algorithm for reliability–redundancy allocation problems. Comput Ind Eng 66:1115–1124CrossRef
74.
go back to reference Pan W-T (2012) A new fruit fly optimization algorithm: taking the financial distress model as an example. Knowl-Based Syst 26:69–74CrossRef Pan W-T (2012) A new fruit fly optimization algorithm: taking the financial distress model as an example. Knowl-Based Syst 26:69–74CrossRef
75.
go back to reference Xing B, Gao W-J (2016) Innovative computational intelligence: a rough guide to 134 clever algorithms. Springer International Publishing, SwitzerlandMATH Xing B, Gao W-J (2016) Innovative computational intelligence: a rough guide to 134 clever algorithms. Springer International Publishing, SwitzerlandMATH
76.
go back to reference Zheng X, Wang L (2016) A knowledge-guided fruit fly optimization algorithm for dual resource constrained flexible job-shop scheduling problem. Int J Prod Res 54:5554–5566CrossRef Zheng X, Wang L (2016) A knowledge-guided fruit fly optimization algorithm for dual resource constrained flexible job-shop scheduling problem. Int J Prod Res 54:5554–5566CrossRef
77.
go back to reference Mitić M, Vuković N, Petrović M, Miljković Z (2015) Chaotic fruit fly optimization algorithm. Knowl-Based Syst 89:446–458CrossRef Mitić M, Vuković N, Petrović M, Miljković Z (2015) Chaotic fruit fly optimization algorithm. Knowl-Based Syst 89:446–458CrossRef
78.
go back to reference Han Y, Gong D, Li J, Zhang Y (2016) Solving the blocking flow shop scheduling problem with makespan using a modified fruit fly optimisation algorithm. Int J Prod Res 54:6782–6797CrossRef Han Y, Gong D, Li J, Zhang Y (2016) Solving the blocking flow shop scheduling problem with makespan using a modified fruit fly optimisation algorithm. Int J Prod Res 54:6782–6797CrossRef
79.
go back to reference Oftadeh R, Mahjoob MJ (2009) A new meta-heuristic optimization algorithm: hunting search. In: 2009 fifth international conference on soft computing, computing with words and perceptions in system analysis, decision and control, Famagusta, Cyprus, pp 1–5 Oftadeh R, Mahjoob MJ (2009) A new meta-heuristic optimization algorithm: hunting search. In: 2009 fifth international conference on soft computing, computing with words and perceptions in system analysis, decision and control, Famagusta, Cyprus, pp 1–5
80.
go back to reference Oftadeh R, Mahjoob MJ, Shariatpanahi M (2010) A novel meta-heuristic optimization algorithm inspired by group hunting of animals: hunting search. Comput Math with Appl 60:2087–2098CrossRef Oftadeh R, Mahjoob MJ, Shariatpanahi M (2010) A novel meta-heuristic optimization algorithm inspired by group hunting of animals: hunting search. Comput Math with Appl 60:2087–2098CrossRef
81.
go back to reference Yazdani M, Naderi B, Mousakhani M (2015) a model and metaheuristic for truck scheduling in multi-door cross-dock problems. Intell Autom Soft Comput 21:633–644CrossRef Yazdani M, Naderi B, Mousakhani M (2015) a model and metaheuristic for truck scheduling in multi-door cross-dock problems. Intell Autom Soft Comput 21:633–644CrossRef
82.
go back to reference Bouzaida S, Sakly A, M’Sahli F (2014) Extracting TSK-type neuro-fuzzy model using the hunting search algorithm. Int J Gen Syst 43:32–43MathSciNetCrossRef Bouzaida S, Sakly A, M’Sahli F (2014) Extracting TSK-type neuro-fuzzy model using the hunting search algorithm. Int J Gen Syst 43:32–43MathSciNetCrossRef
83.
go back to reference Zare K, Hashemi SM (2012) A solution to transmission-constrained unit commitment using hunting search algorithm. In: 2012 11th international conference on environment and electrical engineering, Venice, Italy, pp 941–946 Zare K, Hashemi SM (2012) A solution to transmission-constrained unit commitment using hunting search algorithm. In: 2012 11th international conference on environment and electrical engineering, Venice, Italy, pp 941–946
84.
go back to reference Naderi B, Khalili M, Khamseh AA (2014) Mathematical models and a hunting search algorithm for the no-wait flowshop scheduling with parallel machines. Int J Prod Res 52:2667–2681CrossRef Naderi B, Khalili M, Khamseh AA (2014) Mathematical models and a hunting search algorithm for the no-wait flowshop scheduling with parallel machines. Int J Prod Res 52:2667–2681CrossRef
85.
go back to reference Dogan E (2014) Solving design optimization problems via hunting search algorithm with Levy flights. Struct Eng Mech 52(2):351–358CrossRef Dogan E (2014) Solving design optimization problems via hunting search algorithm with Levy flights. Struct Eng Mech 52(2):351–358CrossRef
86.
go back to reference Duman E, Uysal M, Alkaya AF (2012) Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem. Inf Sci 217:65–77MathSciNetCrossRef Duman E, Uysal M, Alkaya AF (2012) Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem. Inf Sci 217:65–77MathSciNetCrossRef
87.
go back to reference Tongur V, Ülker E (2016) The analysis of migrating birds optimization algorithm with neighborhood operator on traveling salesman problem. In: Lavangnananda K, Phon-Amnuaisuk S, Engchuan W, Chan JH (eds) Intelligent and evolutionary systems. Springer International Publishing, Cham, pp 227–237CrossRef Tongur V, Ülker E (2016) The analysis of migrating birds optimization algorithm with neighborhood operator on traveling salesman problem. In: Lavangnananda K, Phon-Amnuaisuk S, Engchuan W, Chan JH (eds) Intelligent and evolutionary systems. Springer International Publishing, Cham, pp 227–237CrossRef
88.
go back to reference Tongur V, Erkan Ü (2014) Migrating birds optimization for flow shop sequencing problem. J Comput Commun 2:142CrossRef Tongur V, Erkan Ü (2014) Migrating birds optimization for flow shop sequencing problem. J Comput Commun 2:142CrossRef
89.
go back to reference Gao KZ, Suganthan PN, Chua TJ (2013) An enhanced migrating birds optimization algorithm for no-wait flow shop scheduling problem. In: 2013 IEEE symposium on computational intelligence in scheduling (CISched), Singapore, Singapore, pp 9–13 Gao KZ, Suganthan PN, Chua TJ (2013) An enhanced migrating birds optimization algorithm for no-wait flow shop scheduling problem. In: 2013 IEEE symposium on computational intelligence in scheduling (CISched), Singapore, Singapore, pp 9–13
90.
go back to reference Soto R, Crawford B, Almonacid B, Paredes F (2016) Efficient parallel sorting for migrating birds optimization when solving machine-part cell formation problems. Sci Program 9402503 Soto R, Crawford B, Almonacid B, Paredes F (2016) Efficient parallel sorting for migrating birds optimization when solving machine-part cell formation problems. Sci Program 9402503
91.
go back to reference Alkaya AF, Algin R, Sahin Y, Agaoglu M, Aksakalli V (2014) Performance of migrating birds optimization algorithm on continuous functions. In: Tan Y, Shi Y, Coello CAC (eds) Advances in swarm intelligence. Springer International Publishing, Cham, pp 452–459 Alkaya AF, Algin R, Sahin Y, Agaoglu M, Aksakalli V (2014) Performance of migrating birds optimization algorithm on continuous functions. In: Tan Y, Shi Y, Coello CAC (eds) Advances in swarm intelligence. Springer International Publishing, Cham, pp 452–459
92.
go back to reference Benkalai I, Rebaine D, Gagné C, Baptiste P (2017) Improving the migrating birds optimization metaheuristic for the permutation flow shop with sequence-dependent set-up times. Int J Prod Res 55:6145–6157CrossRef Benkalai I, Rebaine D, Gagné C, Baptiste P (2017) Improving the migrating birds optimization metaheuristic for the permutation flow shop with sequence-dependent set-up times. Int J Prod Res 55:6145–6157CrossRef
93.
go back to reference Yang X-S (2012) Flower pollination algorithm for global optimization. In: Durand-Lose J, Jonoska N (eds) Unconventional computation and natural computation. Springer, Berlin, pp 240–249CrossRef Yang X-S (2012) Flower pollination algorithm for global optimization. In: Durand-Lose J, Jonoska N (eds) Unconventional computation and natural computation. Springer, Berlin, pp 240–249CrossRef
94.
go back to reference Zhang M, Pratap S, Huang GQ, Zhao Z (2017) Optimal collaborative transportation service trading in B2B e-commerce logistics. Int J Prod Res 55:5485–5501CrossRef Zhang M, Pratap S, Huang GQ, Zhao Z (2017) Optimal collaborative transportation service trading in B2B e-commerce logistics. Int J Prod Res 55:5485–5501CrossRef
95.
go back to reference Ibanez S (2012) Optimizing size thresholds in a plant-pollinator interaction web: towards a mechanistic understanding of ecological networks. Oecologia 170:233–242CrossRef Ibanez S (2012) Optimizing size thresholds in a plant-pollinator interaction web: towards a mechanistic understanding of ecological networks. Oecologia 170:233–242CrossRef
96.
go back to reference Nabil E (2016) A modified flower pollination algorithm for global optimization. Expert Syst Appl 57:192–203CrossRef Nabil E (2016) A modified flower pollination algorithm for global optimization. Expert Syst Appl 57:192–203CrossRef
97.
go back to reference Abdelaziz AY, Ali ES (2015) Static VAR compensator damping controller design based on flower pollination algorithm for a multi-machine power system. Electr Power Compon Syst 43:1268–1277CrossRef Abdelaziz AY, Ali ES (2015) Static VAR compensator damping controller design based on flower pollination algorithm for a multi-machine power system. Electr Power Compon Syst 43:1268–1277CrossRef
98.
go back to reference He X, Yang X-S, Karamanoglu M, Zhao Y (2017) Global convergence analysis of the flower pollination algorithm: a discrete-time Markov chain approach. Procedia Comput Sci 108:1354–1363CrossRef He X, Yang X-S, Karamanoglu M, Zhao Y (2017) Global convergence analysis of the flower pollination algorithm: a discrete-time Markov chain approach. Procedia Comput Sci 108:1354–1363CrossRef
99.
go back to reference Bozorgi A, Bozorg-Haddad O, Chu X (2018) Anarchic society optimization (ASO) algorithm. In: Bozorg-Haddad O (ed) Advanced optimization by nature-inspired algorithms. Springer Singapore, Singapore, pp 31–38 Bozorgi A, Bozorg-Haddad O, Chu X (2018) Anarchic society optimization (ASO) algorithm. In: Bozorg-Haddad O (ed) Advanced optimization by nature-inspired algorithms. Springer Singapore, Singapore, pp 31–38
100.
go back to reference Ahmadi-Javid A (2011) Anarchic society optimization: a human-inspired method. In: 2011 IEEE congress of evolutionary computation (CEC), New Orleans, LA, pp 2586–2592 Ahmadi-Javid A (2011) Anarchic society optimization: a human-inspired method. In: 2011 IEEE congress of evolutionary computation (CEC), New Orleans, LA, pp 2586–2592
101.
go back to reference Ahmadi-Javid A, Hooshangi-Tabrizi P (2015) A mathematical formulation and anarchic society optimisation algorithms for integrated scheduling of processing and transportation operations in a flow-shop environment. Int J Prod Res 53:5988–6006CrossRef Ahmadi-Javid A, Hooshangi-Tabrizi P (2015) A mathematical formulation and anarchic society optimisation algorithms for integrated scheduling of processing and transportation operations in a flow-shop environment. Int J Prod Res 53:5988–6006CrossRef
102.
go back to reference Bozorg-Haddad O, Latifi M, Bozorgi A, Rajabi M-M, Naeeni S-T, Loáiciga HA (2018) Development and application of the anarchic society algorithm (ASO) to the optimal operation of water distribution networks. Water Sci Technol Water Supply 18:318–332CrossRef Bozorg-Haddad O, Latifi M, Bozorgi A, Rajabi M-M, Naeeni S-T, Loáiciga HA (2018) Development and application of the anarchic society algorithm (ASO) to the optimal operation of water distribution networks. Water Sci Technol Water Supply 18:318–332CrossRef
103.
go back to reference Shayeghi H (2012) Anarchic society optimization based pid control of an automatic voltage regulator (AVR) system. Electr Electron Eng 2(4):199–207CrossRef Shayeghi H (2012) Anarchic society optimization based pid control of an automatic voltage regulator (AVR) system. Electr Electron Eng 2(4):199–207CrossRef
104.
go back to reference Ahmadi-Javid A, Hooshangi-Tabrizi P (2017) Integrating employee timetabling with scheduling of machines and transporters in a job-shop environment: a mathematical formulation and an anarchic society optimization algorithm. Comput Oper Res 84:73–91MathSciNetCrossRef Ahmadi-Javid A, Hooshangi-Tabrizi P (2017) Integrating employee timetabling with scheduling of machines and transporters in a job-shop environment: a mathematical formulation and an anarchic society optimization algorithm. Comput Oper Res 84:73–91MathSciNetCrossRef
Metadata
Title
Swarm Intelligence-Based Methods
Authors
Nikolaos E. Karkalos
Angelos P. Markopoulos
J. Paulo Davim
Copyright Year
2019
DOI
https://doi.org/10.1007/978-3-319-92393-2_3

Premium Partners