{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T02:12:02Z","timestamp":1769825522517,"version":"3.49.0"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031366215","type":"print"},{"value":"9783031366222","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-36622-2_16","type":"book-chapter","created":{"date-parts":[[2023,7,7]],"date-time":"2023-07-07T12:02:36Z","timestamp":1688731356000},"page":"195-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Competitive Learning and Dynamic Genetic Algorithms for Robust Layout Designs Under Uncertainties"],"prefix":"10.1007","author":[{"given":"Srisatja","family":"Vitayasak","sequence":"first","affiliation":[]},{"given":"Pupong","family":"Pongcharoen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,8]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/9780470496916","volume-title":"METAHEURISTICS from Design to Implementation","author":"EG Talbi","year":"2009","unstructured":"Talbi, E.G.: METAHEURISTICS from Design to Implementation. Wiley, Hoboken (2009)"},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Eiben, A.E., Michalewicz, Z., Schoenauer, M., Smith, J.E.: Parameter control in evolutionary algorithms. In: Lobo, F.G., Lima, C.F., Michalewicz, Z. (eds.) Parameter Setting in Evolutionary Algorithms. Studies in Computational Intelligence, vol. 54, pp. 19\u201346. Springer, Berlin (2007). https:\/\/doi.org\/10.1007\/978-3-540-69432-8_2","DOI":"10.1007\/978-3-540-69432-8_2"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/S0360-8352(02)00030-X","volume":"42","author":"EP Chew","year":"2002","unstructured":"Chew, E.P., Ong, C.J., Lim, K.H.: Variable period adaptive genetic algorithm. Comput. Ind. Eng. 42, 353\u2013360 (2002)","journal-title":"Comput. Ind. Eng."},{"key":"16_CR4","volume-title":"How to Solve It: Modern Heuristics","author":"Z Michalewicz","year":"2010","unstructured":"Michalewicz, Z., Fogel, D.V.: How to Solve It: Modern Heuristics. Springer, Cham (2010)"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.asoc.2006.03.001","volume":"7","author":"Z Bingul","year":"2007","unstructured":"Bingul, Z.: Adaptive genetic algorithms applied to dynamic multiobjective problems. Appl. Soft Comput. 7, 791\u2013799 (2007)","journal-title":"Appl. Soft Comput."},{"key":"16_CR6","first-page":"151","volume":"13","author":"R Matousek","year":"2022","unstructured":"Matousek, R., Dobrovsky, L., Kudela, J.: How to start a heuristic? Utilizing lower bounds for solving the quadratic assignment problem. Int. J. Ind. Eng. Comput. 13, 151\u2013164 (2022)","journal-title":"Int. J. Ind. Eng. Comput."},{"key":"16_CR7","first-page":"51","volume":"11","author":"AS Hameed","year":"2020","unstructured":"Hameed, A.S., Aboobaider, B.M., Mutar, M.L., Choon, N.H.: A new hybrid approach based on discrete differential evolution algorithm to enhancement solutions of quadratic assignment problem. Int. J. Ind. Eng. Comput. 11, 51\u201372 (2020)","journal-title":"Int. J. Ind. Eng. Comput."},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1504\/EJIE.2021.115172","volume":"15","author":"M Lashgari","year":"2021","unstructured":"Lashgari, M., Kia, R., Jolai, F.: Robust optimisation to design a dynamic cellular manufacturing system integrating group layout and workers\u2019 assignment. Eur. J. Ind. Eng. 15, 319\u2013351 (2021)","journal-title":"Eur. J. Ind. Eng."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"12","DOI":"10.2306\/scienceasia1513-1874.2022.S002","volume":"48","author":"S Sooncharoen","year":"2022","unstructured":"Sooncharoen, S., Vitayasak, S., Pongcharoen, P., Hicks, C.: Development of a modified biogeography-based optimisation tool for solving the unequal-sized machine and multi-row configuration facility layout design problem. ScienceAsia 48, 12\u201320 (2022)","journal-title":"ScienceAsia"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1504\/EJIE.2018.090619","volume":"12","author":"L Nagarajan","year":"2018","unstructured":"Nagarajan, L., Mahalingam, S.K., Gurusamy, S., Dharmaraj, V.K.: Solution for bi-objective single row facility layout problem using artificial bee colony algorithm. Eur. J. Ind. Eng. 12, 252\u2013275 (2018)","journal-title":"Eur. J. Ind. Eng."},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-44949-9_6","volume-title":"Multi-disciplinary Trends in Artificial Intelligence","author":"K Dapa","year":"2013","unstructured":"Dapa, K., Loreungthup, P., Vitayasak, S., Pongcharoen, P.: Bat algorithm, genetic algorithm and shuffled frog leaping algorithm for designing machine layout. In: Ramanna, S., Lingras, P., Sombattheera, C., Krishna, A. (eds.) MIWAI 2013. LNCS (LNAI), vol. 8271, pp. 59\u201368. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-44949-9_6"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"S2433","DOI":"10.1051\/ro\/2020127","volume":"55","author":"SS Hosseini","year":"2021","unstructured":"Hosseini, S.S., Azimi, P., Sharifi, M., Zandieh, M.: A new soft computing algorithm based on cloud theory for dynamic facility layout problem. RAIRO Oper. Res. 55, S2433\u2013S2453 (2021)","journal-title":"RAIRO Oper. Res."},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1080\/00207543.2022.2037778","volume":"61","author":"W Guo","year":"2023","unstructured":"Guo, W., Jiang, P., Yang, M.: Unequal area facility layout problem-solving: a real case study on an air-conditioner production shop floor. Int. J. Prod. Res. 61, 1479\u20131496 (2023)","journal-title":"Int. J. Prod. Res."},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"5633","DOI":"10.1080\/00207543.2021.1967500","volume":"60","author":"H Pourvaziri","year":"2022","unstructured":"Pourvaziri, H., Salimpour, S., Akhavan Niaki, S.T., Azab, A.: Robust facility layout design for flexible manufacturing: a doe-based heuristic. Int. J. Prod. Res. 60, 5633\u20135654 (2022)","journal-title":"Int. J. Prod. Res."},{"key":"16_CR15","first-page":"124","volume":"13","author":"TA El-Mihoub","year":"2006","unstructured":"El-Mihoub, T.A., Hopgood, A.A., Nolle, L., Battersby, A.: Hybrid genetic algorithms: a review. Eng. Lett. 13, 124\u2013137 (2006)","journal-title":"Eng. Lett."},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/j.ejor.2015.03.016","volume":"245","author":"B Keller","year":"2015","unstructured":"Keller, B., Buscher, U.: Single row layout models. Eur. J. Oper. Res. 245, 629\u2013644 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1016\/j.ijpe.2007.12.001","volume":"113","author":"MIM Wahab","year":"2008","unstructured":"Wahab, M.I.M., Stoyan, S.J.: A dynamic approach to measure machine and routing flexibilities of manufacturing systems. Int. J. Prod. Econ. 113, 895\u2013913 (2008)","journal-title":"Int. J. Prod. Econ."},{"key":"16_CR18","first-page":"453","volume":"10","author":"G La Scalia","year":"2019","unstructured":"La Scalia, G., Micale, R., Enea, M.: Facility layout problem: bibliometric and benchmarking analysis. Int. J. Ind. Eng. Comput. 10, 453\u2013472 (2019)","journal-title":"Int. J. Ind. Eng. Comput."},{"key":"16_CR19","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1504\/EJIE.2020.105720","volume":"14","author":"K Deep","year":"2020","unstructured":"Deep, K.: Machine cell formation for dynamic part population considering part operation trade-off and worker assignment using simulated annealing-based genetic algorithm. Eur. J. Ind. Eng. 14, 189\u2013216 (2020)","journal-title":"Eur. J. Ind. Eng."},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1016\/j.asoc.2012.02.002","volume":"12","author":"MS Alam","year":"2012","unstructured":"Alam, M.S., Islam, M.M., Yao, X., Murase, K.: Diversity guided evolutionary programming: a novel approach for continuous optimization. Appl. Soft Comput. 12, 1693\u20131707 (2012)","journal-title":"Appl. Soft Comput."},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"\u00c1E Eiben","year":"1999","unstructured":"Eiben, \u00c1.E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Trans. Evol. Comput. 3, 124\u2013141 (1999)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"16_CR22","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.jss.2014.11.035","volume":"103","author":"A Aleti","year":"2015","unstructured":"Aleti, A., Grunske, L.: Test data generation with a Kalman filter-based adaptive genetic algorithm. J. Syst. Softw. 103, 343\u2013352 (2015)","journal-title":"J. Syst. Softw."},{"key":"16_CR23","doi-asserted-by":"publisher","first-page":"345","DOI":"10.3233\/IFS-141310","volume":"28","author":"S Senthil Babu","year":"2015","unstructured":"Senthil Babu, S., Vinayagam, B.K.: Surface roughness prediction model using adaptive particle swarm optimization (APSO) algorithm. J. Intell. Fuzzy Syst. 28, 345\u2013360 (2015)","journal-title":"J. Intell. Fuzzy Syst."},{"key":"16_CR24","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0925-5273(03)00027-6","volume":"86","author":"JD Balakrishnan","year":"2003","unstructured":"Balakrishnan, J.D., Cheng, C.H., Conway, D.G., Lau, C.M.: A hybrid genetic algorithm for the dynamic plant layout problem. Int. J. Prod. Econ. 86, 107\u2013120 (2003)","journal-title":"Int. J. Prod. Econ."},{"key":"16_CR25","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.ejor.2011.03.034","volume":"213","author":"D Datta","year":"2011","unstructured":"Datta, D., Amaral, A.R.S., Figueira, J.R.: Single row facility layout problem using a permutation-based genetic algorithm. Eur. J. Oper. Res. 213, 388\u2013394 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2018\/1529058","volume":"2018","author":"YF Peng","year":"2018","unstructured":"Peng, Y.F., Zeng, T., Fan, L.Z., Han, Y.J., Xia, B.X.: An improved genetic algorithm based robust approach for stochastic dynamic facility layout problem. Discrete Dyn. Nat. Soc. 2018, 1\u20138 (2018)","journal-title":"Discrete Dyn. Nat. Soc."},{"key":"16_CR27","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.jmsy.2020.11.014","volume":"58","author":"J Gong","year":"2021","unstructured":"Gong, J., Zhang, Z., Liu, J., Guan, C., Liu, S.: Hybrid algorithm of harmony search for dynamic parallel row ordering problem. J. Manuf. Syst. 58, 159\u2013175 (2021)","journal-title":"J. Manuf. Syst."},{"key":"16_CR28","doi-asserted-by":"publisher","first-page":"1517","DOI":"10.1080\/01605682.2021.1920345","volume":"73","author":"PP Zouein","year":"2022","unstructured":"Zouein, P.P., Kattan, S.: An improved construction approach using ant colony optimization for solving the dynamic facility layout problem. J. Oper. Res. Soc. 73, 1517\u20131531 (2022)","journal-title":"J. Oper. Res. Soc."},{"key":"16_CR29","first-page":"74","volume":"59","author":"L Khajemahalle","year":"2021","unstructured":"Khajemahalle, L., Emami, S., Keshteli, R.N.: A hybrid nested partitions and simulated annealing algorithm for dynamic facility layout problem: a robust optimization approach. Infor 59, 74\u2013101 (2021)","journal-title":"Infor"},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"Salimpour, S., Pourvaziri, H., Azab, A.: Semi-robust layout design for cellular manufacturing in a dynamic environment. Comp. Oper. Res. 133 (2021)","DOI":"10.1016\/j.cor.2021.105367"},{"key":"16_CR31","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0377-2217(97)00220-8","volume":"108","author":"T Yang","year":"1998","unstructured":"Yang, T., Brett, A.P.: Flexible machine layout design for dynamic and uncertain production environments. Eur. J. Oper. Res. 108, 49\u201364 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR32","first-page":"177","volume":"29","author":"PJ Siddique","year":"2018","unstructured":"Siddique, P.J., Luong, H.T., Shafiq, M.: An optimal joint maintenance and spare parts inventory model. Int. J. Ind. Syst. Eng. 29, 177\u2013192 (2018)","journal-title":"Int. J. Ind. Syst. Eng."},{"key":"16_CR33","doi-asserted-by":"publisher","first-page":"3558","DOI":"10.1016\/j.eswa.2010.08.144","volume":"38","author":"RH Yeh","year":"2011","unstructured":"Yeh, R.H., Kao, K.-C., Chang, W.L.: Preventive-maintenance policy for leased products under various maintenance costs. Expert Syst. Appl. 38, 3558\u20133562 (2011)","journal-title":"Expert Syst. Appl."},{"key":"16_CR34","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.cie.2014.12.017","volume":"80","author":"ZQ Lu","year":"2015","unstructured":"Lu, Z.Q., Cui, W.W., Han, X.L.: Integrated production and preventive maintenance scheduling for a single machine with failure uncertainty. Comput. Ind. Eng. 80, 236\u2013244 (2015)","journal-title":"Comput. Ind. Eng."},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"Parika, W., Seesuaysom, W., Vitayasak, S., Pongcharoen, P.: Bat algorithm for designing cell formation with a consideration of routing flexibility. In 2013 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2013, pp. 1353\u20131357 (2014)","DOI":"10.1109\/IEEM.2013.6962631"},{"key":"16_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v022.i05","volume":"22","author":"J Thioulouse","year":"2007","unstructured":"Thioulouse, J., Dray, S.: Interactive multivariate data analysis in R with the ade4 and ade4TkGUI packages. J. Stat. Softw. 22, 1\u201314 (2007)","journal-title":"J. Stat. Softw."},{"key":"16_CR37","first-page":"100015","volume":"3","author":"S Vitayasak","year":"2019","unstructured":"Vitayasak, S., Pongcharoen, P., Hicks, C.: Robust machine layout design under dynamic environment: Dynamic customer demand and machine maintenance. Expert Syst. Appl. X 3, 100015 (2019)","journal-title":"Expert Syst. Appl. X"},{"key":"16_CR38","unstructured":"Vitayasak, S., Pongcharoen, P.: Interaction of crossover and mutation operations for designing non-rotatable machine layout. In: Operations Research Network Conference, Thailand (2011)"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36622-2_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:16:42Z","timestamp":1710260202000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36622-2_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031366215","9783031366222"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36622-2_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"170","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}