{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T17:51:19Z","timestamp":1771955479316,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T00:00:00Z","timestamp":1561075200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T00:00:00Z","timestamp":1561075200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"The tenth Graduate Innovation Fund of Wuhan Institute of Technology","award":["CX2018206"],"award-info":[{"award-number":["CX2018206"]}]},{"name":"The tenth Graduate Innovation Fund of Wuhan Institute of Technology","award":["Grant: CX2018199"],"award-info":[{"award-number":["Grant: CX2018199"]}]},{"name":"The tenth Graduate Innovation Fund of Wuhan Institute of Technology","award":["CX2017075"],"award-info":[{"award-number":["CX2017075"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s11227-019-02884-9","type":"journal-article","created":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T09:02:31Z","timestamp":1561107751000},"page":"5898-5913","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Multi-AGVs path planning based on improved ant colony algorithm"],"prefix":"10.1007","volume":"75","author":[{"given":"Guohong","family":"Yi","sequence":"first","affiliation":[]},{"given":"Zhili","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Tiancan","family":"Mei","sequence":"additional","affiliation":[]},{"given":"Pushan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Wang","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Siyuan","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,21]]},"reference":[{"issue":"5","key":"2884_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00207543.2016.1201604","volume":"55","author":"A Theorin","year":"2017","unstructured":"Theorin A, Bengtsson K, Provost J et al (2017) An event-driven manufacturing information system architecture for Industry 4.0. Int J Prod Res 55(5):1\u201315","journal-title":"Int J Prod Res"},{"issue":"7","key":"2884_CR2","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1080\/00207549408957026","volume":"32","author":"R Uzsoy","year":"1994","unstructured":"Uzsoy R (1994) Scheduling a single batch processing machine with non-identical job sizes. Int J Prod Res 32(7):1615\u20131635","journal-title":"Int J Prod Res"},{"issue":"1","key":"2884_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Naval Res Logist Q 1(1):61\u201368","journal-title":"Naval Res Logist Q"},{"issue":"7","key":"2884_CR4","first-page":"2095","volume":"38","author":"X Zhao","year":"2018","unstructured":"Zhao X, Guo X (2018) Branch and bound algorithm for solving hybrid flow shop robotic cells scheduling problem with blocking. J Comput Appl 38(7):2095\u20132099","journal-title":"J Comput Appl"},{"key":"2884_CR5","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.cie.2018.09.034","volume":"126","author":"P Priore","year":"2018","unstructured":"Priore P, Ponte B, Puente J, G\u00f3mez A (2018) Learning based scheduling of flexible manufacturing systems using ensemble methods. Comput Ind Eng 126:282\u2013291","journal-title":"Comput Ind Eng"},{"key":"2884_CR6","first-page":"29","volume":"7","author":"H Shu","year":"2010","unstructured":"Shu H, Zhao G, Zhao D (2010) Two kinds of heuristic rules in synthesis scheduling of FMS. Manuf Technol Mach Tool 7:29\u201332","journal-title":"Manuf Technol Mach Tool"},{"issue":"2","key":"2884_CR7","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1080\/00207543.2016.1182227","volume":"55","author":"O Sobeyko","year":"2016","unstructured":"Sobeyko O, M\u00f6nch L (2016) Integrated process planning and scheduling for large-scale flexible job shops using metaheuristics. Int J Prod Res 55(2):392\u2013409","journal-title":"Int J Prod Res"},{"issue":"2","key":"2884_CR8","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0895-7177(94)90203-8","volume":"20","author":"J Blazewicz","year":"1994","unstructured":"Blazewicz J, Burkard RE, Finke G et al (1994) Vehicle scheduling in two-cycle flexible manufacturing systems. Math Comput Model Int J 20(2):19\u201331","journal-title":"Math Comput Model Int J"},{"issue":"10","key":"2884_CR9","doi-asserted-by":"publisher","first-page":"2257","DOI":"10.1017\/S0263574714002872","volume":"34","author":"X Elias","year":"2016","unstructured":"Elias X, Paraskevi Z, Andreas N (2016) Path planning and scheduling for a fleet of autonomous vehicles. Robotica 34(10):2257\u20132273","journal-title":"Robotica"},{"issue":"1","key":"2884_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybernet Part B Cybernet 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybernet Part B Cybernet"},{"issue":"7-8","key":"2884_CR11","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s00170-005-0254-z","volume":"31","author":"B Fox","year":"2007","unstructured":"Fox B, Xiang W, Lee HP (2007) Industrial applications of the ant colony optimization algorithm. Int J Adv Manuf Technol 31(7-8):805\u2013814","journal-title":"Int J Adv Manuf Technol"},{"issue":"11","key":"2884_CR12","doi-asserted-by":"publisher","first-page":"3173","DOI":"10.1080\/00207543.2016.1267414","volume":"55","author":"S Zhang","year":"2017","unstructured":"Zhang S, Wong TN (2017) Flexible job-shop scheduling\/rescheduling in dynamic environment: a hybrid MAS\/ACO approach. Int J Prod Res 55(11):3173\u20133196","journal-title":"Int J Prod Res"},{"key":"2884_CR13","first-page":"29","volume":"3","author":"X You","year":"2017","unstructured":"You X, Liu S, Lv JQ (2017) Ant colony algorithm based on dynamic search strategy and its application on path planning of robot. Control Decis 3:29\u201332","journal-title":"Control Decis"},{"issue":"1","key":"2884_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G Navarro","year":"2001","unstructured":"Navarro G (2001) A guided tour to approximate string matching. ACM Comput Surv 33(1):31\u201388","journal-title":"ACM Comput Surv"},{"key":"2884_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.swevo.2014.10.003","volume":"20","author":"C Mao","year":"2015","unstructured":"Mao C, Xiao L, Yu X, Chen J (2015) Adapting ant colony optimization to generate test data for software structural testing. Swarm Evol Comput 20:23\u201336","journal-title":"Swarm Evol Comput"},{"key":"2884_CR16","doi-asserted-by":"crossref","unstructured":"Mao C, Yu X, Chen J, Chen J (2012) Generating test data for structural testing based on ant colony optimization. In: Proceedings of 12th International Conference on Quality Software (QSIC\u201912), pp 98\u2013101","DOI":"10.1109\/QSIC.2012.12"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-019-02884-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-019-02884-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-019-02884-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,19]],"date-time":"2020-06-19T23:08:58Z","timestamp":1592608138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-019-02884-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,21]]},"references-count":16,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["2884"],"URL":"https:\/\/doi.org\/10.1007\/s11227-019-02884-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,21]]},"assertion":[{"value":"21 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}