Abstract
This article considers the heterogeneous fleet vehicle routing problem, as a variant of a well-known transportation problem: the vehicle routing problem. In order to solve this particular routing problem, a variable neighborhood search with a threshold accepting mechanism is developed and implemented. The performance of the algorithm was compared to other algorithms and tested on datasets from the available literature. Computational results show that our proposed algorithm is competitive and generates new best solutions.
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.
