الفهرس 
Literature SurveyOnly 14 pages are availabe for public view
 |  | from | 122 |  |  |
| | | from | 122 | | |
Abstract
Using public transportation means such as railways requires pre-planning to get an optimal trip planning. Trip planning provides the sequence of the successive trips from departure station to arrival station. The aim is to minimize the total travel time of the passenger. Also, minimizing the waiting time that the passenger will spend between these trips is considered. Several techniques based on the shortest path algorithms are used to perform this task. It is done according to the passenger’s specification such as the departure station and the arrival station of the trip. Trip planning in public transportation network differs from in a network of roads as an example. Because any trip is not available all the day, it is only available at a certain period of time. If the passenger does not catch it at the right time, the trip can be treated as deleted from the network. This property can be called the time dependency of the trip and also the path.