Research on location problem of emergency service facilities based on genetic-simulated annealing algorithm Online publication date: Sun, 11-Jan-2015
by Changxi Ma; Yinzhen Li; Ruichun He; Bo Qi; Aixia Diao
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 5, No. 2, 2012
Abstract: The location problem is closely related to people's lives and property, and the harmonious development of society. Based on the discussion of location principle, to meet the demand of emergency rescue point as large, the mathematical model for location problem of emergency service facilities is established. And then the Genetic-Simulated Annealing Algorithm (GSAA) for solving this model is designed, which enriches searching behaviour in optimisation process, and has strong abilities of exploration and exploitation in large real search spaces. In this algorithm, genetic algorithm controls the search direction, and simulated annealing algorithm plays an important role in local optimum convergence. Case study shows that the algorithm is efficient, and it not only gets optimal location results quickly and accurately, but also clearly gets the afflicted points that are covered by the selected facilities. So the model and the algorithm have strong practicability.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook