Escolar Documentos
Profissional Documentos
Cultura Documentos
M T S O (H U B )
M T S O (H U B )
R a d io to w e r
M T S O (H U B )
M T S O (H U B )
M T S O (H U B )
C e ll s ite
M T S O (H U B )
Road
HOME
River
M TSO
Residential
L a n d lin e
Lake
T e le p h o n e
PSTN
Wild life
habitat
(mx − cx 2 ) 2 + (my − cy 2 ) 2 +
M +
(mx − cxi ) + (my − cyi ) .
2 2
Table 1: Locations of existing MTSOs and/or Cell access places since all points along the road or
Sites highways are considered feasible areas as long as
they are not in restricted areas. If it is mathematically
MTSOs and/or Cell formulated, it is trivial and time consuming. Since the
x-axis y-axis
Sites
further the distance from the optimum, the worse the
1 3 6 objective value, it is economical to select a potential
2 2 -2 location where it is closest to the optimal point.
Cell site
satisfying all constraints. Note that the objective In the second step, the location of the optimal
value of the best fitting location is greater than that of solution is either within or out of a restricted area.
the optimal location. However, the best fitting location must not be located
Case 2: finding the best fitting location for MTSO in a restricted area, and should have easy
with the candidate sites selection technique accessibility. The suggested method is time efficient
because it does not need to define the constraints in
For case 2, first of all, the problem with the objective the mathematical model. Most of all, the real problem
only is solved using the Solver® and it found the becomes much simpler since the method only
optimal solution. The coordinate of the optimal considers the areas around the optimal location.
location is (1.11, 1.89) with the objective value of
32.90. Comparing this to the solution of case 1 which CONCLUSIONS AND FUTURE RESEARCH
is 36.86, the objective value has decreased. In
general, if constraints are added in a linear or non- The location of a MTSO in a cellular
linear programming model, the objective value is telecommunication system is affected by factors such
increased in a minimization problem and decreased in as the distances between each component, the area
a maximization problem [7]. restrictions and the accessibility. The restricted areas
and potential areas were identified using GIS site
The optimal location for case 2 is not feasible selection technique and a non-linear programming
because it violates the constraints of restricted areas model was developed to find an optimal solution with
and accessibility issues. If the optimal point moves to the above factors. The model was solved and
a feasible point considering the accessibility issues, analyzed with two cases: without the candidate sites
the besting fitting location is the closest to a road, selection technique and with the candidate sites
which is in candidate areas, and the point satisfies all selection technique.
constraints. Figure 7 shows the optimal location, and Base on the test results, case 2 with the candidate
the best fitting location. The coordinate for the best sites selection technique generated a better solution.
fitting location is around a point (4, 1.5), which Since the suggested method does not consider the
generates the objective value of 35.27. Comparing restricted areas in a mathematical model, the method
Figure 6 and 7, the best fitting location of case 1 is is time efficient and cost effective in terms of
the area close to the road in the left hand area. computation effort.
However, the best fitting location of case 2 is close to
the road in the right hand area. Both locations are An extension of this research would be to further test,
feasible, but the final selected locations are different verify and validate the suggested model with a real
and so are the objective values, 41.22 and 35.27 for cellular telecommunication network design. Also, the
case 1 and case 2, respectively. Since the objective is proposed methodology can be extended to solve the
REFERENCES