An algorithm based on a granular tabu search for the solution of a vehicle routing problem by considering heterogeneous fleet
DOI:
https://doi.org/10.22395/rium.v13n25a6Keywords:
vehicle routing problem, heterogeneous fleet, granular tabu searchAbstract
This paper considers the vehicle routing problem with heterogeneous fleet (VRPH), which tries to determine the routes to be constructed for satisfying the demand of the customers by considering a fleet of vehicles with different capacities and costs not homogeneous. The main objective is to minimize the distance traversed by the different vehicles. This paper proposes a metaheuristic algorithm based on a granular tabu search for the solution of the problem. The algorithm allows infeasible solutions by penalizing them by a dynamic factor which is adjusted during the search. Computational experiments on real instances for a Colombian company show that the proposed algorithm is able to obtain, within short compuÂting times, better solutions for those obtained by the current traditional method for planning the routesDownloads
Download data is not yet available.
How to Cite
Puenayán, D. E., Londoño, J. C., Escobar, J. W., & Linfati, R. (2015). An algorithm based on a granular tabu search for the solution of a vehicle routing problem by considering heterogeneous fleet. Revista IngenierÃas Universidad De MedellÃn, 13(25), 81–98. https://doi.org/10.22395/rium.v13n25a6
Issue
Section
Articles
License
The total or partial reproduction of the contents of the journal for educational, research, or academic purposes is authorized as long as the source is cited. For reproduction for other purposes, express authorization from the Sello Editorial Universidad de MedellÃn is required.