Show simple item record

dc.contributor.authorOsaba, Eneko
dc.date.accessioned2020-02-17T14:58:54Z
dc.date.available2020-02-17T14:58:54Z
dc.date.issued2020-04
dc.identifier.citationOsaba, Eneko. “Benchmark Dataset for the Asymmetric and Clustered Vehicle Routing Problem with Simultaneous Pickup and Deliveries, Variable Costs and Forbidden Paths.” Data in Brief 29 (April 2020): 105142. doi:10.1016/j.dib.2020.105142.en
dc.identifier.issn2352-3409en
dc.identifier.urihttp://hdl.handle.net/11556/877
dc.description.abstractIn this paper, the benchmark dataset for the Asymmetric and Clustered Vehicle Routing Problem with Simultaneous Pickup and Deliveries, Variable Costs and Forbidden Paths is presented (AC-VRP-SPDVCFP). This problem is a specific multi-attribute variant of the well-known Vehicle Routing Problem, and it has been originally built for modelling and solving a real-world newspaper distribution problem with recycling policies. The whole benchmark is composed by 15 instances comprised by 50–100 nodes. For the design of this dataset, real geographical positions have been used, located in the province of Bizkaia, Spain. A deep description of the benchmark is provided in this paper, aiming at extending the details and experimentation given in the paper A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy (Osaba et al.) [1]. The dataset is publicly available for its use and modification.en
dc.description.sponsorshipEneko Osaba would like to thank the Basque Government for its funding support through the EMAITEK and ELKARTEK.en
dc.language.isoengen
dc.publisherElsevier Inc.en
dc.rightsAttribution 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/*
dc.titleBenchmark dataset for the Asymmetric and Clustered Vehicle Routing Problem with Simultaneous Pickup and Deliveries, Variable Costs and Forbidden Pathsen
dc.typearticleen
dc.identifier.doi10.1016/j.dib.2020.105142en
dc.rights.accessRightsopenAccessen
dc.subject.keywordsOptimizationen
dc.subject.keywordsVehicle routing problemen
dc.subject.keywordsMulti-attribute routing problemen
dc.subject.keywordsNewspaper deliveryen
dc.subject.keywordsOperation researchen
dc.subject.keywordsTraveling salesman problemen
dc.subject.keywordsCombinatorial optimizationen
dc.journal.titleData in Briefen
dc.page.initial105142en
dc.volume.number29en


Files in this item

Thumbnail

    Show simple item record

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