| 摘要 |
PROBLEM TO BE SOLVED: To find a route to provide an optimal face of a two-section communication ticket in a commutation ticket issue system utilizing a computer. SOLUTION: A section file, which expresses how long the business kilometers are from a station at a starting point and whether that station is a connection station with the other section or not and a train fare file expressing a fare for every business kilometer is registered in a host computer. The stations to get on/off the train in first and second sections and via information inputted by a dealer A are transmitted to the host computer. When the data are received, in the host computer, the section file is read, the route relation of two sections is checked and the error check in the case of crossing or non-connecting two sections is performed. Further, the combination of stations to get on/off the train of other two patterns is found from the input stations to get on/off the train, the route to provide the optimal (lowest) fare is determined out of that combination and the commutation ticket is issued.
|
