최대 기대 응답 시간을 최소화 하기 위한 일반화된 수요-설비 할당문제

Abstract

This research presents a decision model for demand-queueing facility allocation. The objective function of model is to minimize the maximum response time (waiting time in a queue plus travelling time from demand point to facility location) by allocating the demand points to fixed facilities. This research deals with a general case when the number of facility is more than two which is NP-hard. This thesis suggests 3 heuristic algorithm where (1) heuristic focuses on the balance facilities arrival rate by sacrificing the travelling time. Also (2) heuristic focuses on the shortest distance allocation without balancing the facilities service rates. Finally, (3) heuristic tries to the balance the facility’s waiting time and the shortest distance allocation. The first experiment considers the comparison between the optimal solution and heuristic algorithms in case of 2-facility problem. The second experiment has been performed for more than two facilities problem. The experimental results show that the heuristic (2) outperforms the other algorithms for all cases. The experimental results show that the effect of transportation time is more importance than the waiting time in order to reduce the maximum expected response time.