{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T11:22:41Z","timestamp":1778066561275,"version":"3.51.4"},"reference-count":38,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2023,4,7]],"date-time":"2023-04-07T00:00:00Z","timestamp":1680825600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["52205529"],"award-info":[{"award-number":["52205529"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["ZR2021QE195"],"award-info":[{"award-number":["ZR2021QE195"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["ZR2021QF036"],"award-info":[{"award-number":["ZR2021QF036"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["LCUGYTD2022-03"],"award-info":[{"award-number":["LCUGYTD2022-03"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundation of Shandong Province","award":["52205529"],"award-info":[{"award-number":["52205529"]}]},{"name":"Natural Science Foundation of Shandong Province","award":["ZR2021QE195"],"award-info":[{"award-number":["ZR2021QE195"]}]},{"name":"Natural Science Foundation of Shandong Province","award":["ZR2021QF036"],"award-info":[{"award-number":["ZR2021QF036"]}]},{"name":"Natural Science Foundation of Shandong Province","award":["LCUGYTD2022-03"],"award-info":[{"award-number":["LCUGYTD2022-03"]}]},{"name":"Liaocheng University","award":["52205529"],"award-info":[{"award-number":["52205529"]}]},{"name":"Liaocheng University","award":["ZR2021QE195"],"award-info":[{"award-number":["ZR2021QE195"]}]},{"name":"Liaocheng University","award":["ZR2021QF036"],"award-info":[{"award-number":["ZR2021QF036"]}]},{"name":"Liaocheng University","award":["LCUGYTD2022-03"],"award-info":[{"award-number":["LCUGYTD2022-03"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>In real manufacturing environments, the number of automatic guided vehicles (AGV) is limited. Therefore, the scheduling problem that considers a limited number of AGVs is much nearer to real production and very important. In this paper, we studied the flexible job shop scheduling problem with a limited number of AGVs (FJSP-AGV) and propose an improved genetic algorithm (IGA) to minimize makespan. Compared with the classical genetic algorithm, a population diversity check method was specifically designed in IGA. To evaluate the effectiveness and efficiency of IGA, it was compared with the state-of-the-art algorithms for solving five sets of benchmark instances. Experimental results show that the proposed IGA outperforms the state-of-the-art algorithms. More importantly, the current best solutions of 34 benchmark instances of four data sets were updated.<\/jats:p>","DOI":"10.3390\/s23083815","type":"journal-article","created":{"date-parts":[[2023,4,10]],"date-time":"2023-04-10T03:24:18Z","timestamp":1681097058000},"page":"3815","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":94,"title":["An Improved Genetic Algorithm for Solving the Multi-AGV Flexible Job Shop Scheduling Problem"],"prefix":"10.3390","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1439-4832","authenticated-orcid":false,"given":"Leilei","family":"Meng","sequence":"first","affiliation":[{"name":"School of Computer Science, Liaocheng University, Liaocheng 252000, China"}]},{"given":"Weiyao","family":"Cheng","sequence":"additional","affiliation":[{"name":"School of Computer Science, Liaocheng University, Liaocheng 252000, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4148-8172","authenticated-orcid":false,"given":"Biao","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science, Liaocheng University, Liaocheng 252000, China"}]},{"given":"Wenqiang","family":"Zou","sequence":"additional","affiliation":[{"name":"School of Computer Science, Liaocheng University, Liaocheng 252000, China"}]},{"given":"Weikang","family":"Fang","sequence":"additional","affiliation":[{"name":"School of Mechanical Science and Engineering, Huazhong University of Science and Technology, Wuhan 430074, China"}]},{"given":"Peng","family":"Duan","sequence":"additional","affiliation":[{"name":"School of Computer Science, Liaocheng University, Liaocheng 252000, China"}]}],"member":"1968","published-online":{"date-parts":[[2023,4,7]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"106347","DOI":"10.1016\/j.cie.2020.106347","article-title":"Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem","volume":"142","author":"Meng","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Meng, L., Zhang, B., Gao, K., and Duan, P. (2023). An MILP Model for Energy-Conscious Flexible Job Shop Problem with Transportation and Sequence-Dependent Setup Times. Sustainability, 15.","DOI":"10.3390\/su15010776"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/s10898-021-00992-6","article-title":"Production and transport scheduling in flexible job shop manufacturing systems","volume":"79","author":"Homayouni","year":"2021","journal-title":"J. Glob. Optim."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1080\/00207543.2018.1501166","article-title":"Mathematical modelling and optimisation of energy-conscious hybrid flow shop scheduling problem with unrelated parallel machines","volume":"4","author":"Meng","year":"2019","journal-title":"Int. J. Prod. Res."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.rcim.2019.04.006","article-title":"Multi-objective optimization for energy-efficient flexible job shop scheduling problem with transportation constraints","volume":"59","author":"Dai","year":"2019","journal-title":"Robot. Computer-Integr. Manuf."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","article-title":"An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem","volume":"174","author":"Li","year":"2016","journal-title":"Int. J. Prod. Econ."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"100664","DOI":"10.1016\/j.swevo.2020.100664","article-title":"An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints","volume":"54","author":"Zhang","year":"2020","journal-title":"Swarm Evol. Comput."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1016\/j.jclepro.2018.11.021","article-title":"MILP models for energy-aware flexible job shop scheduling problem","volume":"210","author":"Meng","year":"2019","journal-title":"J. Clean. Prod."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"3905","DOI":"10.1080\/00207543.2019.1636324","article-title":"More MILP models for hybrid flow shop scheduling problem and its extended problems","volume":"58","author":"Meng","year":"2020","journal-title":"Int. J. Prod. Res."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"101058","DOI":"10.1016\/j.swevo.2022.101058","article-title":"Novel MILP and CP models for distributed hybrid flowshop scheduling problem with sequence-dependent setup times","volume":"71","author":"Meng","year":"2022","journal-title":"Swarm Evol. Comput."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1111\/itor.12878","article-title":"A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation","volume":"30","author":"Homayouni","year":"2023","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"102283","DOI":"10.1016\/j.rcim.2021.102283","article-title":"Real-time data-driven dynamic scheduling for flexible job shop with insufficient transportation resources using hybrid deep Q network","volume":"74","author":"Li","year":"2022","journal-title":"Robot. Computer-Integr. Manuf."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"108334","DOI":"10.1016\/j.knosys.2022.108334","article-title":"Efficient multiobjective optimization for an AGV energy-efficient scheduling problem with release time","volume":"242","author":"Zou","year":"2022","journal-title":"Knowl. Based Syst."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"108036","DOI":"10.1016\/j.knosys.2021.108036","article-title":"A referenced iterated greedy algorithm for the distributed assembly mixed no-idle permutation flowshop scheduling problem with the total tardiness criterion","volume":"239","author":"Li","year":"2022","journal-title":"Knowl. Based Syst."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"107961","DOI":"10.1016\/j.cie.2022.107961","article-title":"The distributed flowshop scheduling problem with delivery dates and cumulative payoffs","volume":"165","author":"Li","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"3871","DOI":"10.1109\/TITS.2019.2935509","article-title":"Rebalancing bike sharing systems for minimizing depot inventory and traveling costs","volume":"21","author":"Ren","year":"2019","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1007\/s00170-007-1354-8","article-title":"An effective hybrid genetic algorithm for the job shop scheduling problem","volume":"39","author":"Zhang","year":"2008","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"108205","DOI":"10.1016\/j.cie.2022.108205","article-title":"A hybrid algorithm with a new neighborhood structure for job shop scheduling problems","volume":"169","author":"Xie","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","article-title":"A genetic algorithm for the flexible job-shop scheduling problem","volume":"35","author":"Pezzella","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1016\/j.jmsy.2022.01.014","article-title":"An improved genetic algorithm for flexible job shop scheduling problem considering reconfigurable machine tools with limited auxiliary modules","volume":"62","author":"Fan","year":"2022","journal-title":"J. Manuf. Syst."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1287\/opre.43.6.1058","article-title":"A Time Window Approach to Simultaneous Scheduling of Machines and Material Handling System in an FMS","volume":"43","author":"Bilge","year":"1995","journal-title":"Oper. Res."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1720","DOI":"10.1016\/j.asoc.2012.02.001","article-title":"A multi-agent based approach to dynamic scheduling of machines and automated guided vehicles in manufacturing systems","volume":"12","author":"Erol","year":"2012","journal-title":"Appl. Soft Comput."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"2143","DOI":"10.1080\/00207540600818286","article-title":"A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles","volume":"46","author":"Deroussi","year":"2008","journal-title":"Int. J. Prod. Res."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s00170-010-2820-2","article-title":"Simultaneous scheduling of machines and vehicles in an FMS environment with alternative routing","volume":"53","author":"Kumar","year":"2011","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"5748","DOI":"10.1080\/00207543.2014.910628","article-title":"A tabu search algorithm for simultaneous machine\/AGV scheduling problem","volume":"52","author":"Zheng","year":"2014","journal-title":"Int. J. Prod. Res."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1007\/s10898-018-0681-7","article-title":"Joint production and transportation scheduling in flexible manufacturing systems","volume":"74","author":"Fontes","year":"2019","journal-title":"J. Glob. Optim."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1080\/0020754032000123579","article-title":"A hybrid GA\/heuristic approach to the simultaneous scheduling of machines and automated guided vehicles","volume":"42","author":"Abdelmaguid","year":"2004","journal-title":"Int. J. Prod. Res."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.ijpe.2010.07.012","article-title":"Job-shop based framework for simultaneous scheduling of machines and automated guided vehicles","volume":"143","author":"Lacomme","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1783","DOI":"10.1007\/s10845-020-01537-6","article-title":"Transfer-robot task scheduling in flexible job shop","volume":"31","author":"Ham","year":"2020","journal-title":"J. Intell. Manuf."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1007\/s00170-005-0223-6","article-title":"A hybrid multi-objective GA for simultaneous scheduling of machines and AGVs in FMS","volume":"31","author":"Reddy","year":"2006","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"2123","DOI":"10.1007\/s00170-015-7329-2","article-title":"Hybrid multiobjective genetic algorithms for integrated dynamic scheduling and routing of jobs and automated-guided vehicle (AGV) in flexible manufacturing systems (FMS) environment","volume":"81","author":"Umar","year":"2015","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Mousavi, M., Yap, H.J., Musa, S.N., Tahriri, F., and Dawal, S.Z.M. (2017). Multi-objective AGV scheduling in an FMS using a hybrid of genetic algorithm and particle swarm optimization. PLoS ONE, 12.","DOI":"10.1371\/journal.pone.0169817"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1016\/j.ejor.2008.03.051","article-title":"An MILP for scheduling problems in an FMS with one vehicle","volume":"199","author":"Caumond","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"ref_34","unstructured":"Deroussi, L., and Norre, S. (2010, January 27\u201331). Simultaneous scheduling of machines and vehicles for the flexible job shop problem. Proceedings of the International Conference on Metaheuristics and Nature Inspired Computing, Djerba Island, Tunisia."},{"key":"ref_35","first-page":"343","article-title":"Integrated scheduling of machines and automated guided vehicles (AGVs) in flexible job shop environment using genetic algorithms","volume":"13","year":"2022","journal-title":"Int. J. Ind. Eng. Comput."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"1713","DOI":"10.1016\/j.cor.2011.10.007","article-title":"A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times","volume":"39","author":"Zhang","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s10845-020-01585-y","article-title":"Data mining for fast and accurate makespan estimation in machining workshops","volume":"32","author":"Cheng","year":"2021","journal-title":"J. Intell. Manuf."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"102198","DOI":"10.1016\/j.rcim.2021.102198","article-title":"Research on flexible job shop scheduling under finite transportation conditions for digital twin workshop","volume":"72","author":"Yan","year":"2021","journal-title":"Robot. Computer-Integr. Manuf."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/8\/3815\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:12:13Z","timestamp":1760123533000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/8\/3815"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,7]]},"references-count":38,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2023,4]]}},"alternative-id":["s23083815"],"URL":"https:\/\/doi.org\/10.3390\/s23083815","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,7]]}}}