To go up to an entrance and exit of the station of destination in a short time after reaching the station.

To a line network data contained in the time table data of a CD-ROM 2, information on optimum car-getting-off car positions in incoming-side lines is added separately for each entrance and exit of each station, separately for each combination of an incoming-side line and an incoming direction, and an entrance and exit. When a search condition consisting of a start position, a destination, a scheduled data and time of departure is designated, and a search is directed by an operation part 6, an optimum route search portion 3 searches an optimum route which makes it possible to move from the start position up to the destination, according to the designated search condition, by a combination of walking and means of transportation using the road data and the time table data of the means of transportation of the CD-ROM 2, and its result is stored in a storage portion 4. Besides, concerning the station of destination on the optimum route, an incoming side line and an incoming direction at the station of destination on the optimum route, and an entrance and exit nearest to the destination are discriminated from the line network data, and information on an optimum car-getting-off car position in an incoming-side line is searched making the entrance and exit nearest to the destination an object, and is added to the optimum route information.