Show simple item record

dc.contributor.authorOsaba, Eneko
dc.contributor.authorYang, Xin-She
dc.contributor.authorFister, Iztok
dc.contributor.authorDel Ser, Javier
dc.contributor.authorLopez-Garcia, Pedro
dc.contributor.authorVazquez-Pardavila, Alejo J.
dc.date.accessioned2018-05-22T10:49:17Z
dc.date.available2018-05-22T10:49:17Z
dc.date.issued2019-02
dc.identifier.citationOsaba, Eneko, Xin-She Yang, Iztok Fister, Javier Del Ser, Pedro Lopez-Garcia, and Alejo J. Vazquez-Pardavila. “A Discrete and Improved Bat Algorithm for Solving a Medical Goods Distribution Problem with Pharmacological Waste Collection.” Swarm and Evolutionary Computation 44 (February 2019): 273–286. doi:10.1016/j.swevo.2018.04.001.
dc.identifier.issn2210-6502en
dc.identifier.urihttp://hdl.handle.net/11556/556
dc.description.abstractThe work presented in this paper is focused on the resolution of a real-world drugs distribution problem with pharmacological waste collection. With the aim of properly meeting all the real-world restrictions that comprise this complex problem, we have modeled it as a multi-attribute or rich vehicle routing problem (RVRP). The problem has been modeled as a Clustered Vehicle Routing Problem with Pickups and Deliveries, Asymmetric Variable Costs, Forbidden Roads and Cost Constraints. To the best of authors knowledge, this is the first time that such a RVRP problem is tackled in the literature. For this reason, a benchmark composed of 24 datasets, from 60 to 1000 customers, has also been designed. For the developing of this benchmark, we have used real geographical positions located in Bizkaia, Spain. Furthermore, for the proper dealing of the proposed RVRP, we have developed a Discrete and Improved Bat Algorithm (DaIBA). The main feature of this adaptation is the use of the well-known Hamming Distance to calculate the differences between the bats. An effective improvement has been also contemplated for the proposed DaIBA, which consists on the existence of two different neighborhood structures, which are explored depending on the bat's distance regarding the best individual of the swarm. For the experimentation, we have compared the performance of our presented DaIBA with three additional approaches: an evolutionary algorithm, an evolutionary simulated annealing and a firefly algorithm. Additionally, with the intention of obtaining rigorous conclusions, two different statistical tests have been conducted: the Friedman's non-parametric test and the Holm's post-hoc test. Furthermore, an additional experimentation has been performed in terms of convergence. Finally, the obtained outcomes conclude that the proposed DaIBA is a promising technique for addressing the designed problem.en
dc.language.isoengen
dc.publisherElsevier B.V.en
dc.titleA Discrete and Improved Bat Algorithm for solving a medical goods distribution problem with pharmacological waste collectionen
dc.typejournal articleen
dc.identifier.doi10.1016/j.swevo.2018.04.001en
dc.rights.accessRightsembargoed accessen
dc.subject.keywordsBat algorithmen
dc.subject.keywordsMedical distributionen
dc.subject.keywordsRich vehicle routing problemen
dc.subject.keywordsCombinatorial optimizationen
dc.subject.keywordsTraveling Salesman Problemen
dc.journal.titleSwarm and Evolutionary Computationen
dc.page.final286
dc.page.initial273
dc.volume.number44


Files in this item

Thumbnail

    Show simple item record