RT Book, Section
T1 On efficiently solving the vehicle routing problem with time windows using the bat algorithm with random reinsertion operators
A1 Osaba, Eneko
A1 Carballedo, Roberto
A1 Yang, Xin She
A1 Fister, Iztok
A1 Lopez-Garcia, Pedro
A1 Del Ser, Javier
AB An evolutionary and discrete variant of the Bat Algorithm (EDBA) is proposed for solving the Vehicle Routing Problem with Time Windows, or VRPTW. The EDBA developed not only presents an improved movement strategy, but it also combines with diverse heuristic operators to deal with this type of complex problems. One of the main new concepts is to unify the search process and the minimization of the routes and total distance in the same operators. This hybridization is achieved by using selective node extractions and subsequent reinsertions. In addition, the new approach analyzes all the routes that compose a solution with the intention of enhancing the diversification ability of the search process. In this study, several variants of the EDBA are shown and tested in order to measure the quality of both metaheuristic algorithms and their operators. The benchmark experiments have been carried out by using the 56 instances that compose the 100 customers Solomon’s benchmark. Two statistical tests have also been carried out so as to analyze the results and draw proper conclusions.
PB Springer Verlag
SN 1860-949X
YR 2018
FD 2018
LK https://hdl.handle.net/11556/2625
UL https://hdl.handle.net/11556/2625
LA eng
NO Osaba , E , Carballedo , R , Yang , X S , Fister , I , Lopez-Garcia , P & Del Ser , J 2018 , On efficiently solving the vehicle routing problem with time windows using the bat algorithm with random reinsertion operators . in Studies in Computational Intelligence . Studies in Computational Intelligence , vol. 744 , Springer Verlag , pp. 69-89 . https://doi.org/10.1007/978-3-319-67669-2_4
NO Publisher Copyright: © Springer International Publishing AG 2018.
DS TECNALIA Publications
RD 28 jul 2024