.png){kind=icon}
.png){kind=icon}
Return
A self-adaptive memetic algorithm with Q-learning for solving the multi-AGVs dispatching problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2024.101697.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we address the problem of dispatching multiple automated guided vehicles (AGVs) in an actual production workshop, aiming to minimize the transportation cost. To solve this problem, a self-adaptive memetic algorithm with Q-learning (Q-SAMA) is proposed. An improved nearest-neighbor task division heuristic is used for generating premium solutions. Additionally, a Q-learning is integrated to select appropriate neighborhood operators, thereby enhancing the algorithm's exploration ability. To prevent the algorithm from falling into a local optimum, the restart strategy is offered. In order to adapt Q-SAMA to different stages in the search process, the traditional crossover and mutation probabilities are no longer used. Instead, a self-adaptive probability is obtained based on the population's degree of concentration, and the sparsity relationship among individuals' fitness. Finally, experimental results validate the effectiveness of the proposed method. It is able to yield better results compared with other five state-of-the-art algorithms.
Keywords:
Automatic guided vehicle
Scheduling problem
Memetic algorithm
Q-learning
Task assignment
Self-adaptive methods
Journal
IF:
8.5
Papers:
2.2K
Citations:
1.0W