Operations of Automated Guided Vehicles (AGVs) are desired to be more energy-efficient while maintaining high transport productivity, motivated by the green production requirements. This paper investigates a new energy-efficient planning problem for determining conflict-free paths of the AGVs in its transport roadmap. In this problem, the vehicle path and transport time in the roadmap are jointly optimized, based on a flexible time-space network (FTSN). We provide the mathematical problem formulation of the energy-efficient path planning problem. The resulting optimization problem is proved to be a non-convex mixed-integer nonlinear programming which is computationally intractable. We further propose a hybrid metaheuristic that integrates the genetic algorithm and estimation of the distribution algorithm to improve its computational efficiency. Numerical results show the effectiveness of the developed algorithm based on the FTSN framework, compared to the existing metaheuristics, the conventional path planning method, and a commercial solver. The proposed method has a wide application in improving energy use of material handling, providing a guiding significance on promoting cleaner production of flexible manufacturing systems.

Xin, J.b., Wei, L.q., D'Ariano, A., Zhang, F.f., Negenborn, R. (2023). Flexible time-space network formulation and hybrid metaheuristic for conflict-free and energy-efficient path planning of automated guided vehicles. JOURNAL OF CLEANER PRODUCTION, 398, 136472 [10.1016/j.jclepro.2023.136472].

Flexible time-space network formulation and hybrid metaheuristic for conflict-free and energy-efficient path planning of automated guided vehicles

D'Ariano, A;
2023-01-01

Abstract

Operations of Automated Guided Vehicles (AGVs) are desired to be more energy-efficient while maintaining high transport productivity, motivated by the green production requirements. This paper investigates a new energy-efficient planning problem for determining conflict-free paths of the AGVs in its transport roadmap. In this problem, the vehicle path and transport time in the roadmap are jointly optimized, based on a flexible time-space network (FTSN). We provide the mathematical problem formulation of the energy-efficient path planning problem. The resulting optimization problem is proved to be a non-convex mixed-integer nonlinear programming which is computationally intractable. We further propose a hybrid metaheuristic that integrates the genetic algorithm and estimation of the distribution algorithm to improve its computational efficiency. Numerical results show the effectiveness of the developed algorithm based on the FTSN framework, compared to the existing metaheuristics, the conventional path planning method, and a commercial solver. The proposed method has a wide application in improving energy use of material handling, providing a guiding significance on promoting cleaner production of flexible manufacturing systems.
2023
Xin, J.b., Wei, L.q., D'Ariano, A., Zhang, F.f., Negenborn, R. (2023). Flexible time-space network formulation and hybrid metaheuristic for conflict-free and energy-efficient path planning of automated guided vehicles. JOURNAL OF CLEANER PRODUCTION, 398, 136472 [10.1016/j.jclepro.2023.136472].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11590/458967
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 5
social impact