{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T10:22:23Z","timestamp":1763202143677},"publisher-location":"Cham","reference-count":85,"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_2","type":"book-chapter","created":{"date-parts":[[2018,5,21]],"date-time":"2018-05-21T06:50:21Z","timestamp":1526885421000},"page":"11-31","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Evolutionary-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":"2_CR1","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1080\/00207540701523041","volume":"47","author":"R Rajkumar","year":"2009","unstructured":"Rajkumar R, Shahabudeen P (2009) An improved genetic algorithm for the flowshop scheduling problem. Int J Prod Res 47:233\u2013249","journal-title":"Int J Prod Res"},{"key":"2_CR2","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1090.001.0001","volume-title":"Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control and artificial intelligence","author":"JH Holland","year":"1992","unstructured":"Holland JH (1992) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control and artificial intelligence. MIT Press, Cambridge"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"7243","DOI":"10.1016\/j.eswa.2010.12.027","volume":"38","author":"L Wang","year":"2011","unstructured":"Wang L, Tang D (2011) An improved adaptive genetic algorithm based on hormone modulation mechanism for job-shop scheduling problem. Expert Syst Appl 38:7243\u20137250","journal-title":"Expert Syst Appl"},{"key":"2_CR4","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley Longman Publishing Co., Inc., Boston"},{"key":"2_CR5","first-page":"141","volume":"10","author":"E Cant\u00fa-Paz","year":"1998","unstructured":"Cant\u00fa-Paz E (1998) A survey of parallel genetic algorithms. Calc paralleles, Reseaux Syst Repartis 10:141\u2013171","journal-title":"Calc paralleles, Reseaux Syst Repartis"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.swevo.2011.03.001","volume":"1","author":"A Zhou","year":"2011","unstructured":"Zhou A, Qu B-Y, Li H, Zhao S-Z, Suganthan PN, Zhang Q (2011) Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evol Comput 1:32\u201349","journal-title":"Swarm Evol Comput"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s11740-011-0347-5","volume":"6","author":"B Denkena","year":"2012","unstructured":"Denkena B, Behrens B-A, Charlin F, Dannenberg M (2012) Integrative process chain optimization using a genetic algorithm. Prod Eng 6:29\u201337","journal-title":"Prod Eng"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1080\/0951192X.2015.1130247","volume":"29","author":"W-W Cui","year":"2016","unstructured":"Cui W-W, Lu Z, Zhou B, Li C, Han X (2016) A hybrid genetic algorithm for non-permutation flow shop scheduling problems with unavailability constraints. Int J Comput Integr Manuf 29:944\u2013961","journal-title":"Int J Comput Integr Manuf"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"890","DOI":"10.1080\/09511920902866104","volume":"22","author":"C-H Liu","year":"2009","unstructured":"Liu C-H (2009) Lot streaming for customer order scheduling problem in job shop environments. Int J Comput Integr Manuf 22:890\u2013907","journal-title":"Int J Comput Integr Manuf"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.cie.2017.05.007","volume":"109","author":"Y-B Woo","year":"2017","unstructured":"Woo Y-B, Jung S, Kim BS (2017) A rule-based genetic algorithm with an improvement heuristic for unrelated parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities. Comput Ind Eng 109:179\u2013190","journal-title":"Comput Ind Eng"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.cie.2017.02.010","volume":"106","author":"H-M Cho","year":"2017","unstructured":"Cho H-M, Jeong I-J (2017) A two-level method of production planning and scheduling for bi-objective reentrant hybrid flow shops. Comput Ind Eng 106:174\u2013181","journal-title":"Comput Ind Eng"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.ijpe.2014.04.011","volume":"154","author":"N Nahas","year":"2014","unstructured":"Nahas N, Nourelfath M, Gendreau M (2014) Selecting machines and buffers in unreliable assembly\/disassembly manufacturing networks. Int J Prod Econ 154:113\u2013126","journal-title":"Int J Prod Econ"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.ijpe.2014.12.004","volume":"164","author":"A Diabat","year":"2015","unstructured":"Diabat A, Al-Salem M (2015) An integrated supply chain problem with environmental considerations. Int J Prod Econ 164:330\u2013338","journal-title":"Int J Prod Econ"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"4083","DOI":"10.1080\/00207540500143199","volume":"43","author":"SS Chaudhry","year":"2005","unstructured":"Chaudhry SS, Luo W (2005) Application of genetic algorithms in production and operations management: a review. Int J Prod Res 43:4083\u20134101","journal-title":"Int J Prod Res"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"3955","DOI":"10.1080\/00207540310001626319","volume":"41","author":"H Aytug","year":"2003","unstructured":"Aytug H, Khouja M, Vergara FE (2003) Use of genetic algorithms to solve production and operations management problems: a review. Int J Prod Res 41:3955\u20134009","journal-title":"Int J Prod Res"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"5157","DOI":"10.1080\/00207540903117857","volume":"48","author":"OS Akg\u00fcnd\u00fcz","year":"2010","unstructured":"Akg\u00fcnd\u00fcz OS, Tunal\u0131 S (2010) An adaptive genetic algorithm approach for the mixed-model assembly line sequencing problem. Int J Prod Res 48:5157\u20135179","journal-title":"Int J Prod Res"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"7507","DOI":"10.1080\/00207540903490163","volume":"48","author":"H Huang","year":"2010","unstructured":"Huang H, Wang Z (2010) Solving coupled task assignment and capacity planning problems for a job shop by using a concurrent genetic algorithm. Int J Prod Res 48:7507\u20137522","journal-title":"Int J Prod Res"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"3097","DOI":"10.1080\/00207540701675833","volume":"47","author":"CFM Toledo","year":"2009","unstructured":"Toledo CFM, Fran\u00e7a PM, Morabito R, Kimms A (2009) Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem. Int J Prod Res 47:3097\u20133119","journal-title":"Int J Prod Res"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1080\/0305215X.2013.772601","volume":"46","author":"H Li","year":"2014","unstructured":"Li H, Fang L (2014) Co-evolutionary algorithm: an efficient approach for bilevel programming problems. Eng Optim 46:361\u2013376","journal-title":"Eng Optim"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1080\/16864360.2005.10738398","volume":"2","author":"K Maneeratana","year":"2005","unstructured":"Maneeratana K, Boonlong K, Chaiyaratana N (2005) Co-operative co-evolutionary genetic algorithms for multi-objective topology design. Comput Aided Des Appl 2:487\u2013496","journal-title":"Comput Aided Des Appl"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1080\/00207543.2016.1194538","volume":"55","author":"B Yu","year":"2017","unstructured":"Yu B, Zhao H, Xue D (2017) A multi-population co-evolutionary genetic programming approach for optimal mass customisation production. Int J Prod Res 55:621\u2013641","journal-title":"Int J Prod Res"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1080\/00207543.2011.653010","volume":"51","author":"N Shukla","year":"2013","unstructured":"Shukla N, Tiwari MK, Ceglarek D (2013) Genetic-algorithms-based algorithm portfolio for inventory routing problem with stochastic demand. Int J Prod Res 51:118\u2013137","journal-title":"Int J Prod Res"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"5039","DOI":"10.1080\/00207543.2013.784411","volume":"51","author":"I Kucukkoc","year":"2013","unstructured":"Kucukkoc I, Karaoglan AD, Yaman R (2013) Using response surface design to determine the optimal parameters of genetic algorithm and a case study. Int J Prod Res 51:5039\u20135054","journal-title":"Int J Prod Res"},{"key":"2_CR24","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11:341\u2013359","journal-title":"J Glob Optim"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"4683","DOI":"10.1080\/00207540903049407","volume":"48","author":"A Gnanavel Babu","year":"2010","unstructured":"Gnanavel Babu A, Jerald J, Noorul Haq A, Muthu Luxmi V, Vigneswaralu TP (2010) Scheduling of machines and automated guided vehicles in FMS using differential evolution. Int J Prod Res 48:4683\u20134699","journal-title":"Int J Prod Res"},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"3940","DOI":"10.1080\/00207543.2013.865091","volume":"52","author":"W Peng","year":"2014","unstructured":"Peng W, Huang M (2014) A critical chain project scheduling method based on a differential evolution algorithm. Int J Prod Res 52:3940\u20133949","journal-title":"Int J Prod Res"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10462-009-9137-2","volume":"33","author":"F Neri","year":"2010","unstructured":"Neri F, Tirronen V (2010) Recent advances in differential evolution: a survey and experimental analysis. Artif Intell Rev 33:61\u2013106","journal-title":"Artif Intell Rev"},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"2833","DOI":"10.1080\/00207540903473367","volume":"49","author":"A Nourmohammadi","year":"2011","unstructured":"Nourmohammadi A, Zandieh M (2011) Assembly line balancing by a new multi-objective differential evolution algorithm based on TOPSIS. Int J Prod Res 49:2833\u20132855","journal-title":"Int J Prod Res"},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"5714","DOI":"10.1080\/00207543.2014.910625","volume":"52","author":"H Chen","year":"2014","unstructured":"Chen H, Zhou S, Li X, Xu R (2014) A hybrid differential evolution algorithm for a two-stage flow shop on batch processing machines with arbitrary release times and blocking. Int J Prod Res 52:5714\u20135734","journal-title":"Int J Prod Res"},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"2757","DOI":"10.1080\/00207543.2011.588972","volume":"50","author":"W Wisittipanich","year":"2012","unstructured":"Wisittipanich W, Kachitvichyanukul V (2012) Two enhanced differential evolution algorithms for job shop scheduling problems. Int J Prod Res 50:2757\u20132773","journal-title":"Int J Prod Res"},{"key":"2_CR31","unstructured":"Moscato P, Cotta C (2006) A gentle introduction to memetic algorithms. In: Glover FKG (ed) Handbook of metaheuristics, 1st edn. Springer Science & Business Media, pp 105\u2013144"},{"key":"2_CR32","unstructured":"Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts\u2014towards memetic algorithms. Caltech Concurrent Computation Program, C3P Report 826"},{"key":"2_CR33","doi-asserted-by":"publisher","first-page":"3075","DOI":"10.1080\/00207543.2012.753165","volume":"51","author":"T Liu","year":"2013","unstructured":"Liu T, Jiang Z, Geng N (2013) A memetic algorithm with iterated local search for the capacitated arc routing problem. Int J Prod Res 51:3075\u20133084","journal-title":"Int J Prod Res"},{"key":"2_CR34","doi-asserted-by":"publisher","first-page":"1268","DOI":"10.1080\/00207721.2011.605966","volume":"43","author":"H Wang","year":"2012","unstructured":"Wang H, Yang S, Ip WH, Wang D (2012) A memetic particle swarm optimisation algorithm for dynamic multi-modal optimisation problems. Int J Syst Sci 43:1268\u20131283","journal-title":"Int J Syst Sci"},{"key":"2_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2011.11.003","volume":"2","author":"F Neri","year":"2012","unstructured":"Neri F, Cotta C (2012) Memetic algorithms and memetic computing optimization: a literature review. Swarm Evol Comput 2:1\u201314","journal-title":"Swarm Evol Comput"},{"key":"2_CR36","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.cie.2016.12.017","volume":"106","author":"Y Wang","year":"2017","unstructured":"Wang Y, Chen Y, Lin Y (2017) Memetic algorithm based on sequential variable neighborhood descent for the minmax multiple traveling salesman problem. Comput Ind Eng 106:105\u2013122","journal-title":"Comput Ind Eng"},{"key":"2_CR37","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1016\/j.cie.2011.01.003","volume":"60","author":"L Gao","year":"2011","unstructured":"Gao L, Zhang G, Zhang L, Li X (2011) An efficient memetic algorithm for solving the job shop scheduling problem. Comput Ind Eng 60:699\u2013705","journal-title":"Comput Ind Eng"},{"key":"2_CR38","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.ijpe.2010.07.012","volume":"143","author":"P Lacomme","year":"2013","unstructured":"Lacomme P, Larabi M, Tchernev N (2013) Job-shop based framework for simultaneous scheduling of machines and automated guided vehicles. Int J Prod Econ 143:24\u201334","journal-title":"Int J Prod Econ"},{"key":"2_CR39","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.ijpe.2012.06.009","volume":"141","author":"C-K Ting","year":"2013","unstructured":"Ting C-K, Liao X-L (2013) The selective pickup and delivery problem: formulation and a memetic algorithm. Int J Prod Econ 141:199\u2013211","journal-title":"Int J Prod Econ"},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: 2007 IEEE congress on evolutionary computation. Singapore, pp 4661\u20134667","DOI":"10.1109\/CEC.2007.4425083"},{"key":"2_CR41","doi-asserted-by":"publisher","first-page":"4326","DOI":"10.1080\/00207543.2011.622310","volume":"50","author":"K Lian","year":"2012","unstructured":"Lian K, Zhang C, Gao L, Li X (2012) Integrated process planning and scheduling using an imperialist competitive algorithm. Int J Prod Res 50:4326\u20134343","journal-title":"Int J Prod Res"},{"key":"2_CR42","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1080\/00207543.2013.848490","volume":"52","author":"H Seidgar","year":"2014","unstructured":"Seidgar H, Kiani M, Abedi M, Fazlollahtabar H (2014) An efficient imperialist competitive algorithm for scheduling in the two-stage assembly flow shop problem. Int J Prod Res 52:1240\u20131256","journal-title":"Int J Prod Res"},{"key":"2_CR43","doi-asserted-by":"publisher","first-page":"4797","DOI":"10.1080\/00207543.2013.774475","volume":"51","author":"M Yousefi","year":"2013","unstructured":"Yousefi M, Yusuff RM (2013) Minimising earliness and tardiness penalties in single machine scheduling against common due date using imperialist competitive algorithm. Int J Prod Res 51:4797\u20134804","journal-title":"Int J Prod Res"},{"key":"2_CR44","doi-asserted-by":"publisher","first-page":"1208","DOI":"10.1080\/0305215X.2014.958732","volume":"47","author":"A Afshar","year":"2015","unstructured":"Afshar A, Emami Skardi MJ, Masoumi F (2015) Optimizing water supply and hydropower reservoir operation rule curves: an imperialist competitive algorithm approach. Eng Optim 47:1208\u20131225","journal-title":"Eng Optim"},{"key":"2_CR45","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1016\/j.asoc.2014.08.024","volume":"24","author":"S Hosseini","year":"2014","unstructured":"Hosseini S, Al Khaled A (2014) A survey on the imperialist competitive algorithm metaheuristic: implementation in engineering domain and directions for future research. Appl Soft Comput 24:1078\u20131094","journal-title":"Appl Soft Comput"},{"key":"2_CR46","doi-asserted-by":"publisher","first-page":"4965","DOI":"10.1080\/00207543.2010.481644","volume":"49","author":"N Karimi","year":"2011","unstructured":"Karimi N, Zandieh M, Najafi AA (2011) Group scheduling in flexible flow shops: a hybridised approach of imperialist competitive algorithm and electromagnetic-like mechanism. Int J Prod Res 49:4965\u20134977","journal-title":"Int J Prod Res"},{"key":"2_CR47","doi-asserted-by":"publisher","first-page":"1823","DOI":"10.1080\/0305215X.2016.1141204","volume":"48","author":"N Bilel","year":"2016","unstructured":"Bilel N, Mohamed N, Zouhaier A, Lotfi R (2016) An improved imperialist competitive algorithm for multi-objective optimization. Eng Optim 48:1823\u20131844","journal-title":"Eng Optim"},{"key":"2_CR48","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1080\/0952813X.2012.682752","volume":"25","author":"N Moradinasab","year":"2013","unstructured":"Moradinasab N, Shafaei R, Rabiee M, Ramezani P (2013) No-wait two stage hybrid flow shop scheduling with genetic and adaptive imperialist competitive algorithms. J Exp Theor Artif Intell 25:207\u2013225","journal-title":"J Exp Theor Artif Intell"},{"key":"2_CR49","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1080\/0951192X.2012.684716","volume":"25","author":"J Behnamian","year":"2012","unstructured":"Behnamian J, Ghomi SMTF (2012) Incorporating transportation time in multi-agent production network scheduling. Int J Comput Integr Manuf 25:1111\u20131128","journal-title":"Int J Comput Integr Manuf"},{"key":"2_CR50","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1080\/0951192X.2016.1224388","volume":"30","author":"S Shirzadi","year":"2017","unstructured":"Shirzadi S, Tavakkoli-Moghaddam R, Kia R, Mohammadi M (2017) A multi-objective imperialist competitive algorithm for integrating intra-cell layout and processing route reliability in a cellular manufacturing system. Int J Comput Integr Manuf 30:839\u2013855","journal-title":"Int J Comput Integr Manuf"},{"key":"2_CR51","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1109\/TEVC.2008.919004","volume":"12","author":"D Simon","year":"2008","unstructured":"Simon D (2008) Biogeography-based optimization. IEEE Trans Evol Comput 12:702\u2013713","journal-title":"IEEE Trans Evol Comput"},{"key":"2_CR52","doi-asserted-by":"publisher","first-page":"4805","DOI":"10.1080\/00207543.2015.1094584","volume":"54","author":"J Lin","year":"2016","unstructured":"Lin J (2016) A hybrid discrete biogeography-based optimization for the permutation flow shop scheduling problem. Int J Prod Res 54:4805\u20134814","journal-title":"Int J Prod Res"},{"key":"2_CR53","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1080\/0951192X.2015.1130256","volume":"29","author":"M Rabiee","year":"2016","unstructured":"Rabiee M, Jolai F, Asefi H, Fattahi P, Lim S (2016) A biogeography-based optimisation algorithm for a realistic no-wait hybrid flow shop with unrelated parallel machines to minimise mean tardiness. Int J Comput Integr Manuf 29:1007\u20131024","journal-title":"Int J Comput Integr Manuf"},{"key":"2_CR54","doi-asserted-by":"publisher","first-page":"2690","DOI":"10.1080\/00207543.2014.975855","volume":"53","author":"S Paslar","year":"2015","unstructured":"Paslar S, Ariffin MKA, Tamjidy M, Hong TS (2015) Biogeography-based optimisation for flexible manufacturing system scheduling problem. Int J Prod Res 53:2690\u20132706","journal-title":"Int J Prod Res"},{"key":"2_CR55","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1080\/10426914.2011.610089","volume":"27","author":"R Mukherjee","year":"2012","unstructured":"Mukherjee R, Chakraborty S (2012) Selection of EDM process parameters using biogeography-based optimization algorithm. Mater Manuf Process 27:954\u2013962","journal-title":"Mater Manuf Process"},{"key":"2_CR56","doi-asserted-by":"publisher","first-page":"1880","DOI":"10.1080\/00207543.2014.965356","volume":"53","author":"M Tamjidy","year":"2015","unstructured":"Tamjidy M, Paslar S, Baharudin BTHT, Hong TS, Ariffin MKA (2015) Biogeography based optimization (BBO) algorithm to minimise non-productive time during hole-making process. Int J Prod Res 53:1880\u20131894","journal-title":"Int J Prod Res"},{"key":"2_CR57","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.cie.2016.05.005","volume":"97","author":"J Lin","year":"2016","unstructured":"Lin J, Zhang S (2016) An effective hybrid biogeography-based optimization algorithm for the distributed assembly permutation flow-shop scheduling problem. Comput Ind Eng 97:128\u2013136","journal-title":"Comput Ind Eng"},{"key":"2_CR58","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.cie.2015.03.008","volume":"85","author":"G-Q Yang","year":"2015","unstructured":"Yang G-Q, Liu Y-K, Yang K (2015) Multi-objective biogeography-based optimization for supply chain network design under uncertainty. Comput Ind Eng 85:145\u2013156","journal-title":"Comput Ind Eng"},{"key":"2_CR59","first-page":"303","volume":"43","author":"RV Rao","year":"2011","unstructured":"Rao RV, Savsani VJ, Vakharia DP (2011) Teaching\u2013learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Des 43:303\u2013315","journal-title":"Comput Des"},{"key":"2_CR60","doi-asserted-by":"publisher","first-page":"3622","DOI":"10.1080\/00207543.2015.1120900","volume":"54","author":"J Shen","year":"2016","unstructured":"Shen J, Wang L, Zheng H (2016) A modified teaching\u2013learning-based optimisation algorithm for bi-objective re-entrant hybrid flowshop scheduling. Int J Prod Res 54:3622\u20133639","journal-title":"Int J Prod Res"},{"key":"2_CR61","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22732-0","volume-title":"Teaching learning based optimization algorithm: and its engineering applications","author":"RV Rao","year":"2016","unstructured":"Rao RV (2016) Teaching learning based optimization algorithm: and its engineering applications. Springer International Publishing, Switzerland"},{"key":"2_CR62","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.ins.2012.05.009","volume":"212","author":"M \u010crepin\u0161ek","year":"2012","unstructured":"\u010crepin\u0161ek M, Liu S-H, Mernik L (2012) A note on teaching\u2013learning-based optimization algorithm. Inf Sci 212:79\u201393","journal-title":"Inf Sci"},{"key":"2_CR63","doi-asserted-by":"crossref","unstructured":"Zou F, Wang, L, Hei X, Chen D, Jiang Q, Li H (2014) Bare-bones teaching-learning-based optimization. Sci World J 136920","DOI":"10.1155\/2014\/136920"},{"key":"2_CR64","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1080\/00207543.2016.1203078","volume":"55","author":"W Zhang","year":"2017","unstructured":"Zhang W, Zhang S, Guo S, Yang Y, Chen Y (2017) Concurrent optimal allocation of distributed manufacturing resources using extended teaching-learning-based optimization. Int J Prod Res 55:718\u2013735","journal-title":"Int J Prod Res"},{"key":"2_CR65","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.cie.2014.06.006","volume":"74","author":"G Tuncel","year":"2014","unstructured":"Tuncel G, Aydin D (2014) Two-sided assembly line balancing using teaching\u2013learning based optimization algorithm. Comput Ind Eng 74:291\u2013299","journal-title":"Comput Ind Eng"},{"key":"2_CR66","doi-asserted-by":"crossref","unstructured":"Nara K, Takeyama T, Kim H (1999) A new evolutionary algorithm based on sheep flocks heredity model and its application to scheduling problem. In: 1999 IEEE international conference on systems, man, and cybernetics, Tokyo, Japan, pp 503\u2013508","DOI":"10.1109\/ICSMC.1999.816603"},{"key":"2_CR67","unstructured":"Kim H, Ahn B (2001) A new evolutionary algorithm based on sheep flocks heredity model. In: 2001 IEEE Pacific Rim conference on communications, computers and signal processing, Victoria, BC, Canada, pp 514\u2013517"},{"key":"2_CR68","doi-asserted-by":"publisher","first-page":"1509","DOI":"10.1080\/00207543.2013.848304","volume":"52","author":"GV Chakaravarthy","year":"2014","unstructured":"Chakaravarthy GV, Marimuthu S, Ponnambalam SG, Kanagaraj G (2014) Improved sheep flock heredity algorithm and artificial bee colony algorithm for scheduling m-machine flow shops lot streaming with equal size sub-lot problems. Int J Prod Res 52:1509\u20131527","journal-title":"Int J Prod Res"},{"issue":"4","key":"2_CR69","first-page":"749","volume":"2","author":"C Anandaraman","year":"2011","unstructured":"Anandaraman C (2011) An improved sheep flock heredity algorithm for job shop scheduling and flow shop scheduling problems. Int J Ind Eng Comput 2(4):749\u2013764","journal-title":"Int J Ind Eng Comput"},{"key":"2_CR70","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/03052150500384759","volume":"38","author":"M Eusuff","year":"2006","unstructured":"Eusuff M, Lansey K, Pasha F (2006) Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Eng Optim 38:129\u2013154","journal-title":"Eng Optim"},{"key":"2_CR71","doi-asserted-by":"publisher","first-page":"182","DOI":"10.3390\/w8050182","volume":"8","author":"D Mora-Melia","year":"2016","unstructured":"Mora-Melia D, Iglesias-Rey P, Mart\u00ednez-Solano F, Mu\u00f1oz-Velasco P (2016) The efficiency of setting parameters in a modified shuffled frog leaping algorithm applied to optimizing water distribution networks. Water 8:182","journal-title":"Water"},{"key":"2_CR72","first-page":"11","volume-title":"Advances in Intelligent Systems and Computing","author":"G. Giftson Samuel","year":"2014","unstructured":"Samuel GG, Rajan CCA (2014) A modified shuffled frog leaping algorithm for long-term generation maintenance scheduling. In: Pant M, Deep K, Nagar A, Bansal JC (eds) Proceedings of the third international conference on soft computing for problem solving, Springer India, New Delhi, pp 11\u201324"},{"key":"2_CR73","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.asoc.2014.02.010","volume":"19","author":"KK Bhattacharjee","year":"2014","unstructured":"Bhattacharjee KK, Sarmah SP (2014) Shuffled frog leaping algorithm and its application to 0\/1 knapsack problem. Appl Soft Comput 19:252\u2013263","journal-title":"Appl Soft Comput"},{"key":"2_CR74","doi-asserted-by":"crossref","unstructured":"Luo X, Yang Y, Li X (2008) Solving TSP with shuffled frog-leaping algorithm. In: 2008 eighth international conference on intelligent systems design and applications, Kaohsiung, Taiwan, pp 228\u2013232","DOI":"10.1109\/ISDA.2008.346"},{"key":"2_CR75","doi-asserted-by":"crossref","unstructured":"Wang L, Gong Y (2013) A fast shuffled frog leaping algorithm. In: 2013 ninth international conference on natural computation (ICNC), Shenyang, China, pp 369\u2013373","DOI":"10.1109\/ICNC.2013.6818003"},{"key":"2_CR76","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.cie.2017.03.018","volume":"107","author":"H Amirian","year":"2017","unstructured":"Amirian H, Sahraeian R (2017) Solving a grey project selection scheduling using a simulated shuffled frog leaping algorithm. Comput Ind Eng 107:141\u2013149","journal-title":"Comput Ind Eng"},{"key":"2_CR77","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.cie.2014.12.013","volume":"80","author":"B Tripathy","year":"2015","unstructured":"Tripathy B, Dash S, Padhy SK (2015) Multiprocessor scheduling and neural network training methods using shuffled frog-leaping algorithm. Comput Ind Eng 80:154\u2013158","journal-title":"Comput Ind Eng"},{"key":"2_CR78","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MCS.2002.1004010","volume":"22","author":"KM Passino","year":"2002","unstructured":"Passino KM (2002) Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Syst 22:52\u201367","journal-title":"IEEE Control Syst"},{"key":"2_CR79","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-01085-9_2","volume-title":"Foundations of Computational Intelligence Volume 3","author":"Swagatam Das","year":"2009","unstructured":"Das S, Biswas A, Dasgupta S, Abraham A (2009) Bacterial foraging optimization algorithm: theoretical foundations, analysis, and applications. In: Abraham A, Hassanien A-E, Siarry P, Engelbrecht A (eds) Foundations of computational intelligence volume 3: global optimization. Springer, Berlin, Heidelberg, pp 23\u201355"},{"key":"2_CR80","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1080\/00207543.2015.1113328","volume":"54","author":"C Liu","year":"2016","unstructured":"Liu C, Wang J, Leung JY-T, Li K (2016) Solving cell formation and task scheduling in cellular manufacturing system by discrete bacteria foraging algorithm. Int J Prod Res 54:923\u2013944","journal-title":"Int J Prod Res"},{"key":"2_CR81","unstructured":"Mu\u00f1oz MA, Halgamuge SK, Alfonso W, Caicedo EF (2010) Simplifying the bacteria foraging optimization algorithm. In: IEEE congress on evolutionary computation, Barcelona, Spain, pp 1\u20137"},{"key":"2_CR82","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1080\/0305215X.2013.776550","volume":"46","author":"A Kasaiezadeh","year":"2014","unstructured":"Kasaiezadeh A, Khajepour A, Waslander SL (2014) Spiral bacterial foraging optimization method: Algorithm, evaluation and convergence analysis. Eng Optim 46:439\u2013464","journal-title":"Eng Optim"},{"key":"2_CR83","first-page":"1106","volume":"28","author":"F Zhao","year":"2015","unstructured":"Zhao F, Jiang X, Zhang C, Wang J (2015) A chemotaxis-enhanced bacterial foraging algorithm and its application in job shop scheduling problem. Int J Comput Integr Manuf 28:1106\u20131121","journal-title":"Int J Comput Integr Manuf"},{"key":"2_CR84","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1080\/0951192X.2015.1130240","volume":"29","author":"F Zhao","year":"2016","unstructured":"Zhao F, Liu Y, Shao Z, Jiang X, Zhang C, Wang J (2016) A chaotic local search based bacterial foraging algorithm and its application to a permutation flow-shop scheduling problem. Int J Comput Integr Manuf 29:962\u2013981","journal-title":"Int J Comput Integr Manuf"},{"key":"2_CR85","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.biosystems.2010.03.003","volume":"100","author":"MS Li","year":"2010","unstructured":"Li MS, Ji TY, Tang WJ, Wu QH, Saunders JR (2010) Bacterial foraging algorithm with varying population. Biosystems 100:185\u2013197","journal-title":"Biosystems"}],"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_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T03:52:11Z","timestamp":1571370731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-92393-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,22]]},"ISBN":["9783319923925","9783319923932"],"references-count":85,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92393-2_2","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]]}}}