Abstract
This paper proposes a method for solving Capacitated Vehicle Routing Problem with Hard Time Window (CVRPTW). This method combines the traditional Genetic Algorithm which is frequently used in solving NP-hard problems and the idea of Chaotic Search together to work for a better result. The Logistic Mapping mechanism is adopted to create more new genes and contribute to diversity. In addition, Tabu search is used for accelerating the whole method and jumping out of local optimal. We confirmed that the proposed method shows good performance for CVRPTW. Furthermore, by comparing with the results calculated without chaotic search and some up-to-date best results in Solomon Benchmark, the proposed method is testified to be feasible and applicable.
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.
