One Day Tours |
A hotel needs a program to assist any tourist who wants to visit N different places (). Every day the tourist leaves the hotel, visits M places (may be fewer on the last day) and comes back to the hotel.
Let us consider that the hotel is identified by 0, the places to visit by consecutive positive integers and the available roads by triples (i,j,d), where d represents the road length (in km) and .
The program must schedule the visits according to the following
constraints:
== Tourist
i --
M visits a day --
Day 1: [
dfh] -
fvp - [
dpp] - ..... -
lvp - [
dth]
. . . . . .
===
where, for each day tour
0 1 10 0 2 10 0 3 10 0 4 10 1 2 10 3 4 15 4 5 10 -3 0 1 2 1 2 2 2 3 2 3 1 2 0 4 2 0 5 2 -2
== Tourist 1 -- 3 visits a day -- Day 1: [10] - 3 - [15] - 4 - [10] - 5 - [20] Day 2: [10] - 1 - [10] - 2 - [10] === == Tourist 2 -- 2 visits a day -- Day 1: [2] - 1 - [4] - 4 - [2] Day 2: [4] - 2 - [2] - 3 - [4] Day 3: [2] - 5 - [2] ===