A study of the path optimization distribution problem with time windows
Improved genetic algorithm is based on the traditional genetic algorithm, insert the large neighborhood search algorithm to solve the vehicle scheduling problem with time window (VRPTW). Establish the planning model with distribution cost as the optimization objective, take the actual store distribution problem of a supermarket as the research object, with the objective function of the least distribution cost, apply the improved genetic algorithm, traditional genetic algorithm to the model, compare with the traditional algorithm, the advantage of the improvement reduces the distribution cost, which is in line with the needs of the enterprise.
Authors
- Ying Chen (ORCID: https://orcid.org/0000-0002-8433-3341)
Institutions
- Anhui Business College (CN)
Publication Details
- Published
- 2024-11-29
- DOI
- https://doi.org/10.1109/icmsp64464.2024.10866561
- Primary Topic
- Vehicle Routing Optimization Methods
- Type
- article
- Field-Weighted Citation Impact
- 0.00