| 摘要 |
<p>PROBLEM TO BE SOLVED: To accurately select a taxi which reaches a user position in the shortest time from among many radio taxis. SOLUTION: The vehicle positions of many radio taxis 17 are managed and a plurality of taxis which are close to the user position are selected first and requested to answer whether or not they can be allocated. For each of radio taxis 17 answering that allocation is possible, expected time necessary for each taxi to reach the user position is calculated and the taxi having the shortest time is selected. Consequently, a radio taxi 17 which is close to the user position, however takes a long time to actually reach there is never selected and then the radio taxi 17 which actually reaches the user position in the shortest time is selected.</p> |
