Abstract
Vehicle routing problem(VRP) is important combinatorial optimization problems which have received considerable attention in the last decades. The optimization of vehicle routing problem is a we ll-known research problem in the logistics distribution. In order to overcome the prematurity of Ant Colony Algorithm (ACA) for logistics distribution routing optimization, a hybrid algorithm combining improved ACA with Iterated Local Search (ILS) is proposed. The proposed algorithm adjusts the pheromone trail to balance the convergence rate and diversification of solutions self-adaptively. The exponential entropy is used to control the path selection and pheromone updating strategy. Combining with ILS is to avoid local best solutions and accelerate the search. Computational results denote the efficiency of the proposed algorithm on some standard bench mark problems.
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.
