|
Description: |
The shortest path problem is a well-known and widely studied problem of operational research. Although used in several areas, is in the area of transport, namely the determination of routes that the problem becomes more recognized. The existence of simple algorithms that solve the mono criterion problem with great efficiency leads most real problems to be modeled using a single criterion. The extent of the problem for the multi-criterion, where to each arc is assigned a vector of values, is often neglected at the expense of mono criterion version. The lack of application to real situations is mainly due to the difficulty in efficiently solving networks with a large number of arches or with a certain topology. Due to the difficulty in dealing with the set of criteria, which often may be competitors, it is essential a detailed study of the network. The algorithm should thus be developed according to the network. This seminar aims to present a real case of an application developed for Coimbra's public transport system, describing the experience of developing a multi criterion algorithm tailored to fit the client needs. Both the difficulties and the successes are revisited.
|
