Hazardous Team Orienteering Problem (HTOP): Benchmark Instances and Best Solutions

A 1.0 MB benchmark dataset for the Hazardous Team Orienteering Problem (HTOP) created by Daniele Ferone and last updated on 2026-05-20. It contains machine-readable instance files in JSON format and corresponding best-known solutions in CSV format. The material is provided to encourage further research on this optimization problem.

Use Cases

• Benchmarking new optimization algorithms based on the provided HTOP instances and best-known solutions.
• Developing heuristics for vehicle routing problems that incorporate hazardousness parameters mentioned in the description.
• Studying the impact of travel-time budgets and multiple vehicles on routing solutions.
• Comparing solution quality and computational performance against the reported best objective values.

Strengths

• Includes best-known solutions for the benchmark instances, providing a baseline for algorithm evaluation.
• Instance files contain specific parameters like vertex coordinates, customer profits, and hazardousness parameters.
• Data is provided in structured, machine-readable formats (JSON and CSV).
• Released under a permissive CC-BY-4.0 license for open research use.

Limitations

• Row count and the exact number of instances are unknown, which may limit suitability assessment.
• Column-level documentation is absent; field semantics must be inferred from the description or after download.
• Description metadata is limited; actual data quality and instance complexity require manual inspection.

Provenance

Source

figshare, author Daniele Ferone.

Collection Method

Likely generated for research purposes to serve as a benchmark.

Freshness

Last updated 2026-05-20 14:03:35; freshness should be verified.