See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/235758257

Genetic Algorithm Implementation on GIS-based Access Point Placement Problem Solution

Conference Paper · November 2012

CITATIONS READS

0 272

1 author:

Bayu Primawan
Universitas Sanata Dharma
11 PUBLICATIONS   3 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

GIS-based Access Point Placement Problem Solution View project

Monitoring system in rural area based on wireless sensor network and internet of things View project

All content following this page was uploaded by Bayu Primawan on 16 December 2019.

The user has requested enhancement of the downloaded file.

 AIT RESEARCH SHOWCASE, Nov 2012

Genetic Algorithm Implementation on GIS-based

Access Point Placement Problem Solution
Augustinus B. Primawan, ICT, SET
st113106@ait.ac.th

Abstract Objective
• To find the best location for access point server
Locating facilities into the best place is a problem in decision making. Spatial decision
problem is a problem to find the best site to fit single or multiple criteria with the highest • To get percentage of coverage area of the access point
values. The best location depends on criteria like the optimal distance, optimal cost,
population density, etc. It can be optimized by one criterion like optimal distance or adding
service
various criteria combination like optimal cost and optimal distance together and so on.
Genetic algorithm, in concept, is based on natural genetic and evolutionary mechanisms
working on population of solution. Genetic algorithm start with a set of solution called Scope and Limitation
population. A chromosome will represent its solution. As a common procedure in GIS, site
selection search the best site that is required to minimize the impact of development and to
raise the planning efficiency. Problem of optimization needs to assess various candidate • Type of the access point is Outdoor
options. Genetic algorithm can perform solution for location allocation problem. The
algorithm finds out the best location based on the fitness function of the minimum total • Power output (EIRP) is 35 dBm
distance. By using python programming language, integration of genetic algorithm and
geographic information system has been successfully implemented. Crossover modification
• Antenna gain is 12 dBi
will gives different result to the optimal location solution. • Range of access point is 300 m
Keywords: genetic algorithm, python programming, GIS, location allocation problem • Calculates radius length of the access point
solution.
• No fading calculation, channel assignment.

Methodology
Results and Evaluation

The coverage area of initial access points is

1,219,664 square meters

The coverage area of the access point

server is 282,618 square meters with
single point crossover.

Conclusion and Future Work

• Genetic algorithm can perform solution for location allocation problem.
• The algorithm finds out the best location based on the fitness function of the
minimum total distance. The coverage area of the access
• By using python programming language, integration of genetic algorithm and point server is 1,097,542 square
geographic information system has been successfully implemented. meters with multipoint crossover
• Modification of the crossover operator will gives different optimal solution
which increase the coverage area of the access point.
• For future study, this optimization technique can be defined not only distance
constraint but also maximum coverage area, and high of the antenna.
Performing multiple objective need extended technique of the genetic
algorithm such as Multi Objectives Genetic Algorithm.

View publication stats