Due to the high complexity of the required calculations, Intelligent Routing Systems have to apply latest operations research techniques to be ableto create routes efficiently. This paper proposes a solution to the MultiPath Orienteering Problem with Time Windows (MPOPTW), which includes multiple paths to move between locations. The main characteristics of MPOPTW are: the total collected score obtained by visiting locations has to be maximized; not all locations can be visited due to different constraints; andthe time required to move from one location to the next one varies according to the departure time, simulating public transportation.
Samenvatting