{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T12:20:47Z","timestamp":1773318047994,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T00:00:00Z","timestamp":1689120000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T00:00:00Z","timestamp":1689120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61803192"],"award-info":[{"award-number":["61803192"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61773192"],"award-info":[{"award-number":["61773192"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011445","name":"Key Laboratory of Microbial Resources and Drug Development in Guizhou Province","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100011445","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Special fund plan for local science and technology development lead by central authority","award":["318011922"],"award-info":[{"award-number":["318011922"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2024,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>To meet the production demand of workshop, this paper proposes an efficient discrete artificial bee colony (DABC) algorithm to solve a new automatic guided vehicle (AGV) scheduling problem with delivery and pickup in a matrix manufacturing workshop. The goal is to produce a AGV transportation solution that minimizes the total cost, including travel cost, time cost, and AGV cost. Therefore, a mixed integer linear programming model is established. To improve the transportation efficiency, a dynamic calculation method is developed. In the DABC algorithm, a heuristic algorithm and a median based probability selection method are used. For improving the quality of the solutions, four effective neighborhood operators are introduced. In the local search, a rule is given to save the operation time and a problem-based search operator is proposed to improve the quality of the best individual. Finally, a series of comparison experiments were implemented with the iterative greedy algorithm, artificial bee colony algorithm, hybrid fruit fly optimization algorithm, discrete artificial bee colony algorithm, improved harmony search, and hybrid genetic-sweep algorithm. The results show that the proposed DABC algorithm has high performance on solving the delivery and pickup problem.<\/jats:p>","DOI":"10.1007\/s40747-023-01153-w","type":"journal-article","created":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T02:01:41Z","timestamp":1689127301000},"page":"37-57","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["An efficient discrete artificial bee colony algorithm with dynamic calculation method for solving the AGV scheduling problem of delivery and pickup"],"prefix":"10.1007","volume":"10","author":[{"given":"Xujin","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7476-5039","authenticated-orcid":false,"given":"Hongyan","family":"Sang","sequence":"additional","affiliation":[]},{"given":"Zhongkai","family":"Li","sequence":"additional","affiliation":[]},{"given":"Biao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Leilei","family":"Meng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,12]]},"reference":[{"key":"1153_CR1","volume":"174","author":"Z Li","year":"2022","unstructured":"Li Z, Sang H, Zhang X, Zou W, Zhang B, Meng L (2022) An effective discrete invasive weed optimization algorithm for multi-AGVs dispatching problem with specific cases in matrix manufacturing workshop. Comput Ind Eng 174:108775","journal-title":"Comput Ind Eng"},{"key":"1153_CR2","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.jmsy.2011.08.004","volume":"30","author":"K Fang","year":"2011","unstructured":"Fang K, Uhan N, Zhao F (2011) A new approach to scheduling in manufacturing for power consumption and carbon footprint reduction. J Manuf Syst 30:234\u2013240","journal-title":"J Manuf Syst"},{"key":"1153_CR3","doi-asserted-by":"crossref","first-page":"3970","DOI":"10.1016\/j.jclepro.2016.10.057","volume":"142","author":"D Bechtsis","year":"2017","unstructured":"Bechtsis D, Tsolakis N, Vlachos D, Iakovou E (2017) Sustainable supply chain management in the digitalisation era: the impact of automated guided vehicles. J Clean Prod 142:3970\u20133984","journal-title":"J Clean Prod"},{"key":"1153_CR4","doi-asserted-by":"crossref","unstructured":"Xia PP, Xu AH, Zhang Y (2020) A multi-AGV optimal scheduling algorithm based on particle swarm optimization. In: Artificial intelligence and security, pp 527\u2013538","DOI":"10.1007\/978-981-15-8083-3_47"},{"key":"1153_CR5","doi-asserted-by":"crossref","first-page":"33522","DOI":"10.1109\/ACCESS.2021.3061288","volume":"9","author":"QY Tao","year":"2021","unstructured":"Tao QY, Sang HY, Guo HW, Wang P (2021) Improved particle swarm optimization algorithm for AGV path planning. IEEE Access 9:33522\u201333531","journal-title":"IEEE Access"},{"key":"1153_CR6","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1016\/j.cie.2018.10.007","volume":"126","author":"Y Yang","year":"2018","unstructured":"Yang Y, Zhong M, Dessouky Y, Postolache O (2018) An integrated scheduling method for AGV routing in automated container terminals. Comput Ind Eng 126:482\u2013493","journal-title":"Comput Ind Eng"},{"key":"1153_CR7","doi-asserted-by":"crossref","first-page":"13390","DOI":"10.1016\/j.eswa.2012.05.064","volume":"39","author":"D Popovic","year":"2012","unstructured":"Popovic D, Vidovi\u0107 M, Radivojevi\u0107 G (2012) Variable neighborhood search heuristic for the inventory routing problem in fuel delivery. Expert Syst Appl 39:13390\u201313398","journal-title":"Expert Syst Appl"},{"key":"1153_CR8","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.asoc.2015.08.020","volume":"37","author":"M Abdulkader","year":"2015","unstructured":"Abdulkader M, Gajpal Y, ElMekkawy TY (2015) Hybridized ant colony algorithm for the multi compartment vehicle routing problem. Appl Soft Comput 37:196\u2013203","journal-title":"Appl Soft Comput"},{"key":"1153_CR9","first-page":"466","volume":"13","author":"CL Wang","year":"2018","unstructured":"Wang CL, Li SW (2018) Hybrid fruit fly optimization algorithm for solving multi-compartment vehicle routing problem in intelligent logistics. Adv Prod Eng Manag 13:466\u2013478","journal-title":"Adv Prod Eng Manag"},{"key":"1153_CR10","first-page":"156","volume":"289","author":"JH Zhang","year":"2012","unstructured":"Zhang JH, Zhang Z (2012) Multi-parameter multi-objective algorithm to solve VRP. Commun Inf Process 289:156\u2013162","journal-title":"Commun Inf Process"},{"key":"1153_CR11","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1016\/j.apm.2013.07.038","volume":"38","author":"JQ Li","year":"2014","unstructured":"Li JQ, Pan QK, Tasgetiren MF (2014) A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities. Appl Math Model 38:1111\u20131132","journal-title":"Appl Math Model"},{"key":"1153_CR12","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.omega.2013.12.004","volume":"45","author":"QK Pan","year":"2014","unstructured":"Pan QK, Wang L, Li JQ, Duan JH (2014) A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation. Omega 45:42\u201356","journal-title":"Omega"},{"key":"1153_CR13","first-page":"89","volume":"303","author":"QK Pan","year":"2017","unstructured":"Pan QK, Gao L, Li XY, Gao KZ (2017) Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times. Appl Math Comput 303:89\u2013112","journal-title":"Appl Math Comput"},{"key":"1153_CR14","doi-asserted-by":"crossref","first-page":"799","DOI":"10.3390\/electronics9050799","volume":"9","author":"B Farooq","year":"2020","unstructured":"Farooq B, Bao JS, Ma QW (2020) Flow-shop predictive modeling for multi-automated guided vehicles scheduling in smart spinning cyber-physical production systems. Electronics 9:799","journal-title":"Electronics"},{"key":"1153_CR15","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s40430-019-1894-5","volume":"41","author":"VK Chawla","year":"2019","unstructured":"Chawla VK, Chanda AK, Angra S, Rani S (2019) Effect of nature-inspired algorithms and hybrid dispatching rules on the performance of automatic guided vehicles in the flexible manufacturing system. J Braz Soc Mech Sci Eng 41:391","journal-title":"J Braz Soc Mech Sci Eng"},{"key":"1153_CR16","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1007\/s10489-017-0997-x","volume":"48","author":"H Fazlollahtabar","year":"2018","unstructured":"Fazlollahtabar H, Hassanli S (2018) Hybrid cost and time path planning for multiple autonomous guided vehicles. Appl Intell 48:482\u2013498","journal-title":"Appl Intell"},{"key":"1153_CR17","first-page":"3","volume":"10","author":"GM Li","year":"2018","unstructured":"Li GM, Zeng B, Liao W (2018) A new AGV scheduling algorithm based on harmony search for material transfer in a real-world manufacturing system. Adv Mech Eng 10:3","journal-title":"Adv Mech Eng"},{"key":"1153_CR18","first-page":"1","volume":"2019","author":"W Xu","year":"2019","unstructured":"Xu W, Guo S, Li X et al (2019) A dynamic scheduling method for logistics tasks oriented to intelligent manufacturing workshop. Math Probl Eng 2019:1\u201318","journal-title":"Math Probl Eng"},{"key":"1153_CR19","doi-asserted-by":"crossref","first-page":"35063","DOI":"10.1109\/ACCESS.2020.2973336","volume":"8","author":"WQ Zou","year":"2020","unstructured":"Zou WQ, Pan QK, Tasgetiren MF (2020) An effective discrete artificial bee colony algorithm for scheduling an automatic-guided-vehicle in a linear manufacturing workshop. IEEE Access 8:35063\u201335076","journal-title":"IEEE Access"},{"key":"1153_CR20","volume":"99","author":"WQ Zou","year":"2021","unstructured":"Zou WQ, Pan QK, Tasgetiren MF (2021) An effective iterated greedy algorithm for solving a multi-compartment AGV scheduling problem in a matrix manufacturing workshop. Appl Soft Comput 99:106945","journal-title":"Appl Soft Comput"},{"key":"1153_CR21","doi-asserted-by":"crossref","first-page":"74909","DOI":"10.1109\/ACCESS.2019.2919109","volume":"7","author":"X Lyu","year":"2019","unstructured":"Lyu X, Song Y, He C et al (2019) Approach to integrated scheduling problems considering optimal number of automated guided vehicles and conflict-free routing in flexible manufacturing systems. IEEE Access 7:74909\u201374924","journal-title":"IEEE Access"},{"key":"1153_CR22","first-page":"1","volume":"2019","author":"QR Zhao","year":"2019","unstructured":"Zhao QR, Ji S, Guo D et al (2019) Research on cooperative scheduling of automated quayside cranes and automatic guided vehicles in automated container terminal. Math Probl Eng 2019:1\u201315","journal-title":"Math Probl Eng"},{"key":"1153_CR23","doi-asserted-by":"crossref","first-page":"157081","DOI":"10.1109\/ACCESS.2020.3019703","volume":"8","author":"Y Xu","year":"2020","unstructured":"Xu Y, Qi L, Luan W et al (2020) Load-in-load-out AGV route planning in automatic container terminal. IEEE Access 8:157081\u2013157088","journal-title":"IEEE Access"},{"key":"1153_CR24","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106371","volume":"142","author":"M Zhong","year":"2020","unstructured":"Zhong M, Yang Y, Dessouky Y et al (2020) Multi-AGV scheduling for conflict-free path planning in automated container terminals. Comput Ind Eng 142:106371","journal-title":"Comput Ind Eng"},{"key":"1153_CR25","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1631\/jzus.C1300177","volume":"15","author":"Y Wang","year":"2014","unstructured":"Wang Y, Ma XL, Lao YT et al (2014) A two-stage heuristic method for vehicle routing problem with split deliveries and pickups. J Zhejiang Univ Sci C Comput Electron 15:200\u2013210","journal-title":"J Zhejiang Univ Sci C Comput Electron"},{"key":"1153_CR26","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10479-017-2520-5","volume":"259","author":"A Montero","year":"2017","unstructured":"Montero A, Miranda-Bront J, M\u00e9ndez-D\u00edaz I (2017) An ILP-based local search procedure for the VRP with pickups and deliveries. Ann Oper Res 259:327\u2013350","journal-title":"Ann Oper Res"},{"key":"1153_CR27","doi-asserted-by":"crossref","first-page":"1357","DOI":"10.1007\/s10845-015-1055-3","volume":"28","author":"D Dechampai","year":"2015","unstructured":"Dechampai D, Tanwanichkul L, Sethanan K et al (2015) A differential evolution algorithm for the capacitated VRP with flexibility of mixing pickup and delivery services and the maximum duration of a route in poultry industry. J Intell Manuf 28:1357\u20131376","journal-title":"J Intell Manuf"},{"key":"1153_CR28","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.cor.2016.12.023","volume":"81","author":"PV Silvestrin","year":"2017","unstructured":"Silvestrin PV, Ritt M (2017) An iterated tabu search for the multi-compartment vehicle routing problem. Comput Oper Res 81:192\u2013202","journal-title":"Comput Oper Res"},{"key":"1153_CR29","doi-asserted-by":"crossref","unstructured":"Exp\u00f3sito A, Raidl GR, Brito J et al (2018) GRASP-VNS for a periodic VRP with time windows to deal with milk collection. In: Computer aided systems theory\u2014Eurocast 2017 PTI 10671, pp 299\u2013306","DOI":"10.1007\/978-3-319-74718-7_36"},{"key":"1153_CR30","doi-asserted-by":"publisher","first-page":"2491","DOI":"10.1007\/s40747-021-00401-1","volume":"9","author":"H Wu","year":"2021","unstructured":"Wu H, Gao Y, Wang W et al (2021) A hybrid ant colony algorithm based on multiple strategies for the vehicle routing problem with time windows. Complex Intell Syst 9:2491\u20132508. https:\/\/doi.org\/10.1007\/s40747-021-00401-1","journal-title":"Complex Intell Syst"},{"key":"1153_CR31","doi-asserted-by":"crossref","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","volume":"181","author":"QK Pan","year":"2011","unstructured":"Pan QK, Tasgetiren MF, Suganthan PN et al (2011) A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf Sci 181:2455\u20132468","journal-title":"Inf Sci"},{"key":"1153_CR32","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.knosys.2018.02.029","volume":"148","author":"DW Gong","year":"2018","unstructured":"Gong DW, Han YY, Sun JY (2018) A novel hybrid multi-objective artificial bee colony algorithm for the blocking lot-streaming flow shop scheduling problems. Knowl Based Syst 148:115\u2013130","journal-title":"Knowl Based Syst"},{"key":"1153_CR33","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.eswa.2019.01.062","volume":"124","author":"QK Pan","year":"2019","unstructured":"Pan QK, Gao L, Wang L et al (2019) Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem. Expert Syst Appl 124:309\u2013324","journal-title":"Expert Syst Appl"},{"key":"1153_CR34","doi-asserted-by":"crossref","first-page":"5278","DOI":"10.1080\/00207543.2018.1467575","volume":"56","author":"T Meng","year":"2018","unstructured":"Meng T, Pan QK, Sang HY (2018) A hybrid artificial bee colony algorithm for a flexible job shop scheduling problem with overlapping in operations. Int J Prod Res 56:5278\u20135292","journal-title":"Int J Prod Res"},{"key":"1153_CR35","doi-asserted-by":"crossref","first-page":"6758","DOI":"10.1016\/j.apm.2013.02.011","volume":"37","author":"MF Tasgetiren","year":"2013","unstructured":"Tasgetiren MF, Pan QK, Suganthan PN et al (2013) A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion. Appl Math Model 37:6758\u20137677","journal-title":"Appl Math Model"},{"key":"1153_CR36","doi-asserted-by":"crossref","first-page":"1339","DOI":"10.1142\/S0219622014500126","volume":"16","author":"K Guo","year":"2017","unstructured":"Guo K, Zhang QS (2017) A discrete artificial bee colony algorithm for the reverse logistics location and routing problem. Int J Inf Technol Decis Mak 16:1339\u20131357","journal-title":"Int J Inf Technol Decis Mak"},{"key":"1153_CR37","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106347","volume":"142","author":"L Meng","year":"2020","unstructured":"Meng L, Zhang C, Ren Y et al (2020) Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem. Comput Ind Eng 142:106347","journal-title":"Comput Ind Eng"},{"key":"1153_CR38","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2022.101058","volume":"71","author":"L Meng","year":"2022","unstructured":"Meng L, Gao K, Ren Y, Zhang B, Sang H, Zhang C (2022) Novel MILP and CP models for distributed hybrid flowshop scheduling problem with sequence-dependent setup times. Swarm Evol Comput 71:101058","journal-title":"Swarm Evol Comput"},{"key":"1153_CR39","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2020.104016","volume":"97","author":"JP Huang","year":"2021","unstructured":"Huang JP, Pan QK, Miao ZH et al (2021) Effective constructive heuristics and discrete bee colony optimization for distributed flowshop with setup times. Eng Appl Artif Intell 97:104016","journal-title":"Eng Appl Artif Intell"},{"key":"1153_CR40","volume":"152","author":"YY Huang","year":"2021","unstructured":"Huang YY, Pan QK, Huang JP et al (2021) An improved iterated greedy algorithm for the distributed assembly permutation flowshop scheduling problem. Comput Ind Eng 152:107021","journal-title":"Comput Ind Eng"},{"key":"1153_CR41","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.ejor.2011.06.006","volume":"215","author":"WY Szeto","year":"2011","unstructured":"Szeto WY, Wu YZ, Ho SC (2011) An artificial bee colony algorithm for the capacitated vehicle routing problem. Eur J Oper Res 215:126\u2013135","journal-title":"Eur J Oper Res"},{"key":"1153_CR42","doi-asserted-by":"crossref","DOI":"10.1016\/j.phycom.2020.101236","volume":"44","author":"J Euchi","year":"2021","unstructured":"Euchi J, Sadok A (2021) Hybrid genetic-sweep algorithm to solve the vehicle routing problem with drones. Phys Commun 44:101236","journal-title":"Phys Commun"},{"key":"1153_CR43","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.engappai.2018.09.005","volume":"76","author":"GH Zhang","year":"2018","unstructured":"Zhang GH, Xing KY, Cao F (2018) Discrete differential evolution algorithm for distributed blocking flowshop scheduling with makespan criterion. Eng Appl Artif Intell 76:96\u2013107","journal-title":"Eng Appl Artif Intell"},{"key":"1153_CR44","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.swevo.2017.05.007","volume":"38","author":"HY Sang","year":"2018","unstructured":"Sang HY, Duan PY, Li J (2018) An effective invasive weed optimization algorithm for scheduling semiconductor final testing problem. Swarm Evol Comput 38:42\u201353","journal-title":"Swarm Evol Comput"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01153-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-023-01153-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01153-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T22:09:24Z","timestamp":1707602964000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-023-01153-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,12]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["1153"],"URL":"https:\/\/doi.org\/10.1007\/s40747-023-01153-w","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,12]]},"assertion":[{"value":"17 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}