A Granular Tabu Search Algorithm for a Real Case Study of a Vehicle Routing Problem with a Heterogeneous Fleet and Time Windows
Visualitza/Obre
Cita com:
hdl:2117/110052
Tipus de documentArticle
Data publicació2017-10
EditorOmniaScience
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial 3.0 Espanya
Abstract
Purpose: We consider a real case study of a vehicle routing problem with a heterogeneous fleet
and time windows (HFVRPTW) for a franchise company bottling Coca-Cola products in
Colombia. This study aims to determine the routes to be performed to fulfill the demand of the
customers by using a heterogeneous fleet and considering soft time windows. The objective is to
minimize the distance traveled by the performed routes.
Design/methodology/approach: We propose a two-phase heuristic algorithm. In the
proposed approach, after an initial phase (first phase), a granular tabu search is applied during the
improvement phase (second phase). Two additional procedures are considered to help that the
algorithm could escape from local optimum, given that during a given number of iterations there
has been no improvement.
Findings: Computational experiments on real instances show that the proposed algorithm is able
to obtain high-quality solutions within a short computing time compared to the results found by
the software that the company currently uses to plan the daily routes.
Originality/value: We propose a novel metaheuristic algorithm for solving a real routing
problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its
applicability and performance for solving NP-Hard Problems related with routing problems with
similar characteristics. The proposed algorithm was able to improve some of the current solutions
applied by the company by reducing the route length and the number of vehicles.
CitacióBernal, J.; Escobar, J. W.; Linfati, R. A Granular Tabu Search Algorithm for a Real Case Study of a Vehicle Routing Problem with a Heterogeneous Fleet and Time Windows. "Journal of Industrial Engineering and Management", Octubre 2017, vol. 10, núm. 4, p. 646-662.
Dipòsit legalB-28744-2008
ISSN2013-0953
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
2159-9926-1-PB.pdf | 1,648Mb | Visualitza/Obre |