Abstract
The logistic scheduling is a typical combinatorial optimization problem. Vehicle routing optimization is one of the most critical parts in logistics, and the Vehicle Routing Problem (VRP) is an important problem occurring in many distribution systems. This paper proposes an improved ant colony optimization algorithm to optimize the dynamic assignment to the Capacitated Vehicle Routing Problem (CVRP) and the Vehicle Routing Problem with Time Windows (VRPTW). The improved algorithm tests several different combinations and derives the solution that is able to deliver more orders at the correct delivery date. Results show the effectiveness of the proposed algorithm.
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.
