Abstract
Research on optimization of the vehicle routing problem with time windows (VRPTW) is one of the most significant and promising areas of investigation in ant colony system (ACS), since ACS is used to find a near-optimum solution for a discrete optimization problem. As VRPTW is the typical case of discrete optimization problem, in this paper, an ACS was proposed to optimize a VRPTW problem. The numerical experiments of ACS were implemented in the VRPTW problem. The optimized results of ACS are favorably compared with other optimization methods'
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
