確率的需要のある店舗群に対する最適拠点配置に関する研究

抄録

In this study, we illustrate a new practical approach to schedule the visiting routes for given stores having probabilistic maintenance demands. There are so many real situations like that. For example, an electric maintenance company has to visit the customer store in which electric equipment broke down, and to fix that. Though the maintenance company contracts with many customer stores, the stores should be visited on a certain day are a part of all stores. Besides, the company can't know whether when and where maintenance demand occurs. This problem is defined as the probabilistic TSP(PTSP). We solve the PTSP by some meta-heuristic algorithms. An optimal allocation problem of a new maintenance base is also solved by our proposed method.