Abstract
The efficiency of automatic guided vehicle (AGV) scheduling is important to improve the productivity of manufacturing enterprises. In this paper, the production materials and cutting tools consumables are transferred by multiple AGVs and a multi-objective mathematical model of AGV scheduling is established, which contains three objectives, i.e., the total travel distance of AGVs, the standard deviation of AGVs workload and the standard deviation of the difference between the latest delivery time and the predicted time of tasks. Then, an improved harmony search (HS) algorithm is proposed by adopting dynamic changing harmony memory considering rate (HMCR) parameters and implementing neighborhood search strategy for the best harmony in harmony memory (HM). Meanwhile, the harmony is divided into several segments according to the capacitated multiple-load AGVs. Each segment corresponds to the tasks execution scope of AGVs that return to the warehouse in turn. And the elements sequence of each segment represents the order of these tasks performed by AGV. At the same time, calculating the fitness value in each segment of harmony, and finally adding them up as the total fitness value of the whole harmony. A larger-scale instance from the real-life manufacturing enterprise is used to evaluate the performance of the proposed HS algorithm. The computational results show that the proposed HS algorithm outperforms the current solution.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bae J, Chung W (2017) A heuristic for a heterogeneous automated guided vehicle routing problem. Int J Precis Eng Manuf 18(6):795–801. https://doi.org/10.1007/s12541-017-0095-3
Cenci M, Giacomo MD, Mason F (2017) A note on a mixed routing and scheduling problem on a grid graph. J Oper Res Soc 68(11):1363–1376. https://doi.org/10.2139/ssrn.2541643
Du J, Leung JY-T (1990) Minimizing total tardiness on one machine Is NP-hard. Math Oper Res 15(3):483–495. https://doi.org/10.1287/moor.15.3.483
ElMekkawy TY, Liu S (2009) A new memetic algorithm for optimizing the partitioning problem of tandem AGV systems. Int J Prod Econ 118(2):508–520. https://doi.org/10.1016/j.ijpe.2009.01.008
Fazlollahtabar H, Hassanli S (2018) Hybrid cost and time path planning for multiple autonomous guided vehicles. Appl Intell 48(2):482–498. https://doi.org/10.1007/s10489-017-0997-x
Fazlollahtabar H, Mehrabad MS, Balakrishnan J (2015) Mathematical optimization for earliness/tardiness minimization in a multiple automated guided vehicle manufacturing system via integrated heuristic algorithms. Robot Auton Syst 72:131–138. https://doi.org/10.1016/j.robot.2015.05.002
Gaham M, Bouzouia B, Achour N (2017) An effective operations permutation-based discrete harmony search approach for the flexible job shop scheduling problem with makespan criterion. Appl Intell 48(6):1423–1441. https://doi.org/10.1007/s10489-017-0993-1
Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simul Trans Soc Model Simul Int 76(2):60–68. https://doi.org/10.1177/003754970107600201
Ghasemzadeh H, Behrangi E, Azgomi MA (2009) Conflict-free scheduling and routing of automated guided vehicles in mesh topologies. Robot Auton Syst 57(6–7):738–748. https://doi.org/10.1016/j.robot.2008.10.016
Goswami M, Tiwari MK (2006) A reallocation-based heuristic to solve a machine loading problem with material handling constraint in a flexible manufacturing system. Int J Prod Res 44(3):569–588. https://doi.org/10.1080/00207540500266263
Guo ZX, Yang C, Wang W, Yang J (2015) Harmony search-based multi-objective optimization model for multi-site order planning with multiple uncertainties and learning effects. Comput Ind Eng 83:74–90. https://doi.org/10.1016/j.cie.2015.01.023
Guo Z, Shi L, Chen L, Liang Y (2017) A harmony search-based memetic optimization model for integrated production and transportation scheduling in MTO manufacturing. Omega 66:327–343. https://doi.org/10.1016/j.omega.2015.10.012
Ho YC, Liu HC (2009) The performance of load-selection rules and pickup-dispatching rules for multiple-load AGVs. J Manufac Syst 28(1):1–10. https://doi.org/10.1016/j.jmsy.2009.06.001
Ho YC, Liu HC, Yih Y (2012) A multiple-attribute method for concurrently solving the pickup-dispatching problem and the load-selection problem of multiple-load AGVs. J Manufac Syst 31(3):288–300. https://doi.org/10.1016/j.jmsy.2012.03.002
Lacomme P, Mohand L, Tchernev N (2013) Job-shop based framework for simultaneous scheduling of machines and automated guided vehicles. Int J Prod Econ 143(1):24–34. https://doi.org/10.1016/j.ijpe.2010.07.012
Laguna M, Barnes JW, Glover F (1993) Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequence-dependent setup costs and times. Appl Intell 3(2):159–172. https://doi.org/10.1007/bf00871895
Li N, Li Y, Sun M, Kong H, Gong G (2017) An optimization method for task assignment for industrial manufacturing organizations. Appl Intell 47(4):1144–1156. https://doi.org/10.1007/s10489-017-0940-1
Li GM, Zeng B, Liao W, Li XY, Gao L (2018) A new AGV scheduling algorithm based on harmony search for material transfer in a real-world manufacturing system. Adv Mech Eng 10(3):168781401876556. https://doi.org/10.1177/1687814018765560
Liang X, Huang M, Ning T (2016) Flexible job shop scheduling based on improved hybrid immune algorithm. J Ambient Intell Humaniz Comput 9(1):165–171. https://doi.org/10.1007/s12652-016-0425-9
Maroosi A, Muniy RC, Sundararajan E, Zin AM (2016) A parallel membrane inspired harmony search for optimization problems: A case study based on a flexible job shop scheduling problem. Appl Soft Comput 49:120–136. https://doi.org/10.1016/j.asoc.2016.08.007
Mehrabad MS, Arani SD, Evazabadian F, Mahmoodian V (2015) An Ant Colony Algorithm (ACA) for solving the new integrated modelof job shop scheduling and conflict-free routing of AGVs. Comput Ind Eng 86:2–13. https://doi.org/10.1016/j.cie.2015.01.003
Menéndez B, Bustillo M, Pardo EG, Duarte A (2017) General variable neighborhood search for the order batching and sequencing problem. Eur J Oper Res 263(1):82–93. https://doi.org/10.1016/j.ejor.2017.05.001
Miyamoto T, Inoue K (2016) Local and random searches for dispatch and conflict-free routingproblem of capacitated AGV systems. Comput Ind Eng 91:1–9. https://doi.org/10.1016/j.cie.2015.10.017
Ning T, Huang M, Liang X, Jin H (2016) A novel dynamic scheduling strategy for solving flexible job-shop problems. J Ambient Intell Humaniz Comput 7(5):721–729. https://doi.org/10.1007/s12652-016-0370-7
Nouri HE, Driss OB, Ghédira K (2016) Hybrid metaheuristics for scheduling of machines and transport robots in job shop environment. Appl Intell 45(3):808–828. https://doi.org/10.1007/s10489-016-0786-y
Paulo J, Lashkari RS, Dutta SP (2002) Operation allocation and materials-handling system selection in a flexible manufacturing system: a sequential modelling approach. Int J Prod Res 40(1):7–35. https://doi.org/10.1080/00207540110073028
Safarzadeh S, Shadrokh S, Salehian A (2018) A heuristic scheduling method for the pipe-spool fabrication process. J Ambient Intell Humaniz Comput 9(6):1901–1918. https://doi.org/10.1007/s12652-018-0737-z
Shafigh F, Defersha FM, Moussa SE (2017) A linear programming embedded simulated annealing in the design of distributed layout with production planning and systems reconfiguration. Int J Adv Manuf Technol 88(1–4):1119–1140. https://doi.org/10.1007/s00170-016-8813-z
Shen J, Zhu Y (2018) A parallel-machine scheduling problem with periodic maintenance under uncertainty. J Ambient Intell Humaniz Comput. https://doi.org/10.1007/s12652-018-1032-8
Umar UA, Ariffin MKA, Ismail N, Tang SH (2015) Hybrid multiobjective genetic algorithms for integrated dynamic scheduling and routing of jobs and automated-guided vehicle (AGV) in flexible manufacturing systems (FMS). Int J Adv Manuf Technol 81(9–12):2123–2141. https://doi.org/10.1007/s00170-015-7329-2
Vivaldini K, Rocha LF, Martarelli NJ, Becker M, Moreira AP (2016) Integrated tasks assignment and routing for the estimation of the optimal number of AGVS. Int J Adv Manuf Technol 82(1–4):719–736. https://doi.org/10.1007/s00170-015-7343-4
Zaghdoud R, Mesghoun K, Dutilleul SC, Zidi K, Ghedira K (2016) A hybrid method for assigning containers to AGVs in container terminal. Int Fed Autom Control 49(3):96–103. https://doi.org/10.1016/j.ifacol.2016.07.017
Zhang D, Zhang C, Xu F, Zuo D (2015) A hybrid genetic algorithm used in vehicle dispatching for JIT distribution in NC workshop. Int Fed Autom Control 48(3):898–903. https://doi.org/10.1016/j.ifacol.2015.06.197
Zhang J, Wang X, Chan FTS, Ruan J (2017) On-line order batching and sequencing problem with multiple pickers: a hybrid rule-based algorithm. Appl Math Model 45:271–284. https://doi.org/10.1016/j.apm.2016.12.012
Acknowledgements
This research is supported by the National Natural Science Foundation of China (NSFC) under Grant Nos. 51825502, 51775216 and 51721092, the Natural Science Foundation of Hubei Province under Grant No. 2018CFA078, and Program for HUST Academic Frontier Youth Team.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Electronic supplementary material
Below is the link to the electronic supplementary material.
Rights and permissions
About this article
Cite this article
Li, G., Li, X., Gao, L. et al. Tasks assigning and sequencing of multiple AGVs based on an improved harmony search algorithm. J Ambient Intell Human Comput 10, 4533–4546 (2019). https://doi.org/10.1007/s12652-018-1137-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12652-018-1137-0