Team Orienteering Problem instances (Chao and Tsiligirides sets)

Benchmark instances for the team orienteering problem, with node coordinates and scores, from the KU Leuven orienteering page.

npx keepset fetch ku-leuven-team-orienteering-chao-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-team-orienteering-chao-instances`
Namespace	`ku-leuven`
Aliases	`team-orienteering-chao-instances`
Category	`tasks/v1`
Kind	tasks
Domain	Orienteering
Subjects	operations-research
Tags	prize, location, 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/ChaoTOP4	live	2026-10-19	yes

T. Tsiligirides (1984). Heuristic methods applied to orienteering. Journal of the Operational Research Society 35(9), 797-809. doi:10.1057/jors.1984.162
I.-M. Chao, B. L. Golden, E. A. Wasil (1996). The team orienteering problem. European Journal of Operational Research 88(3), 464-474. doi:10.1016/0377-2217(94)00289-4
I.-M. Chao, B. L. Golden, E. A. Wasil (1996). A fast and effective heuristic for the orienteering problem. European Journal of Operational Research 88(3), 475-489. doi:10.1016/0377-2217(95)00035-6

top to tasks/v1, as a crossmap crosswalk.

Rule	From	To	Direction
move	`meta`	`meta`	both
move	`nodes[].id`	`nodes[].id`	both
move	`nodes[].score`	`nodes[].prize`	both
move	`nodes[].x`	`nodes[].x`	both
move	`nodes[].y`	`nodes[].y`	both
move	`nodes[].role`	`nodes[].role`	both

Instances	60

Survey id	or-0