On efficiently solving the vehicle routing problem with time windows using the bat algorithm with random reinsertion operators

Simple item page
dc.contributor.authorOsaba, Eneko
dc.contributor.authorCarballedo, Roberto
dc.contributor.authorYang, Xin She
dc.contributor.authorFister, Iztok
dc.contributor.authorLopez-Garcia, Pedro
dc.contributor.authorDel Ser, Javier
dc.contributor.institutionIA
dc.date.accessioned2024-07-24T11:56:27Z
dc.date.available2024-07-24T11:56:27Z
dc.date.issued2018
dc.descriptionPublisher Copyright: © Springer International Publishing AG 2018.
dc.description.abstractAn 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.en
dc.description.statusPeer reviewed
dc.format.extent21
dc.identifier.citationOsaba , 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
dc.identifier.doi10.1007/978-3-319-67669-2_4
dc.identifier.issn1860-949X
dc.identifier.urihttps://hdl.handle.net/11556/2625
dc.identifier.urlhttp://www.scopus.com/inward/record.url?scp=85033670782&partnerID=8YFLogxK
dc.language.isoeng
dc.publisherSpringer Verlag
dc.relation.ispartofStudies in Computational Intelligence
dc.relation.ispartofseriesStudies in Computational Intelligence
dc.rightsinfo:eu-repo/semantics/restrictedAccess
dc.subject.keywordsBat algorithm
dc.subject.keywordsCombinatorial optimization
dc.subject.keywordsDiscrete bat algorithm
dc.subject.keywordsTraveling salesman problem
dc.subject.keywordsVehicle routing problem with time windows
dc.subject.keywordsVRPTW
dc.subject.keywordsArtificial Intelligence
dc.titleOn efficiently solving the vehicle routing problem with time windows using the bat algorithm with random reinsertion operatorsen
dc.typebook part
Files