| 摘要 |
PROBLEM TO BE SOLVED: To accelerate efficient merchandise delivery by giving necessary information to a computer system so as to automatically decide an optimum delivery route and the kind and the number of necessary delivering vehicle concerning delivery to plural customers. SOLUTION: An application program stored in a storing part 17 is read into an arithmetic processing part 12 to execute. A dividing means 31 divides plural stores, which are arranged on a map and receive the request of merchandise delivery, into delivery areas decided from their distribution by applying a mesh method and a combining means 32 combines a mesh including a store and road data in map data so as to decide the optimum delivery route based on minimizing a delivery distance by a method of single stroke drawing. After deciding the optimum delivery route, a delivery vehicle deciding means 33 divides the delivery route by assigning a proper delivery vehicle by a direction from a starting point to a finish point so as to decide the kind and the number of necessary delivery vehicles. A traveling route of each delivery vehicle is decided as an assigned section. |
