I don't know how to solve this problem in Answer Set Programming:
- There is a weighted graph representing 12 locations with distances to each other
- I have k cars, each car can carry 1 person at time and a car travels at a speed of 60 km/h
- a person wants to arrive at their destination within the set time, stay two hours and return to the starting point
I want to solve the problem of finding an assignment of persons to cars that
- take everyone to their destination
- minimize the total km performed by cars .