TSP-D-Instances: Instances and some solutions
Authors/Creators
- 1. Erasmus School of Economics, Erasmus University Rotterdam
- 2. Rotterdam School of Management, Erasmus University Rotterdam
Description
This release contains the same files as the previous release, consisting of instances for the Travelling Salesman Problem with Drone (TSP-D).
This minor update now also includes exact solutions for the instances up to and including size 7, generated by our Mixed Integer Programming solver.
These instances and the obtained solutions are discussed in the working paper Optimization Approaches for the Traveling Salesman Problem with Drone, which can be obtained at http://papers.ssrn.com/sol3/papers.cfm?abstract_id=2639672
This data set is shared under the Creative Commons Attribution-ShareAlike 4.0 International license. The preferred method of attribution in scientific research is a citation of our first paper. When our paper is accepted this file will be updated with a proper biographical entry.
Files
TSP-D-Instances-1.1.zip
Files
(4.8 MB)
| Name | Size | Download all |
|---|---|---|
|
md5:bde23a159cbb08ccd79c14144460cb45
|
4.8 MB | Preview Download |
Additional details
Related works
- Is supplement to
- https://github.com/pcbouman-rsm/TSP-D-Instances/tree/1.1 (URL)