tsppddl
The Traveling Salesman Problem with Pickups, Deliveries and Draft Limits
Science Score: 67.0%
This score indicates how likely this project is to be science-related based on various indicators:
-
✓CITATION.cff file
Found CITATION.cff file -
✓codemeta.json file
Found codemeta.json file -
✓.zenodo.json file
Found .zenodo.json file -
✓DOI references
Found 2 DOI reference(s) in README -
✓Academic publication links
Links to: zenodo.org -
○Academic email domains
-
○Institutional organization owner
-
○JOSS paper metadata
-
○Scientific vocabulary similarity
Low similarity (10.3%) to scientific vocabulary
Keywords
Repository
The Traveling Salesman Problem with Pickups, Deliveries and Draft Limits
Basic Info
Statistics
- Stars: 16
- Watchers: 3
- Forks: 9
- Open Issues: 0
- Releases: 1
Topics
Metadata Files
README.md
They did not check the draft very thoroughly... Picture by Mike McBay licensed under the Creative Commons Attribution 2.0 Generic (CC BY 2.0) license
TSPPDDL
This is a solver for a generalisation of the Traveling Salesman Problem, namely the Traveling Salesman Problem with Pickups, Deliveries and Draft Limits.
It's a problem that stems from maritime applications, where the draught of a ship is a function of the quantity of cargo it currently has on board. Because of its current draught, a ship might or might not be able to visit a certain port.
This software includes: * An exact branch-and-cut algorithm * Constructive heuristics * K-opt recombination heuristics * Tabu search meta-heuristics (neighbourhood defined by 3-opt moves) * An implementation of the subgradient method with lagrangean relaxation
It also contains many test instances derived from the TSPLIB and a script to generate new ones. More info is contained in the other README.md files present in the subfolders.
Citation
If you use this software, please cite the following paper:
bib
@article{malaguti2018travelling,
title={The {Traveling Salesman Problem} with Pickups, Deliveries, and Draft Limits},
author={Malaguti, Enrico and Martello, Silvano and Santini, Alberto},
journal={{Omega}},
volume=74,
pages={50--58},
year=2018,
doi={10.1016/j.omega.2017.01.005}
}
You can also cite this repository via Zenodo.
bib
@misc{tsppddl_github,
title={The Traveling Salesman Problem with Pickups, Deliveries and Draft Limits},
author={Santini, Alberto},
date={2022-12-30},
howpublished={Github repository},
doi={10.5281/zenodo.7494135},
url={https://github.com/alberto-santini/tsppddl/}
}
License
This software is distributed under the GNU General Public License v3, as detailed in LICENSE.txt.
Owner
- Name: Alberto Santini
- Login: alberto-santini
- Kind: user
- Location: Barcelona, Spain
- Website: http://santini.in/
- Repositories: 38
- Profile: https://github.com/alberto-santini
Citation (CITATION.cff)
cff-version: 1.2.0
message: "If you use this software, please cite it as below."
authors:
- family-names: "Santini"
given-names: "Alberto"
orcid: "https://orcid.org/0000-0002-0440-0357"
title: "Exact and heuristic methods for the TSP with Pickup, Deliveries, and Draught Limits"
version: 1.0
doi: 10.5281/zenodo.7494135
date-released: 2022-12-30
url: https://github.com/alberto-santini/tsppddl
preferred-citation:
type: article
authors:
- family-names: "Malaguti"
given-names: "Enrico"
- family-names: "Martello"
given-names: "Silvano"
- family-names: "Santini"
given-names: "Alberto"
orcid: "https://orcid.org/0000-0002-0440-0357"
doi: 10.1016/j.omega.2017.01.005
journal: "Omega"
title: "The Traveling Salesman Problem with Pickups, Deliveries, and Draft Limits"
year: 2018
volume: 74
start: 50
end: 58