The Optimization Study of the Vehicle Scheduling about Construction Logistics Distribution Based on Genetic Algorithm
Zhong An, Huimin Shen, Bo Cao
Abstract
Zhong An, Huimin Shen, Bo Cao
Abstract
The optimization of the vehicle scheduling is a NP-Hard problem. With the expansion of the problem's dimensions, it was difficult to get the optimal solution by using the exact algorithms solely. This paper studied the vehicle scheduling problem by using the Genetic Algorithm, which was combined with the features of the construction logistics distribution. Then created a model of vehicle scheduling which was suited to Genetic Algorithm. At last, a illustrative example was given to prove that Genetic Algorithm had a better optimize performance.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The optimization of the vehicle scheduling is a NP-Hard problem. With the expansion of the problem's dimensions, it was difficult to get the optimal solution by using the exact algorithms solely. This paper studied the vehicle scheduling problem by using the Genetic Algorithm, which was combined with the features of the construction logistics distribution. Then created a model of vehicle scheduling which was suited to Genetic Algorithm. At last, a illustrative example was given to prove that Genetic Algorithm had a better optimize performance.
Key concepts: Computer science, Scheduling (production processes), Genetic algorithm, Mathematical optimization, Job shop scheduling, Genetic algorithm scheduling, Estimation of distribution algorithm, Fair-share scheduling