Hierarchical Optimization Scheduling Algorithm for Logistics Transport Vehicles Based on Multi-Agent Reinforcement Learning
Min Zhang, Chaohong Pan
Abstract
How to effectively improve the cargo assembly and multi-vehicle stratified planning has become an urgent problem to be solved. In this paper, Multi-Agent Reinforcement Learning Hierarchical Optimal Scheduling Algorithm (MARLHOSA) is proposed to solve the hierarchical scheduling problem of logistics transport vehicles. We model the hierarchical scheduling problem of logistics transport vehicles as an infinite Markov decision process and set constraints to simulate the actual operating environment. To solve the Markov decision process corresponding to the economic scheduling problem of logistics transport vehicles, this paper uses the close-range strategy optimization algorithm, and uses multi-agent reinforcement learning algorithm based on the clipping mechanism to improve the loss function of the short-range strategy optimization algorithm. In addition, a distributed training architecture was designed for the training process of the close-range strategy optimization algorithm, so as to improve the speed of data collection and training speed and quality. According to a demand order put forward by the company, a path-loading collaborative optimization model was established. After solving the model, the number of vehicles dispatched by each vehicle type according to the optimal path-loading scheme of each vehicle type was determined. The simulation results show that the proposed improved distributed proximity strategy optimization algorithm can achieve the same economic performance as the numerical optimization method. Compared with the traditional algorithm, MARLHOSA can reduce the total vehicle mileage by 34.5% and increase the average loading rate of the carriage by 28.6%. The optimization effect is significant.