Program to be executed by the computer dispatch planning system, dispatch planning method, the dispatch planning method, and a computer-readable recording medium recording the program

摘要

PROBLEM TO BE SOLVED: To generate a save and efficient allocation plan for security vehicles based upon complicated restrictions such as use restrictions of the vehicles and restrictions of specification of use days and times or patrol order minimizing risk. ;SOLUTION: A weekly plan generation part 206a generates a schedule for vehicle allocation to bank branches, etc., to be patrolled every day by referring to the use restrictions of vehicles by time bands, deliveries in use and collection days and times that a collection destination specifies, etc., held in a delivery request storage part 204 and a restriction condition storage part 205 and then a day-of-the-week plan generation part 206b and assigns a supermarket, etc., to be patrolled on each day of the week to free times of the schedule. At this time, cash is distributed to the bank branches at as early time as possible after the start of the patrol and collected at as later time as possible and thus the amount of cash on each vehicle is made always necessary and irreducible to minimize the risk. Further, the patrol order and combination are optimized so that the travel distance of all the vehicles becomes minimum.;COPYRIGHT: (C)2003,JPO