{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T14:29:48Z","timestamp":1725978588445},"publisher-location":"Cham","reference-count":104,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319923925"},{"type":"electronic","value":"9783319923932"}],"license":[{"start":{"date-parts":[[2018,5,22]],"date-time":"2018-05-22T00:00:00Z","timestamp":1526947200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-319-92393-2_3","type":"book-chapter","created":{"date-parts":[[2018,5,21]],"date-time":"2018-05-21T10:50:21Z","timestamp":1526899821000},"page":"33-55","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Swarm Intelligence-Based Methods"],"prefix":"10.1007","author":[{"given":"Nikolaos E.","family":"Karkalos","sequence":"first","affiliation":[]},{"given":"Angelos P.","family":"Markopoulos","sequence":"additional","affiliation":[]},{"given":"J. Paulo","family":"Davim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,22]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1111\/itor.12001","volume":"22","author":"K S\u00f6rensen","year":"2015","unstructured":"S\u00f6rensen K (2015) Metaheuristics\u2014the metaphor exposed. Int Trans Oper Res 22:3\u201318","journal-title":"Int Trans Oper Res"},{"doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: IEEE international conference on neural networks, Perth, WA, Australia, pp 1942\u20131948","key":"3_CR2","DOI":"10.1109\/ICNN.1995.488968"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"2997","DOI":"10.1016\/j.asoc.2012.11.033","volume":"13","author":"A Khare","year":"2013","unstructured":"Khare A, Rangnekar S (2013) A review of particle swarm optimization and its applications in solar photovoltaic system. Appl Soft Comput 13:2997\u20133006","journal-title":"Appl Soft Comput"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s11721-007-0002-0","volume":"1","author":"R Poli","year":"2007","unstructured":"Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization. Swarm Intell 1:33\u201357","journal-title":"Swarm Intell"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"4737","DOI":"10.1080\/00207540600620849","volume":"44","author":"M Fatih Tasgetiren","year":"2006","unstructured":"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\u20134754","journal-title":"Int J Prod Res"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"3775","DOI":"10.1080\/00207540701827905","volume":"47","author":"YW Guo","year":"2009","unstructured":"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\u20133796","journal-title":"Int J Prod Res"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"6565","DOI":"10.1016\/j.eswa.2010.11.082","volume":"38","author":"C-Y Tsai","year":"2011","unstructured":"Tsai C-Y, Kao I-W (2011) Particle swarm optimization with selective particle regeneration for data clustering. Expert Syst Appl 38:6565\u20136576","journal-title":"Expert Syst Appl"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10462-013-9400-4","volume":"44","author":"AAA Esmin","year":"2015","unstructured":"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\u201345","journal-title":"Artif Intell Rev"},{"doi-asserted-by":"crossref","unstructured":"Zhang Y, Wang S, Ji G (2015) A comprehensive survey on particle swarm optimization algorithm and its applications. J Math Probl Eng 931256","key":"3_CR9","DOI":"10.1155\/2015\/931256"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1080\/00207543.2011.571459","volume":"50","author":"YF Wang","year":"2012","unstructured":"Wang YF, Zhang YF, Fuh JYH (2012) A hybrid particle swarm based method for process planning optimisation. Int J Prod Res 50:277\u2013292","journal-title":"Int J Prod Res"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1080\/0951192X.2013.812802","volume":"27","author":"H Samarghandi","year":"2014","unstructured":"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\u2013228","journal-title":"Int J Comput Integr Manuf"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1080\/0951192X.2013.820348","volume":"27","author":"SF Attar","year":"2014","unstructured":"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\u2013469","journal-title":"Int J Comput Integr Manuf"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.cie.2016.12.036","volume":"105","author":"ZH Che","year":"2017","unstructured":"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\u2013259","journal-title":"Comput Ind Eng"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.cie.2015.11.006","volume":"91","author":"M Keshtzari","year":"2016","unstructured":"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\u2013204","journal-title":"Comput Ind Eng"},{"unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Techical report tr-06, Erciyes Engineering Faculty, Kayseri","key":"3_CR15"},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.amc.2009.03.090","volume":"214","author":"D Karaboga","year":"2009","unstructured":"Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214:108\u2013132","journal-title":"Appl Math Comput"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1080\/02664763.2016.1254730","volume":"45","author":"E Dunder","year":"2018","unstructured":"Dunder E, Gumustekin S, Cengiz MA (2018) Variable selection in gamma regression models via artificial bee colony algorithm. J Appl Stat 45:8\u201316","journal-title":"J Appl Stat"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboga","year":"2008","unstructured":"Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8:687\u2013697","journal-title":"Appl Soft Comput"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1080\/00207543.2013.845315","volume":"52","author":"O Bulut","year":"2014","unstructured":"Bulut O, Tasgetiren MF (2014) An artificial bee colony algorithm for the economic lot scheduling problem. Int J Prod Res 52:1150\u20131170","journal-title":"Int J Prod Res"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.asoc.2015.12.046","volume":"41","author":"X Li","year":"2016","unstructured":"Li X, Yang G (2016) Artificial bee colony algorithm with memory. Appl Soft Comput 41:362\u2013372","journal-title":"Appl Soft Comput"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1080\/15325000903489710","volume":"38","author":"S Hemamalini","year":"2010","unstructured":"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\u2013803","journal-title":"Electr Power Components Syst"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"4930","DOI":"10.1080\/00207543.2013.784404","volume":"51","author":"D Lei","year":"2013","unstructured":"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\u20134941","journal-title":"Int J Prod Res"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.cie.2017.05.004","volume":"109","author":"KKH Ng","year":"2017","unstructured":"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\u2013168","journal-title":"Comput Ind Eng"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.cie.2014.12.023","volume":"81","author":"M Yazdani","year":"2015","unstructured":"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\u201345","journal-title":"Comput Ind Eng"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ijpe.2012.06.003","volume":"141","author":"X Wang","year":"2013","unstructured":"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\u201323","journal-title":"Int J Prod Econ"},{"key":"3_CR26","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.ijpe.2012.03.035","volume":"141","author":"R Zhang","year":"2013","unstructured":"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\u2013178","journal-title":"Int J Prod Econ"},{"unstructured":"Dorigo M (1992) Optimization, LEARNING AND NATURAL ALGorithms (in Italian). Dipartimento di Elettronica, Politecnico di Milano","key":"3_CR27"},{"key":"3_CR28","doi-asserted-by":"publisher","first-page":"1334","DOI":"10.1080\/00207543.2013.842017","volume":"52","author":"H Osman","year":"2014","unstructured":"Osman H, Baki MF (2014) Balancing transfer lines using benders decomposition and ant colony optimisation techniques. Int J Prod Res 52:1334\u20131350","journal-title":"Int J Prod Res"},{"doi-asserted-by":"crossref","unstructured":"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\u20134","key":"3_CR29","DOI":"10.1109\/ICECCO.2014.6997567"},{"key":"3_CR30","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1080\/0952813021000032699","volume":"15","author":"SJ Shyu","year":"2003","unstructured":"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\u2013112","journal-title":"J Exp Theor Artif Intell"},{"unstructured":"Cordon O, Herrera F, St\u00fctzle T (2003) A review on the ant colony optimization metaheuristic: basis, models and new trends. Mathware Soft Comput 9 (2\u20133)","key":"3_CR31"},{"key":"3_CR32","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/j.mcm.2006.01.005","volume":"44","author":"AC Zecchin","year":"2006","unstructured":"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\u2013468","journal-title":"Math Comput Model"},{"key":"3_CR33","doi-asserted-by":"publisher","first-page":"6188","DOI":"10.1080\/00207543.2012.720393","volume":"50","author":"TN Wong","year":"2012","unstructured":"Wong TN, Zhang S, Wang G, Zhang L (2012) Integrated process planning and scheduling\u2014multi-agent system with two-stage ant colony optimisation algorithm. Int J Prod Res 50:6188\u20136201","journal-title":"Int J Prod Res"},{"key":"3_CR34","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-540-39930-8_5","volume-title":"New optimization techniques in engineering","author":"V Maniezzo","year":"2004","unstructured":"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\u2013121"},{"key":"3_CR35","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.plrev.2005.10.001","volume":"2","author":"C Blum","year":"2005","unstructured":"Blum C (2005) Ant colony optimization: introduction and recent trends. Phys Life Rev 2:353\u2013373","journal-title":"Phys Life Rev"},{"key":"3_CR36","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.cie.2017.05.001","volume":"109","author":"E Yak\u0131c\u0131","year":"2017","unstructured":"Yak\u0131c\u0131 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\u2013294","journal-title":"Comput Ind Eng"},{"key":"3_CR37","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1080\/00207540802538021","volume":"48","author":"M Seo","year":"2010","unstructured":"Seo M, Kim D (2010) Ant colony optimisation with parameterised search space for the job shop scheduling problem. Int J Prod Res 48:1143\u20131154","journal-title":"Int J Prod Res"},{"key":"3_CR38","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.ijpe.2009.10.026","volume":"124","author":"R-H Huang","year":"2010","unstructured":"Huang R-H (2010) Multi-objective job-shop scheduling with lot-splitting production. Int J Prod Econ 124:206\u2013213","journal-title":"Int J Prod Econ"},{"key":"3_CR39","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1080\/0951192X.2010.495137","volume":"23","author":"H Chen","year":"2010","unstructured":"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\u2013956","journal-title":"Int J Comput Integr Manuf"},{"key":"3_CR40","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/j.cie.2007.08.003","volume":"54","author":"B Yagmahan","year":"2008","unstructured":"Yagmahan B, Yenisey MM (2008) Ant colony optimization for multi-objective flow shop scheduling problem. Comput Ind Eng 54:411\u2013420","journal-title":"Comput Ind Eng"},{"key":"3_CR41","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ijpe.2012.12.024","volume":"145","author":"LA Moncayo-Mart\u00ednez","year":"2013","unstructured":"Moncayo-Mart\u00ednez LA, Zhang DZ (2013) Optimising safety stock placement and lead time in an assembly supply chain using bi-objective MAX\u2013MIN ant system. Int J Prod Econ 145:18\u201328","journal-title":"Int J Prod Econ"},{"doi-asserted-by":"crossref","unstructured":"Hosseini HS (2007) Problem solving by intelligent water drops. In: 2007 IEEE congress on evolutionary computation, Singapore, Singapore, pp 3226\u20133231","key":"3_CR42","DOI":"10.1109\/CEC.2007.4424885"},{"key":"3_CR43","doi-asserted-by":"publisher","first-page":"4192","DOI":"10.1080\/00207543.2011.600346","volume":"50","author":"SH Niu","year":"2012","unstructured":"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\u20134205","journal-title":"Int J Prod Res"},{"key":"3_CR44","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1504\/IJBIC.2009.022775","volume":"1","author":"HS Hosseini","year":"2009","unstructured":"Hosseini HS (2009) The intelligent water drops algorithm, a nature inspired swarm based optimization algorithm. J Int J Bio-Inspired Comput 1:71\u201379","journal-title":"J Int J Bio-Inspired Comput"},{"key":"3_CR45","doi-asserted-by":"publisher","first-page":"6555","DOI":"10.1016\/j.eswa.2014.05.010","volume":"41","author":"BO Alijla","year":"2014","unstructured":"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\u20136569","journal-title":"Expert Syst Appl"},{"key":"3_CR46","doi-asserted-by":"publisher","first-page":"2431","DOI":"10.1016\/j.engappai.2013.07.011","volume":"26","author":"SH Niu","year":"2013","unstructured":"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\u20132442","journal-title":"Eng Appl Artif Intell"},{"key":"3_CR47","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76:60\u201368","journal-title":"Simulation"},{"key":"3_CR48","first-page":"1","volume-title":"Music-inspired harmony search algorithm: theory and applications","author":"X-S Yang","year":"2009","unstructured":"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\u201314"},{"key":"3_CR49","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/978-3-319-08356-8_2","volume-title":"An introduction to harmony search optimization method","author":"X Wang","year":"2015","unstructured":"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\u201311"},{"doi-asserted-by":"crossref","unstructured":"Gao XZ, Govindasamy V, Xu H, Wang X, Zenger K (2015) Harmony search method: theory and applications. Comput Intell Neurosci 258491","key":"3_CR50","DOI":"10.1155\/2015\/258491"},{"key":"3_CR51","doi-asserted-by":"crossref","first-page":"1567","DOI":"10.1016\/j.amc.2006.11.033","volume":"188","author":"M Mahdavi","year":"2007","unstructured":"Mahdavi M, Fesanghary M, Damangir E (2007) An improved harmony search algorithm for solving optimization problems. Appl Math Comput 188:1567\u20131579","journal-title":"Appl Math Comput"},{"key":"3_CR52","doi-asserted-by":"publisher","first-page":"1818","DOI":"10.1016\/j.engappai.2013.05.008","volume":"26","author":"D Manjarres","year":"2013","unstructured":"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\u20131831","journal-title":"Eng Appl Artif Intell"},{"key":"3_CR53","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.cie.2014.07.010","volume":"76","author":"HD Purnomo","year":"2014","unstructured":"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\u2013230","journal-title":"Comput Ind Eng"},{"key":"3_CR54","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.cie.2014.08.001","volume":"76","author":"F Zammori","year":"2014","unstructured":"Zammori F, Braglia M, Castellano D (2014) Harmony search algorithm for single-machine scheduling problem with planned maintenance. Comput Ind Eng 76:333\u2013346","journal-title":"Comput Ind Eng"},{"key":"3_CR55","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.ijpe.2015.06.002","volume":"167","author":"S Alaei","year":"2015","unstructured":"Alaei S, Setak M (2015) Multi objective coordination of a supply chain with routing and service level consideration. Int J Prod Econ 167:271\u2013281","journal-title":"Int J Prod Econ"},{"key":"3_CR56","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/j.ijpe.2010.07.008","volume":"128","author":"WK Wong","year":"2010","unstructured":"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\u2013624","journal-title":"Int J Prod Econ"},{"key":"3_CR57","doi-asserted-by":"publisher","first-page":"3501","DOI":"10.1080\/00207543.2012.750771","volume":"51","author":"B Vahedi Nouri","year":"2013","unstructured":"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\u20133515","journal-title":"Int J Prod Res"},{"key":"3_CR58","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1080\/0951192X.2014.880808","volume":"28","author":"M Rohaninejad","year":"2015","unstructured":"Rohaninejad M, Kheirkhah AS, Vahedi Nouri B, Fattahi P (2015) Two hybrid tabu search\u2013firefly algorithms for the capacitated job shop scheduling problem with sequence-dependent setup cost. Int J Comput Integr Manuf 28:470\u2013487","journal-title":"Int J Comput Integr Manuf"},{"key":"3_CR59","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-04944-6_14","volume-title":"Stochastic algorithms: foundations and applications","author":"X-S Yang","year":"2009","unstructured":"Yang X-S (2009) Firefly algorithms for multimodal optimization. In: Watanabe O, Zeugmann T (eds) Stochastic algorithms: foundations and applications. Springer, Berlin, pp 169\u2013178"},{"key":"3_CR60","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.jmsy.2012.06.004","volume":"32","author":"MK Sayadi","year":"2013","unstructured":"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\u201384","journal-title":"J Manuf Syst"},{"key":"3_CR61","doi-asserted-by":"publisher","first-page":"2507","DOI":"10.1080\/00207160.2014.907405","volume":"91","author":"S Yu","year":"2014","unstructured":"Yu S, Su S, Lu Q, Huang L (2014) A novel wise step strategy for firefly algorithm. Int J Comput Math 91:2507\u20132513","journal-title":"Int J Comput Math"},{"key":"3_CR62","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.swevo.2013.06.001","volume":"13","author":"I Fister","year":"2013","unstructured":"Fister I, Fister I, Yang X-S, Brest J (2013) A comprehensive review of firefly algorithms. Swarm Evol Comput 13:34\u201346","journal-title":"Swarm Evol Comput"},{"doi-asserted-by":"crossref","unstructured":"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\u20134","key":"3_CR63","DOI":"10.1109\/SIELA.2016.7543010"},{"key":"3_CR64","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.cnsns.2012.06.009","volume":"18","author":"AH Gandomi","year":"2013","unstructured":"Gandomi AH, Yang X-S, Talatahari S, Alavi AH (2013) Firefly algorithm with chaos. Commun Nonlinear Sci Numer Simul 18:89\u201398","journal-title":"Commun Nonlinear Sci Numer Simul"},{"key":"3_CR65","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.cie.2016.07.029","volume":"99","author":"M Alinaghian","year":"2016","unstructured":"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\u2013222","journal-title":"Comput Ind Eng"},{"key":"3_CR66","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.cie.2014.05.009","volume":"74","author":"M Madani-Isfahani","year":"2014","unstructured":"Madani-Isfahani M, Tavakkoli-Moghaddam R, Naderi B (2014) Multiple cross-docks scheduling using two meta-heuristic algorithms. Comput Ind Eng 74:129\u2013138","journal-title":"Comput Ind Eng"},{"unstructured":"Yang XS, Deb S (2009) Cuckoo search via levy flights. In: 2009 world congress on nature & biologically inspired computing (NaBIC), Coimbatore, India, pp 210\u2013214","key":"3_CR67"},{"key":"3_CR68","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s00170-012-4013-7","volume":"64","author":"AR Yildiz","year":"2013","unstructured":"Yildiz AR (2013) Cuckoo search algorithm for the selection of optimal machining parameters in milling operations. Int J Adv Manuf Technol 64:55\u201361","journal-title":"Int J Adv Manuf Technol"},{"key":"3_CR69","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.mechmachtheory.2012.10.010","volume":"61","author":"RR Bulatovi\u0107","year":"2013","unstructured":"Bulatovi\u0107 RR, \u0110or\u0111evi\u0107 SR, \u0110or\u0111evi\u0107 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\u201313","journal-title":"Mech Mach Theory"},{"key":"3_CR70","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00366-011-0241-y","volume":"29","author":"AH Gandomi","year":"2013","unstructured":"Gandomi AH, Yang X-S, Alavi AH (2013) Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng Comput 29:17\u201335","journal-title":"Eng Comput"},{"key":"3_CR71","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1080\/08839514.2014.904599","volume":"28","author":"AB Mohamad","year":"2014","unstructured":"Mohamad AB, Zain AM, Nazira Bazin NE (2014) Cuckoo search algorithm for optimization problems\u2014a literature review and its applications. Appl Artif Intell 28:419\u2013448","journal-title":"Appl Artif Intell"},{"key":"3_CR72","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/j.cie.2012.07.011","volume":"64","author":"E Valian","year":"2013","unstructured":"Valian E, Tavakoli S, Mohanna S, Haghi A (2013) Improved cuckoo search for reliability optimization problems. Comput Ind Eng 64:459\u2013468","journal-title":"Comput Ind Eng"},{"key":"3_CR73","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1016\/j.cie.2013.08.003","volume":"66","author":"G Kanagaraj","year":"2013","unstructured":"Kanagaraj G, Ponnambalam SG, Jawahar N (2013) A hybrid cuckoo search and genetic algorithm for reliability\u2013redundancy allocation problems. Comput Ind Eng 66:1115\u20131124","journal-title":"Comput Ind Eng"},{"key":"3_CR74","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.knosys.2011.07.001","volume":"26","author":"W-T Pan","year":"2012","unstructured":"Pan W-T (2012) A new fruit fly optimization algorithm: taking the financial distress model as an example. Knowl-Based Syst 26:69\u201374","journal-title":"Knowl-Based Syst"},{"key":"3_CR75","volume-title":"Innovative computational intelligence: a rough guide to 134 clever algorithms","author":"B Xing","year":"2016","unstructured":"Xing B, Gao W-J (2016) Innovative computational intelligence: a rough guide to 134 clever algorithms. Springer International Publishing, Switzerland"},{"key":"3_CR76","doi-asserted-by":"publisher","first-page":"5554","DOI":"10.1080\/00207543.2016.1170226","volume":"54","author":"X Zheng","year":"2016","unstructured":"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\u20135566","journal-title":"Int J Prod Res"},{"key":"3_CR77","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.knosys.2015.08.010","volume":"89","author":"M Miti\u0107","year":"2015","unstructured":"Miti\u0107 M, Vukovi\u0107 N, Petrovi\u0107 M, Miljkovi\u0107 Z (2015) Chaotic fruit fly optimization algorithm. Knowl-Based Syst 89:446\u2013458","journal-title":"Knowl-Based Syst"},{"key":"3_CR78","doi-asserted-by":"publisher","first-page":"6782","DOI":"10.1080\/00207543.2016.1177671","volume":"54","author":"Y Han","year":"2016","unstructured":"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\u20136797","journal-title":"Int J Prod Res"},{"doi-asserted-by":"crossref","unstructured":"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\u20135","key":"3_CR79","DOI":"10.1109\/ICSCCW.2009.5379451"},{"key":"3_CR80","doi-asserted-by":"publisher","first-page":"2087","DOI":"10.1016\/j.camwa.2010.07.049","volume":"60","author":"R Oftadeh","year":"2010","unstructured":"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\u20132098","journal-title":"Comput Math with Appl"},{"key":"3_CR81","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1080\/10798587.2015.1014620","volume":"21","author":"M Yazdani","year":"2015","unstructured":"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\u2013644","journal-title":"Intell Autom Soft Comput"},{"key":"3_CR82","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1080\/03081079.2013.848355","volume":"43","author":"S Bouzaida","year":"2014","unstructured":"Bouzaida S, Sakly A, M\u2019Sahli F (2014) Extracting TSK-type neuro-fuzzy model using the hunting search algorithm. Int J Gen Syst 43:32\u201343","journal-title":"Int J Gen Syst"},{"doi-asserted-by":"crossref","unstructured":"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\u2013946","key":"3_CR83","DOI":"10.1109\/EEEIC.2012.6221512"},{"key":"3_CR84","doi-asserted-by":"publisher","first-page":"2667","DOI":"10.1080\/00207543.2013.871389","volume":"52","author":"B Naderi","year":"2014","unstructured":"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\u20132681","journal-title":"Int J Prod Res"},{"issue":"2","key":"3_CR85","doi-asserted-by":"publisher","first-page":"351","DOI":"10.12989\/sem.2014.52.2.351","volume":"52","author":"E Dogan","year":"2014","unstructured":"Dogan E (2014) Solving design optimization problems via hunting search algorithm with Levy flights. Struct Eng Mech 52(2):351\u2013358","journal-title":"Struct Eng Mech"},{"key":"3_CR86","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.ins.2012.06.032","volume":"217","author":"E Duman","year":"2012","unstructured":"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\u201377","journal-title":"Inf Sci"},{"key":"3_CR87","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-319-27000-5_19","volume-title":"Intelligent and evolutionary systems","author":"V Tongur","year":"2016","unstructured":"Tongur V, \u00dclker 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\u2013237"},{"key":"3_CR88","doi-asserted-by":"publisher","first-page":"142","DOI":"10.4236\/jcc.2014.24019","volume":"2","author":"V Tongur","year":"2014","unstructured":"Tongur V, Erkan \u00dc (2014) Migrating birds optimization for flow shop sequencing problem. J Comput Commun 2:142","journal-title":"J Comput Commun"},{"doi-asserted-by":"crossref","unstructured":"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\u201313","key":"3_CR89","DOI":"10.1109\/SCIS.2013.6613246"},{"doi-asserted-by":"crossref","unstructured":"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","key":"3_CR90","DOI":"10.1155\/2016\/9402503"},{"key":"3_CR91","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1007\/978-3-319-11897-0_51","volume-title":"Advances in swarm intelligence","author":"AF Alkaya","year":"2014","unstructured":"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\u2013459"},{"key":"3_CR92","doi-asserted-by":"publisher","first-page":"6145","DOI":"10.1080\/00207543.2017.1327732","volume":"55","author":"I Benkalai","year":"2017","unstructured":"Benkalai I, Rebaine D, Gagn\u00e9 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\u20136157","journal-title":"Int J Prod Res"},{"key":"3_CR93","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-32894-7_27","volume-title":"Unconventional computation and natural computation","author":"X-S Yang","year":"2012","unstructured":"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\u2013249"},{"key":"3_CR94","doi-asserted-by":"publisher","first-page":"5485","DOI":"10.1080\/00207543.2017.1322731","volume":"55","author":"M Zhang","year":"2017","unstructured":"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\u20135501","journal-title":"Int J Prod Res"},{"key":"3_CR95","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00442-012-2290-3","volume":"170","author":"S Ibanez","year":"2012","unstructured":"Ibanez S (2012) Optimizing size thresholds in a plant-pollinator interaction web: towards a mechanistic understanding of ecological networks. Oecologia 170:233\u2013242","journal-title":"Oecologia"},{"key":"3_CR96","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.eswa.2016.03.047","volume":"57","author":"E Nabil","year":"2016","unstructured":"Nabil E (2016) A modified flower pollination algorithm for global optimization. Expert Syst Appl 57:192\u2013203","journal-title":"Expert Syst Appl"},{"key":"3_CR97","doi-asserted-by":"publisher","first-page":"1268","DOI":"10.1080\/15325008.2015.1028116","volume":"43","author":"AY Abdelaziz","year":"2015","unstructured":"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\u20131277","journal-title":"Electr Power Compon Syst"},{"key":"3_CR98","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1016\/j.procs.2017.05.020","volume":"108","author":"X He","year":"2017","unstructured":"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\u20131363","journal-title":"Procedia Comput Sci"},{"key":"3_CR99","first-page":"31","volume-title":"Advanced optimization by nature-inspired algorithms","author":"A Bozorgi","year":"2018","unstructured":"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\u201338"},{"doi-asserted-by":"crossref","unstructured":"Ahmadi-Javid A (2011) Anarchic society optimization: a human-inspired method. In: 2011 IEEE congress of evolutionary computation (CEC), New Orleans, LA, pp 2586\u20132592","key":"3_CR100","DOI":"10.1109\/CEC.2011.5949940"},{"key":"3_CR101","doi-asserted-by":"publisher","first-page":"5988","DOI":"10.1080\/00207543.2015.1035812","volume":"53","author":"A Ahmadi-Javid","year":"2015","unstructured":"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\u20136006","journal-title":"Int J Prod Res"},{"key":"3_CR102","doi-asserted-by":"publisher","first-page":"318","DOI":"10.2166\/ws.2017.117","volume":"18","author":"O Bozorg-Haddad","year":"2018","unstructured":"Bozorg-Haddad O, Latifi M, Bozorgi A, Rajabi M-M, Naeeni S-T, Lo\u00e1iciga 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\u2013332","journal-title":"Water Sci Technol Water Supply"},{"issue":"4","key":"3_CR103","doi-asserted-by":"publisher","first-page":"199","DOI":"10.5923\/j.eee.20120204.05","volume":"2","author":"H Shayeghi","year":"2012","unstructured":"Shayeghi H (2012) Anarchic society optimization based pid control of an automatic voltage regulator (AVR) system. Electr Electron Eng 2(4):199\u2013207","journal-title":"Electr Electron Eng"},{"key":"3_CR104","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.cor.2016.11.017","volume":"84","author":"A Ahmadi-Javid","year":"2017","unstructured":"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\u201391","journal-title":"Comput Oper Res"}],"container-title":["SpringerBriefs in Applied Sciences and Technology","Computational Methods for Application in Industry 4.0"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92393-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T18:51:34Z","timestamp":1693680694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92393-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,22]]},"ISBN":["9783319923925","9783319923932"],"references-count":104,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92393-2_3","relation":{},"ISSN":["2191-530X","2191-5318"],"issn-type":[{"type":"print","value":"2191-530X"},{"type":"electronic","value":"2191-5318"}],"subject":[],"published":{"date-parts":[[2018,5,22]]}}}