Stochastic maximal covering location problem with floating population

Stochastic maximal covering location problem with floating population

0.00 Avg rating0 Votes
Article ID: iaor200970304
Country: South Korea
Volume: 26
Issue: 1
Publication Date: Mar 2009
Journal: Korean Management Science Review
Authors: ,
Keywords: heuristics: genetic algorithms
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.

Reviews

Required fields are marked *. Your email address will not be published.