Show simple item record

dc.contributor.authorOsaba, Eneko
dc.contributor.authorDel Ser, Javier
dc.contributor.authorSadollah, Ali
dc.contributor.authorBilbao, Miren Nekane
dc.contributor.authorCamacho, David
dc.date.accessioned2018-07-11T11:30:05Z
dc.date.available2018-07-11T11:30:05Z
dc.date.issued2018-10
dc.identifier.citationOsaba, Eneko, Javier Del Ser, Ali Sadollah, Miren Nekane Bilbao, and David Camacho. “A Discrete Water Cycle Algorithm for Solving the Symmetric and Asymmetric Traveling Salesman Problem.” Applied Soft Computing 71 (October 2018): 277–290. doi:10.1016/j.asoc.2018.06.047.
dc.identifier.issn1568-4946en
dc.identifier.urihttp://hdl.handle.net/11556/588
dc.description.abstractThe water cycle algorithm (WCA) is a nature-inspired meta-heuristic recently contributed to the community in 2012, which finds its motivation in the natural surface runoff phase in water cycle process and on how streams and rivers flow into the sea. This method has been so far successfully applied to many engineering applications, spread over a wide variety of application fields. In this paper an enhanced discrete version of the WCA (coined as DWCA) is proposed for solving the Symmetric and Asymmetric Traveling Salesman Problem. Aimed at proving that the developed approach is a promising approximation method for solving this family of optimization problems, the designed solver has been tested over 33 problem datasets, comparing the obtained outcomes with the ones got by six different algorithmic counterparts from the related literature: genetic algorithm, island-based genetic algorithm, evolutionary simulated annealing, bat algorithm, firefly algorithm and imperialist competitive algorithm. Furthermore, the statistical significance of the performance gaps found in this benchmark is validated based on the results from non-parametric tests, not only in terms of optimality but also in regards to convergence speed. We conclude that the proposed DWCA approach outperforms – with statistical significance – any other optimization technique in the benchmark in terms of both computation metrics.en
dc.description.sponsorshipThis work has been supported by the Basque Government through the ELKARTEK program (ref.KK-2015/0000080 And the BID3ABI project), as Well as by the H2020 programme of the European Commission (grant no. 691735)en
dc.language.isoengen
dc.publisherElsevier Ltden
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.titleA discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problemen
dc.typearticleen
dc.identifier.doi10.1016/j.asoc.2018.06.047en
dc.relation.projectIDinfo:eu-repo/grantAgreement/EC/H2020/691735/EU/REnaissance of Places with Innovative Citizenship and TEchnolgy/REPLICATEen
dc.rights.accessRightsembargoedAccessen
dc.subject.keywordsRouting problemsen
dc.subject.keywordsWater cycle algorithmen
dc.subject.keywordsTraveling salesman problemen
dc.subject.keywordsCombinatorial optimizationen
dc.journal.titleApplied Soft Computingen
dc.page.final290
dc.page.initial277
dc.volume.number71


Files in this item

Thumbnail

    Show simple item record

    Attribution-NonCommercial-NoDerivatives 4.0 InternationalExcept where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International