| 摘要 |
<p>PROBLEM TO BE SOLVED: To plan a transportation program efficiently used by a transportation means. SOLUTION: The number of articles transportable for every transportation route is calculated (S104), based on the inventory of each transportation origin changed in real time and the transportation request amount of each destination, transportation vehicles having transported and on standby are allotted to transportation routes for transportation from one origin to one destination out of those having the number of transportable articles larger than the full load amount for the transportation vehicles in the descending order of quantity of transportable articles, in the descending order of transportation request amount and in the descending order of inventory (S114), and when transportation vehicles on standby are still present, the transportation vehicles on standby are allotted to transportation routes for transportation from plural origins to one or more destinations or from one or more origins to plural destinations out of those having the number of transportable articles larger than the full load amount for the transportation vehicles in the ascending order of sum of loading times and unloading times, in the descending order of the number of transportable articles, in the descending order of transportation request amount, and in the descending order of inventory (S118).</p> |
