Team Orienteering Problem with Time Windows instances (Righini)

Benchmark instances for the orienteering problem with time windows, with coordinates, service durations, scores and time windows.

npx keepset fetch ku-leuven-toptw-righini-instances

Fetch and preview this dataset on this page, or download the result as JSON. The command line fetches it without a browser.

Overview

Id	`ku-leuven-toptw-righini-instances`
Namespace	`ku-leuven`
Aliases	`toptw-righini-instances`
Category	`tasks/v1`
Kind	tasks
Domain	Orienteering
Subjects	operations-research
Tags	prize, deadline, location, duration, travelTime
Licence	not recorded by the source
Catalogue	`keepset` 1.33.0

#	URL	Status	Retrieved	Read by recipe	Pinned snapshot	SHA-256
0	https://www.mech.kuleuven.be/en/mim/op	live	2026-10-19
1	https://www.mech.kuleuven.be/en/mim/op/instances/righiniTOPTW1	live	2026-10-19	yes

G. Righini, M. Salani (2006). Dynamic programming for the orienteering problem with time windows. Technical Report 91, Dipartimento di Tecnologie dell'Informazione, Universita degli Studi di Milano, Crema.
G. Righini, M. Salani (2008). New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51(3), 155-170. doi:10.1002/net.20212

toptw to tasks/v1, as a crossmap crosswalk.

Rule	From	To	Direction
move	`meta`	`meta`	both
move	`nodes[].id`	`nodes[].id`	both
move	`nodes[].close`	`nodes[].deadline`	both
move	`nodes[].profit`	`nodes[].prize`	both
move	`nodes[].x`	`nodes[].x`	both
move	`nodes[].y`	`nodes[].y`	both
move	`nodes[].service`	`nodes[].service`	both
move	`nodes[].open`	`nodes[].open`	both

Instances	29

Survey id	or-1
Time unit	abstract units