| Summary: | 碩士 === 華梵大學 === 工業管理學系碩士班 === 92 === This research focuses on how to efficiently generate the service region for specified service supporting points within reasonably computational time. In order to enhance the competitiveness of chain stores, an informa-tion system is developed based on the heuristic optimal service region al-gorithm.
Minimum Spanning Tree (MST for short) is first applied to find the connected tree graph, which contains the information of minimum cost among service supporting points and service demanding points. Then, quantity of service, combined with delivery cost, is considered to assign demanding points to supporting points. Finally, convex hulls on these de-manding points of each service supporting point form the optimal service regions.
To evaluate the performance of the proposed research, cost of delivery and error of quantity of service are taken into considerations. Simulations on thousands of testing cases are performed in order to analysis the effi-ciency of proposed research.
|
|---|
