Abstract
Path optimization is a critical issue in vehicle routing problems (VRPs). This study tends to solve a VRP with time windows (VRPTW), which is an important version of VRP. Its principal objective is to find out the minimum cost routes to serve the customers within service time intervals, by a fleet of vehicles having confined capacity. An improved ant colony optimization (ACO) is applied to the problem, which uses a new pheromone reset and update function to enhance the route searching and a 2-opt method to improve the optimized path. The proposed ACO is tested on standard benchmarks of VRPTW. The results verifies the effectiveness of the algorithm and confirms it as better path optimizing method for VRPTW, in comparison to the traditional ACO and other heuristics.
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.
