Solving the cooperative scheduling problem of muck transport under time-segment restriction in an entire region.

Autor: Wang, Duanyi, Liu, Zhaoxia, Chen, Lin, Wei, Mengxiao, Li, Zongrong, Li, Yuming
Předmět:
Zdroj: Applied Intelligence; Jan2024, Vol. 54 Issue 1, p317-333, 17p
Abstrakt: With the acceleration of urbanization, there is an urgent need to build more transportation facilities to alleviate travel pressure. However, during the construction of a subway station, a large amount of muck is generated and must be transported to a treatment center. In response to transportation policies, this paper establishes a regional and time-limited transportation model for muck trucks based on their departure time points. The model aims to dispatch the least number of vehicles and complete all transportation tasks as quickly as possible, taking into account constraints such as restricted travel time. This paper uses the NSGA-II algorithm with multi-segment encoding to solve this problem, and numerical experiments are conducted to analyze the performance of the proposed method. The results indicate that the improved algorithm has better convergence and distribution than the standard NSGA-II. The study also validates the effectiveness of the proposed method through a real-world example of muck transportation at subway stations in a specific city. The collaborative scheduling schemes developed through the methods proposed in this paper have effectively avoided the travel restriction period, providing managers with multiple decision-making options. [ABSTRACT FROM AUTHOR]
Databáze: Complementary Index
Externí odkaz: