TY - JOUR
T1 - A probabilistic granular tabu search for the distance constrained capacitated vehicle routing problem
AU - Bernal, Jose
AU - Escobar, John Willmer
AU - Paz, Juan Camilo
AU - Linfati, Rodrigo
AU - Gatica, Gustavo
N1 - Publisher Copyright:
© 2018 Inderscience Enterprises Ltd.
PY - 2018
Y1 - 2018
N2 - We address the well-known distance constrained capacitated vehicle routing problem (DCVRP) by considering Euclidean distances, in which the aim is to determine the routes to be performed to fulfil the demand of the customers by using a homogeneous fleet. The objective is to minimise the sum of the variable costs associated with the distance travelled by the performed routes. In this paper, we propose a metaheuristic algorithm based on a probabilistic granular tabu search (pGTS) by considering different neighbourhoods. In particular, the proposed algorithm selects a neighbourhood by using a probabilistic discrete function, which is modified dynamically during the search by favouring the moves that have improved the best solution found so far. A shaking procedure is applied whenever the best solution found so far is not improved for a given number of iterations. Computational experiments on benchmark instances taken from the literature show that the proposed approach is able to obtain high quality solutions, within short computing times.
AB - We address the well-known distance constrained capacitated vehicle routing problem (DCVRP) by considering Euclidean distances, in which the aim is to determine the routes to be performed to fulfil the demand of the customers by using a homogeneous fleet. The objective is to minimise the sum of the variable costs associated with the distance travelled by the performed routes. In this paper, we propose a metaheuristic algorithm based on a probabilistic granular tabu search (pGTS) by considering different neighbourhoods. In particular, the proposed algorithm selects a neighbourhood by using a probabilistic discrete function, which is modified dynamically during the search by favouring the moves that have improved the best solution found so far. A shaking procedure is applied whenever the best solution found so far is not improved for a given number of iterations. Computational experiments on benchmark instances taken from the literature show that the proposed approach is able to obtain high quality solutions, within short computing times.
KW - DCVRP
KW - Distance constrained capacitated vehicle routing problem
KW - Metaheuristic algorithms
KW - PGTS
KW - Probabilistic granular tabu search
KW - VRPs
KW - Vehicle routing problems
UR - http://www.scopus.com/inward/record.url?scp=85052661184&partnerID=8YFLogxK
U2 - 10.1504/IJISE.2018.094267
DO - 10.1504/IJISE.2018.094267
M3 - Article
AN - SCOPUS:85052661184
SN - 1748-5037
VL - 29
SP - 453
EP - 477
JO - International Journal of Industrial and Systems Engineering
JF - International Journal of Industrial and Systems Engineering
IS - 4
ER -