유동인구를 고려한 확률적 최대지역커버문제
Stochastic Maximal Covering Location Problem with Floating Population
최명진(국방대학교); 이상헌(국방대학교)
26권 1호, 197~208쪽
초록
In this paper, we study stochastic maximal covering location problem considering floating population. Traditional maximal covering location problem assumed that number of populations at demand point is already known and fixed. In this manner, someone who try to solve real world maximal covering location problem must consider administrative population as a population at demand point. But, after observing floating population, appliance of population in steady-state is more reasonable. In this paper, we suggest revised numerical model of maximal covering location problem. We suggest heuristic methodology to solve large scale problem by using genetic algorithm.
Abstract
In this paper, we study stochastic maximal covering location problem considering floating population. Traditional maximal covering location problem assumed that number of populations at demand point is already known and fixed. In this manner, someone who try to solve real world maximal covering location problem must consider administrative population as a population at demand point. But, after observing floating population, appliance of population in steady-state is more reasonable. In this paper, we suggest revised numerical model of maximal covering location problem. We suggest heuristic methodology to solve large scale problem by using genetic algorithm.
- 발행기관:
- 한국경영과학회
- 분류:
- 경영학