TY - JOUR
T1 - Pickup and delivery problem with recharging for material handling systems utilising autonomous mobile robots
AU - Jun, Sungbum
AU - Lee, Seokcheon
AU - Yih, Yuehwern
N1 - Publisher Copyright:
© 2020 Elsevier B.V.
PY - 2021/3/16
Y1 - 2021/3/16
N2 - Whereas automated guided vehicles (AGVs) have traditionally been used for material handling, the utilisation of autonomous mobile robots (AMRs) is growing quickly owing to their scalability, versatility, and lower costs. In this paper, we address the pickup and delivery problem with consideration of the characteristics of AMRs in manufacturing environments. To solve the problem, we first propose a new mathematical formulation with consideration of both partial and full recharging strategies for minimisation of the total tardiness of transportation requests. We then propose two constructive heuristic algorithms with high computation speed, which are called the Transportation-Request-Initiated Grouping Algorithm (TRIGA) and the Vehicle-Initiated Grouping Algorithm (VIGA). Additionally, we develop a memetic algorithm (MA) that incorporates a genetic algorithm into local-search techniques for finding near-optimal solutions within a reasonable time. We evaluate the performance of the proposed algorithms in comparison with two dispatching rules, genetic algorithm, and neighbourhood search through simulation experiments with three sets of problem instances under different battery levels. The simulation results indicate that the proposed algorithms outperform the others with regard to the average total tardiness and the relative deviation index.
AB - Whereas automated guided vehicles (AGVs) have traditionally been used for material handling, the utilisation of autonomous mobile robots (AMRs) is growing quickly owing to their scalability, versatility, and lower costs. In this paper, we address the pickup and delivery problem with consideration of the characteristics of AMRs in manufacturing environments. To solve the problem, we first propose a new mathematical formulation with consideration of both partial and full recharging strategies for minimisation of the total tardiness of transportation requests. We then propose two constructive heuristic algorithms with high computation speed, which are called the Transportation-Request-Initiated Grouping Algorithm (TRIGA) and the Vehicle-Initiated Grouping Algorithm (VIGA). Additionally, we develop a memetic algorithm (MA) that incorporates a genetic algorithm into local-search techniques for finding near-optimal solutions within a reasonable time. We evaluate the performance of the proposed algorithms in comparison with two dispatching rules, genetic algorithm, and neighbourhood search through simulation experiments with three sets of problem instances under different battery levels. The simulation results indicate that the proposed algorithms outperform the others with regard to the average total tardiness and the relative deviation index.
KW - Autonomous mobile robots
KW - Material handling
KW - Memetic algorithm
KW - Mixed-integer linear programming
KW - Pickup and delivery problem
UR - http://www.scopus.com/inward/record.url?scp=85090486005&partnerID=8YFLogxK
U2 - 10.1016/j.ejor.2020.07.049
DO - 10.1016/j.ejor.2020.07.049
M3 - Article
AN - SCOPUS:85090486005
SN - 0377-2217
VL - 289
SP - 1153
EP - 1168
JO - European Journal of Operational Research
JF - European Journal of Operational Research
IS - 3
ER -