Abstract
This paper presents a solution methodology to solve the heterogeneous vehicle routing problem with time windows (HVRPTW). This problem appears when a limited fleet of vehicles, characterized by different capacities, fixed costs and variable costs, is available for serving a set of customers which have to be visited within a predefined time window. The objective is to perform the route design minimizing the total fixed vehicle costs and distribution costs and satisfying all problem constraints. The problem is solved using an Ant Colony System (ACS) algorithm which has been successfully applied to combinatorial optimization problems. Moreover, to improve the performance of the ACS on the HVRPTW, a hybridized ACS with local search, called memetic ACS algorithm is proposed where the local search is performed by a variable neighborhood Tabu Search algorithm. Experiments are conducted on sets of benchmark instances from the scientific literature to evaluate the performance of the proposed algorithm. The results show that the algorithm has a good performance on the HVRPTW. In particular, out of the 80 instances, it obtained 65 new best solutions and matched 6 within reasonable computational times.
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.
