Public Transportation Algorithm for an Intelligent Routing System.

Auteur(s)
Gangoiti, A.G. Otaegui, O. Linaza, M.T. Arbelaitz, O. & Vansteenwegen, P.
Jaar
Samenvatting

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.

Publicatie aanvragen

13 + 6 =
Los deze eenvoudige rekenoefening op en voer het resultaat in. Bijvoorbeeld: voor 1+3, voer 4 in.

Publicatie

Bibliotheeknummer
C 46682 (In: C 46669 CD-ROM) /72 /73 /71 / ITRD E852366
Uitgave

In: ITS in daily life : proceedings of the 16th World Congress on Intelligent Transport Systems (ITS), Stockholm, Sweden, September 21-25, 2009, 8 p.

Onze collectie

Deze publicatie behoort tot de overige publicaties die we naast de SWOV-publicaties in onze collectie hebben.