Travel demand systems match persons travel demand requirements to travel supply opportunities. The shortest path algorithm of E.W. Dijkstra is the core for this allocation. Using this algorithm in the year 1997, an in time optimally trip within a single modality based on timetables may be offered to consumers. The in 1997 running travel demand systems could be characterised as single-preference (time), uni-modal (within a single modal) and static (based on timetables). In this report functional and technical requirements have been specified with respect to the future of travel demand systems. Besides a minimum travel time, travellers know other interests which they want to be incorporated into their trip, such as costs, comfort or a sustainable environment. In addition, it seems useful to employ and combine several modalities into one trip (chain management) which better fulfils consumers' trip demands. Finally, trips should not only be based on timetables but should also be based on actual dynamic traffic information. These functional requirements are worked out in an example. (A)
Samenvatting