Heterogeneous Multitype Fleet Green Vehicle Path Planning of Automated Guided Vehicle with Time Windows in Flexible Manufacturing System

Gao, Jia; Zheng, Xiaojun; Gao, Feng; Tong, Xuan; Han, Qiaomei

doi:10.3390/machines10030197

Cited by 18 publications

(4 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on the grid map model, Yu and LaValle 34 considered the maximum completion time, maximum arrival distance, total arrival time and total distance, equated the multi-robot path planning problem to integer linear programing and introduced heuristic rules to improve the performance of the algorithm. Furthermore, Gao et al 35 presented a time-window AGV path planning method based on a topological map environment for multiple types of AGVs.…”

Section: Related Workmentioning

confidence: 99%

A multi-AGV fast path planning method based on improved CBS algorithm in workshops

Zhou

Qin

et al. 2023

Proceedings of the Institution of Mechanical Engineers, Part C:

View full text Add to dashboard Cite

Automatic guided vehicles (AGVs) are an important component of workshop logistics distribution systems. With the continuous increase in human cost, unmanned workshops are becoming increasingly popular, and an increasing number of AGVs are being applied to workshop logistics distribution systems. However, with the increasing number of AGVs in the workshop, planning a path quickly for each AGV is challenging, and the response time of multi-AGV fast path planning cannot meet actual requirements. To solve this problem, a multi-AGV fast path planning method based on an improved conflict-based search (ICBS) algorithm is proposed. First, the path planning problem is analyzed, and the environment expression, task, objective and constraint models are established. Subsequently, a two-layer ICBS algorithm is proposed to achieve fast path planning. At the bottom layer, an improved A* algorithm is adopted, and the selection strategy of the nodes is changed when multiple minimum values are equal. In the upper layer, the conflict number, conflict objective and conflict constraint sets are established. Three priority rules including Most Conflicts First (MCF) rule, Earliest Conflict First (ECF) rule, Single Search for Conflict Point (SSCP) rule are used. And a conflict elimination strategy is proposed. Finally, the superiority of the algorithm-solving is verified based on benchmark and actual workshop maps.

show abstract

Section: Related Workmentioning

confidence: 99%

A multi-AGV fast path planning method based on improved CBS algorithm in workshops

Zhou

Qin

et al. 2023

Proceedings of the Institution of Mechanical Engineers, Part C:

View full text Add to dashboard Cite

show abstract

“…With the in-depth study of practical problems, a large number of variant studies have been generated on the basis of the traditional VRP, such as the capacitated vehicle routing problem (CVRP) [6], vehicle routing problem with time window (VRPTW) [7], vehicle routing problem with simultaneous pickup and delivery (VRPSPD) [8]. At the same, a large amount of research attempts have been devoted to designing efficient optimization methods in order to improve the solving efficiency for this problem, such as nested and joint algorithms [9], genetic algorithms [10,11], large neighborhood search algorithms (LNS) [12], hybrid metaheuristic algorithm [13], ant colony optimization algorithm [14], grey wolf optimization algorithm [15] and so on. Abbaspour and Aghsami [16] conducted a comprehensive comparative analysis of the performance of 13 different meta-heuristic algorithms, including the dragonfly algorithm and the grasshopper optimization algorithm.…”

Section: Literature Reviewmentioning

confidence: 99%

Optimization of Simultaneous Pickup and Delivery Vehicle Routing with Three-Dimensional Balanced Loading Constraints

Zhang

Sheng

2023

Sustainability

View full text Add to dashboard Cite

In order to promote the cost reduction and efficiency improvement of the logistics distribution process and to guarantee the safety of goods transportation, this paper studies the portfolio optimization of goods loading and the problem of simultaneous pickup and delivery vehicle routing. A balanced loading constraint was introduced to restrict loading through two aspects of axle weight bearing and lateral center-of-gravity offset. With the shortest total route length as the objective, this paper constructs a simultaneous pickup and delivery vehicle routing model with three-dimensional (3D) balanced loading constraints (3BL-VRPSPD). Additionally, a hybrid tabu search (TS) algorithm embedded loading test was proposed to solve this problem. Firstly, a heuristic insertion method was applied to determine the initial routing scheme, and the node swapping and relocation operators were designed to construct the tabu neighborhood scheme for routing optimization. On this basis, the 3D balanced loading was incorporated into the routing iteration process. A balanced loading algorithm, combining multiple-indicator ordering and maximum space division strategies (MOMD), was formulated to develop a 3D-balanced loading plan for goods with a pickup and delivery vehicle routing scheme. Finally, standard instances verified the effectiveness of the method. The results show that the proposed method can effectively optimize 3BL-VRPSPD and outperform other algorithms.

show abstract

“…Most AGVs used in intelligent workshops are also powered by batteries. At present, the research direction of scholars on AGV energy consumption is mainly divided into two aspects: One is to take the power demand of the AGV motor and its motion state as the research object [21,22]. With the increase in production demand in the intelligent workshop, AGVs need to complete deliveries of the workstations at the same time.…”

Section: Green Vehicle Route Problemmentioning

confidence: 99%

Research on Green Vehicle Path Planning of AGVs with Simultaneous Pickup and Delivery in Intelligent Workshop

Zheng,

Gao,

Tong

2023

Symmetry

Self Cite

View full text Add to dashboard Cite

In this study, we present and discuss a variant of the classic vehicle routing problem (VRP), the green automated guided vehicle (AGV) routing problem, which involves simultaneous pickup and delivery with time windows (GVRPSPDTW) in an intelligent workshop. The research object is AGV energy consumption. First, we conduct a comprehensive analysis of the mechanical forces present during AGV transportation and evaluate the overall operational efficiency of the workshop. Then, we construct a green vehicle path planning model to minimize the energy consumption during AGV transportation and the standby period. Hence, the problems considered in this study are modeled based on asymmetry, making the problem solving more complex. We also design a hybrid differential evolution algorithm based on large neighborhood search (DE-LNS) to increase the local search ability of the algorithm. To enhance the optimal quality of solutions, we design an adaptive scaling factor and use the squirrel migration operator to optimize the population. Last, extensive computational experiments, which are generated from the VRPSPDTW instances set and a real case of an intelligent workshop, are designed to evaluate and demonstrate the efficiency and effectiveness of the proposed model and algorithm. The experimental results show that DE-LNS yields competitive results, compared to advanced heuristic algorithms. The effectiveness and applicability of the proposed algorithm are verified. Additionally, the proposed model demonstrates significant energy-saving potential in workshop logistics. It can optimize energy consumption by 15.3% compared with the traditional VRPSPDTW model. Consequently, the model proposed in this research carries substantial implications for minimizing total energy consumption costs and exhibits promising prospects for real-world application in intelligent workshops.

show abstract

Heterogeneous Multitype Fleet Green Vehicle Path Planning of Automated Guided Vehicle with Time Windows in Flexible Manufacturing System

Cited by 18 publications

References 41 publications

A multi-AGV fast path planning method based on improved CBS algorithm in workshops

A multi-AGV fast path planning method based on improved CBS algorithm in workshops

Optimization of Simultaneous Pickup and Delivery Vehicle Routing with Three-Dimensional Balanced Loading Constraints

Research on Green Vehicle Path Planning of AGVs with Simultaneous Pickup and Delivery in Intelligent Workshop

Contact Info

Product

Resources

About