Please use this identifier to cite or link to this item:
https://accedacris.ulpgc.es/jspui/handle/10553/162414
| Title: | Dataset of the paper "Modeling and solving an integrated periodic vehicle routing and capacitated facility location problem in the context of solid waste collection" | Authors: | González Landín, Begoña Rossit, Diego Méndez, Máximo Frutos, Mariano |
Keywords: | Waste management Periodic capacitated vehicle routing problem Capacitated facility location problem |
Issue Date: | 2025 | Publisher: | Zenodo | Description: | <p dir="auto">This dataset includes the instances used in the paper:</p> <p dir="auto">González, B., Rossit, D., Frutos, M., Méndez, M<em>.</em> Modeling and solving an integrated periodic vehicle routing and capacitated facility location problem in the context of solid waste collection. <em>Ann Oper Res</em> <strong>350</strong>, 979–1015 (2025). https://doi.org/10.1007/s10479-025-06626-4</p> <p dir="auto">For each instance/folder there are three files:</p> <p dir="auto"><em>waste.txt</em>: it includes, from left to right the id, the geographic coordinates (latitude, longitude) and the waste generation rate (in cubic meters) per day of each collection point.</p> <p dir="auto"><em>times.txt</em>: it includes the travelling times (in minutes) between collection points in a from/to table.</p> <p dir="auto"><em>containers.txt</em>: it includes the description of the bin combinations considered in the paper: id, capacity (in cubic meters), service time (in minutes) and weekly cost (in US$). This file is common to all instances/folders.</p> | URI: | https://accedacris.ulpgc.es/jspui/handle/10553/162414 | Other Identifiers: | https://doi.org/10.5281/zenodo.17986740 oai:zenodo.org:17986740 |
Source: | Annals of Operations Research, 350, 979–1015, (2025-12-19) | Rights: | info:eu-repo/semantics/openAccess Creative Commons Attribution 4.0 International https://creativecommons.org/licenses/by/4.0/legalcode |
| Appears in Collections: | Datasets ULPGC |
Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.