Abstract
The “distribution” mode for material support is the trend of military logistics evolution, and scheduling of vehicle is crucial to achieve this target. The mathematical model for the vehicle scheduling problem of military material distribution was formulated, in which the minimization of the armies' waiting time was used as the objective, and an improved ant colony optimization algorithm was utilized to solve the model. In the proposed algorithm, the transition rule in ant colony optimization algorithm was improved, and the local search heuristics were integrated into the algorithm. The vehicle routing problem with time windows (VRPTW) benchmark instances were solved under different parameter settings, and the experimental results showed that our improved transition rule can significantly enhance the algorithm's performance.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
