| 摘要 |
<p>PURPOSE:To quickly produce an optimum schedule by calculating all available transportation routes after considering the transportation demand of the whole, and applying an efficient algorithm in its route. CONSTITUTION:Data related to a transportation demand such as the shipping/ receiving requesting quantity, the requesting time of a cargo generated in each spot is inputted to a storage device 5 by an input means 1. Subsequently, by a trip producing means 2, the transportation demand is expressed as the assembly of the trip corresponding to the operation of one vehicle, based on the loading capacity of one vehicle. Subsequently, by a route assembly producing means 3, the assembly of transfer routes is produced by connecting those which can be operated continuously by the same vehicle in these trips. A selecting means 4 selects a partial assembly so as to contain all the trips by just one piece respectively from the assemblies of these transfer routes. In such a manner, the efficient transportation schedule as a whole can be produced, and also, the transportation schedule production processing itself can be executed systematically and efficiently.</p> |
