Routing system, routing method, and routing program

摘要: To provide a technique for obtaining multipoint-to-multipoint route search processing with rational amount of calculation. When information indicating start point and destination is requested, an objective function described as mixed integer programming problem (MIP) in which the set "minimization maximum value obtained by dividing actual required time all requests shortest time". Then, from initial state, prospective routes are gradually added, MIP repeatedly solved, thereby suppressing explosion number candidate routes. A new searched use at certain when repetition ended, giving priority to has high usage alternative route. At this time, having minimum cost equal or more than best solution that been added but not used preceding removed prospective. In updating candidates, sure be remained, making it possible value, result calculation reduced.