An improved genetic algorithm for multi-AGV dispatching problem with unloading setup time in a matrix manufacturing workshop
| Autor: | Yuan-Zhuang Li, Jia-Zhen Zou, Yang-Li Jia, Lei-Lei Meng, Wen-Qiang Zou |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2023 |
| Předmět: | |
| Zdroj: | International Journal of Industrial Engineering Computations, Vol 14, Iss 4, Pp 767-784 (2023) |
| Druh dokumentu: | article |
| ISSN: | 1923-2926 1923-2934 |
| DOI: | 10.5267/j.ijiec.2023.7.002 |
| Popis: | This paper investigates a novel problem concerning material delivery in a matrix manufacturing workshop, specifically the multi-automated guided vehicle (AGV) dispatching problem with unloading setup time (MAGVDUST). The objective of the problem is to minimize transportation costs, including travel costs, time penalty costs, AGV costs, and unloading setup time costs. To solve the MAGVDUST, this paper builds a mixed-integer linear programming model and proposes an improved genetic algorithm (IGA). In the IGA, an improved nearest-neighbor-based heuristic is proposed to generate a high-quality initial solution. Several advanced technologies are developed to balance local exploitation and global exploration of the algorithm, including an optimal solution preservation strategy in the selection process, two well-designed crossovers in the crossover process, and a mutation based on Partially Mapped Crossover strategy in the mutation process. In conclusion, the proposed algorithm has been thoroughly evaluated on 110 instances from an actual electronic factory and has demonstrated its superior performance compared to state-of-the-art algorithms in the existing literature. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|