Compatibility Themed Solution of the Vehicle

[摘要] In this study, we discuss the solution to the vehicle routing problem for a heterogeneous fleet with a depot and atime window satisfied by meeting customer demands with various constraints. A 3-stage hierarchical method consisting oftransportation, routing, and linear correction steps is proposed for the solution. In the first stage, customer demands have theshortest routing. They were clustered using the annealing simulation algorithm and assigned vehicles of appropriate type andequipment. In the second stage, a genetic algorithm was used to find the optimal solution that satisfies both the requirements ofthe transported goods and the customer requirements. In the third stage, an attempt was made to increase the optimality bylinear correction of the optimal solution found in the second stage. The unique feature of the application is the variety ofconstraints addressed by the problem and the close proximity to real logistics practice.

[学科分类] 计算机科学（综合）

[关键词] Time window;vehicle routing problem;multiple traveling salesmen problem;heterogeneous fleet;simulatedannealing algorithm;genetic algorithm;optimization