Efficient genetic algorithms for optimising the location of discrete nodes to cover multiple demand points
by Thomas A. Wettergren; Russell Costa
International Journal of Metaheuristics (IJMHEUR), Vol. 4, No. 3/4, 2015

Abstract: Spatial location planning problems are notoriously complex computational problems. When the objective of the optimisation can be separated into a linear combination of subobjectives for each placed node, the problems are amenable to efficient mixed-integer linear programming methods. However, for more general objectives, the problems require metaheuristic techniques to solve. We demonstrate that additional efficiency can be gained when genetic algorithms are used for solving these problems if the genetic chromosome is encoded differently for dense problems vice sparse problems. The boundary for this dense/sparse distinction is analytically derived, and examples demonstrating the efficiency gains are shown for examples in both facility location and sensor network applications.

Online publication date: Fri, 29-Jan-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Metaheuristics (IJMHEUR):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your 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