Benchmark dataset for the Asymmetric and Clustered Vehicle Routing Problem with Simultaneous Pickup and Deliveries, Variable Costs and Forbidden Paths.

Clicks: 242
ID: 96789
2020
Article Quality & Performance Metrics
Overall Quality Improving Quality
0.0 /100
Combines engagement data with AI-assessed academic quality
AI Quality Assessment
Not analyzed
Abstract
In 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 (Osaba et al.) [1]. The dataset is publicly available for its use and modification.
Reference Key
osaba2020benchmarkdata Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Osaba, Eneko;
Journal Data in brief
Year 2020
DOI
10.1016/j.dib.2020.105142
URL
Keywords
optimization combinatorial optimization multi-attribute routing problem newspaper delivery operation research traveling salesman problem vehicle routing problem

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.