Scheduling multi–mode resource–constrained tasks of automated guided vehicles with an improved particle swarm optimization algorithm

Abstract

A modified particle swarm optimization (PSO) approach is presented for the multi-mode resource-constrained scheduling problem of automated guided vehicle (AGV) tasks. Various constraints in the scheduling process of the AGV system are analysed, and the types and quantities of AGVs as allocable resources are considered. The multiple-AGV combined distribution mode and its impact on distribution tasks is also considered. Finally, a multi-mode resource-constrained task scheduling model is established for which the object is to minimise material delivery time. Based on the above model, the discrete particle swarm optimization algorithm that improved the basic PSO was proposed. The simulation results with the test set in PSPLIB standard library showed the effectiveness of the improved PSO algorithm. This is an open access article under the terms of the Creative Commons Attribution-NonCommercial License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited and is not used for commercial purposes.

A Survey on Navigation Approaches for Automated Guided Vehicle Robots in Dynamic Surrounding

“…Many researchers have recently expressed interest in an IPSO, Qi et al [134] utilized the IPSO to improve the slow convergence speed, poor optimization result and incomplete search during mobile robot path planning by using classical navigation method which is Ant Colony Algorithm (ACO). While Xiao et al [135] presented by simulating an IPSO for the multi-mode resourceconstrained scheduling problem of AGV task. Qiuyun et al [136] used IPSO too in their study to improve the efficiency of AGV in material transfer and to determine the extent of effectiveness related to mechanism development.…”

“…Able to effectively plan a route in both simple and complicated outdoor environment conditions Yu & Yan [132] PSO To address the obstacle avoidance and AGV path planning issues in intelligent warehouses Success in enhancing the function's convergence and preventing the issue of the algorithm running into the local optimal solution Cao & Zhu [133] IPSO To resolve multi-AGV path limitations and conflicts in the environment Congestion-caused path conflict can be successfully reduced, and the multi-AGV system efficiency can be increased Qi et al [134] IPSO To address the issue of path planning Success in resolving the path planning issue with standard PSO and ACO serves as references for future study on mobile robot path planning control Xiao et al [135] IPSO To schedule AGV task with Multi-mode resource-constrained Success to demonstrate the algorithm's effectiveness in tackling challenges involving the scheduling of many modes of resourceconstrained tasks Qiuyun et al [136] IPSO To find the best path in the one-line manufacturing AGV path planning problem…”

The methods of task pre‐allocation and reallocation for multi‐UAV cooperative reconnaissance mission

“…Based on the discussions in literature [6,7], here α = β = 0.5. The f represents fitness value which is designed to evaluate the qualities of particles [28]. In particular, when the task allocation scheme dissatisfies with constraints, the value of f is set to infinity.…”

Bounded rational real‐time charging pricing strategy under the traffic‐grid coupling network

“…The Stackelberg Game problem can be described by the bilevel programming model [33]; so this paper establishes a real‐time charging price model based on the bilevel programming theory and solves the model through the multi‐objective particle swarm algorithm [34]. The lower layer is the follower strategy space S2, the upper layer is the leader strategy space S1, and the optimal strategy space combination calculated in each iteration is the initial strategy set of the next iteration.…”