| Literature DB >> 35198680 |
Wadi Khalid Anuar1,2, Lai Soon Lee2,3, Stefan Pickl4.
Abstract
The dataset for Multi Depot Dynamic Vehicle Routing Problem with Stochastic Road Capacity (MDDVRPSRC) is presented in this paper. The data consist of 10 independent designs of evolving road networks ranging from 14-49 nodes. Together with the road networks are the Damage file (DF) for each corresponding road network. The DF simulates the damage level of roads within the networks due to a disaster source, thus affecting travel time and road capacity. We applied this data to test our proposed algorithm and validate our proposed model. This dataset served as an addition to the Vehicle Routing Problem (VRP) datasets that specifically addressed the road capacity problem during a disaster from an epicentre and could be used for other applications that constitute chaotic events and compromised road networks.Entities:
Keywords: Chaotic event; Disaster; Humanitarian operations; Multi depot routing problem; Road capacity
Year: 2022 PMID: 35198680 PMCID: PMC8844765 DOI: 10.1016/j.dib.2022.107901
Source DB: PubMed Journal: Data Brief ISSN: 2352-3409
Parameters and Variables for Presented Dataset adopted from ([1]).
| Parameters | |
|---|---|
| connecting node set | |
| depot set | |
| shelter set | |
| set of edges | |
| demand of emergency node or shelter | |
| set of vehicles | |
| maximum capacity of vehicles after replenishment at depot | |
| deterministic road capacity | |
| damage unit sustained by edge (i,j) | |
| cost incurred if edge | |
| time travelled of edge | |
| road network in the form of Graph G | |
Fig. 1Flowchart of python file “LOAD_INTS_DAMG_V5.py” to extract data from selected test instance and respective DF.
Fig. 2Visualization of Road Network based on Undirect Incomplete Graph.
Fig. 3Simulating Earthquake Tremor and Computing Damage Unit for Each Road (The Value of Road Capacity Changes Dynamically for Dynamic and Stochastic Problem).
Test Instances.
| Instance | Depot | Shelter | Nodes | Total Demand | Road Capacity |
|---|---|---|---|---|---|
| D3N8S3 | 3 | 3 | 8 | 550 | 6,7,8 |
| D4N11S4 | 4 | 4 | 11 | 550 | 6,7,8 |
| D4N30S10 | 4 | 10 | 30 | 1650 | 6,7,8 |
| D5N13S5 | 5 | 5 | 13 | 650 | 6,7,8 |
| D6N16S6 | 6 | 6 | 16 | 950 | 6,7,8 |
| D7N18S7 | 7 | 7 | 18 | 1250 | 6,7,8 |
| D8N20S8 | 8 | 8 | 20 | 1350 | 6,7,8 |
| D8N22S9 | 8 | 9 | 22 | 1600 | 6,7,8 |
| D9N25S10 | 9 | 10 | 25 | 1650 | 6,7,8 |
| D9N30S10 | 9 | 10 | 30 | 1650 | 6,7,8 |
| Subject | Applied Mathematics |
| Specific subject area | Vehicle Routing Problem in Operations Research |
| Type of data | Table |
| Image | |
| Network Figure | |
| How data were acquired | All test instances presented are simulated and the respective Damage Files (DFs) are generated based on these instances. This simulated dataset is inspired and derived from the 2015 Nepal Earthquake, reported by news reports, independent reports and scholarly articles, from which the information are gathered. Additionally, the geographical map of Nepal and the earthquake epicentre of the earthquakes are referred to when generating a concept instance. From the concept instance, other instances are developed with varying degrees of complexities to allow for sensitivity analysis. A related research |
| Data format | Raw |
| Parameters for data collection | Parameters such as node placements and number of special nodes as well as road network are purposely varied in ways that would allow for sensitivity analysis. Some parameters are also derived from assumptions made for the model of the problem in deriving costs and time travels. ( |
| Description of data collection | A simulated road network on each instance is designed and developed based on observing the challenges reported during the event. The development of the networks is driven by the objectives in highlighting these challenges such that different scenarios could be simulated by ranging the instance from a simple instance to a high complexity instance in terms of computation effort. Assumptions were made when placing the nodes, the edges/ roads and determining the road capacities of the road. From the graph theory, the road networks are designed as an undirected, incomplete, connected graph to represent more realistic road networks. Furthermore, the earthquake tremor is assumed to be dispersed radially, with the radius chosen based on the Fibonacci sequence. The damage level of an edge is assumed to be correlated to the number of intersections observed between the radial tremor lines and the edge. The road capacity and damage value are determined such that the values can be served as initial values suitable for the dynamic and stochastic version of the problem applied. ( |
| Data source location | Dataset was designed and revamped from collective ideas in two institutions, local (Universiti Putra Malaysia) and abroad (University of Bundeswehr Munich) in an office environment with portable equipment. |
| Data accessibility | The data is accessible through Mendeley Data Repository |
| Repository name: MDDVRPSRCV1_Test_Instance | |
| Data identification number: | |
| Direct URL to data: | |
| Instructions for accessing these data: Dataset is accessible through the link given above. From there instructions are listed to download and configure the data. | |
| Related research article | Some of the test instances in the proposed dataset are applied in the research paper: |
| W. K. Anuar, L. S. Lee, H.-V. Seow, S. Pickl, A multi-depot vehicle routing problem with stochastic road capacity and reduced two-stage stochastic integer linear programming models for rollout algorithm, Mathematics 9 (2021). | |
| to validate the model and solution algorithm proposed. |