Planning Base Station Location for the UMTS
Network
Sami AMARA, Hatem BOUJEMAA and Mohamed SIALA
Higher School of Communications of Tunis
TECHTRTA research unit
sami.amara@gmail.com, {boujemaa.hatem, mohamed.siala}@supcom.rnu.tn
Abstract—The planning of the second generation mobile net-
work can be carried out in two distinct stages. The first stage sets
out to determine the position of the base stations so as to ensure
a total coverage. The second step aims to attribute frequency
bands to the base stations in a view to responding to a given
traffic requirement. Such a method is no longer adequate for the
planning of the base stations location in UMTS as it is based only
on the signal prediction and does not take into account the traffic
distribution, the signal quality and the power control mechanism.
In this paper we present different discrete optimization models
and algorithms aimed at supporting the decisions in the process
of planning where to locate new base stations for the UMTS
networks.
I. I NTRODUCTION
The success in terms of mobile communication services has
caused service purveyors to embark on enormous investment.
Given the high costs and dearth or paucity of radio resources,
an incisive and effective planning of mobile networks has
become an urgent necessity. Further, the rapid increase in
networks size and number of users has mandated the use of
effective quantitative methods to back up decisions related to
the position of base station. The advent of third generation
systems, such as UMTS (Universal Mobile Telecommunica-
tion System), has also made the need for such methods quite
evident to date on account of the system intricacy as well as
the number of parameters that should be considered [1] [2].
The planning of the second generation cellular systems,
endorsing the TDMA access technique, is often made easier by
sub-dividing it into two different yet related tasks. These are
coverage planning and frequency planning which are guided
by coverage and a capacity criterion, respectively [1] [3]. As
far as the coverage planning is concerned, the base stations
(BSs) are positioned in such a way that the signal power
remains quite high in the zone to be served. This stage deploys
only propagation models to predict the signal levels amid
the Hata model. Concerning the frequency planning, a set
of channels is to be assigned for each BS while taking into
account the traffic conditions and the measured service quality
as the Signal-to-Interference Ratio (SIR). Taking cognizance
of W-CDMA air interface of UMTS, the two-phase method is
inappropriate for two reasons, namely, the bandwidth is jointly
used by all active connections and no real frequency allocation
is strictly required. The access scheme permits the flexible use
of radio resources alongside the capacity of each cell which
is not limited beforehand by a fixed channel allocation as it
exists in the TDMA systems. Noteworthy is that the capacity
depends on the real interference levels which are relevant for
determining realizable SIR values. Traffic distribution and BS
positions are contingent on these SIR values [4] [5] [6].
The present article comprises five sections including the
introduction. Section II contains the main points of radio
planning for BS location in UMTS. Within this section, the
adopted basic model will be detailed, taking into account the
two principal mechanisms of power control. Section III will
sketch out four algorithms: two heuristic algorithms (Add
and Remove) and two other meta-heuristics (TS and TS-
RW). Section IV focuses on the results obtained with realistic
instances. Finally, section V puts forward the concluding
remarks.
II. M ODELS FOR BASE STATIONS LOCATION
UMTS [7] refers to a norm defined by the World Ad-
ministrative Radio Conference (WARC) of the International
Telecommunications Union (ITU). It stands for a shift in
both the services and the speed of transfer from the second
generation to the third generation (3G). Frequency Division
Duplexing (FDD) and Time Division Duplexing (TDD) are the
two access schemes that are used within the spectrum assigned
for the UTMS norm. Relevant in CDMA is its flexibility in the
use of radio resources [3]. Theoretically speaking, the number
of simultaneous connections for each cell is limitless. The
radio resources are dynamically given according to the levels
of interference and traffic distribution. This glaringly implies
an increased complexity in the planning process. Due to the
multi-path propagation, the interference of orthogonal signals
within wireless environment cannot be overlooked. The SIR
is given by [8]:
Precived
SIR = SF (1)
αIin + Iout + η
where Precived is the received power from the signal,
Iin is the interference caused by transmitted signals by the
same BS (intra-cell interference), Iout is the interference due
to the transmitted signals (inter-cell interference), α is the
factor of orthogonality loss (0 < α < 1), η is the thermal
noise power and SF is the spreading factor. A simple and
generally adopted model assumes that the interference due to
the neighboring cells can be approximated as a fraction as
f fraction of the interference induced by other transmissions to BSj , 0 otherwise. The basic model used in the uplink is as
within the same cell. SIR can, hence, be expressed as follows: follows:

Precived
SIR = SF (2) Pm Pn Pm
Iin (1 + f ) min j=1 cj yj +λ i=1 j=1 ui g1ij xij (3)

As far as SIR is concerned, the thermal noise power s.t.

is omitted as we assume that it is much smaller than the
interference. This simplified model is precise when the traffic m
distribution is homogeneous among the cells. It becomes,
X
xij i∈I (4)
however, inadequate in the other cases where the contribution j=1
to the inter-cell interference varies from one cell to another. xij ≤ yj i ∈ I, j ∈ S (5)
The commonly used f values are comprised between 0.3 and
xij , yj ∈ {0, 1} i ∈ I, j ∈ S. (6)
0.5. Two hypotheses are adopted for the simplification of this
first study: The illustrated model does not present a limit on the power.
i. First hypothesis: each connection is assigned for a BS. To resolve such, the constraint (7) is added:
As a result, we will not take into account the soft-
handover that permits a mobile terminal to be simul- Ptarget
xij ≤ Pmax yj (7)
taneously tied up to a set of BSs. It should be noted, gij
however, that our hypothesis, seen from a simplification
perspective, is conservative because the soft-handover where Pmax is the maximum emission power and
tends to increase the SIR values. One way to account for Ptarget /gij corresponding to the release power required by
this phenomenon is to include a supplemantary margin the mobile station within T Pi to guarantee the Ptarget power
on SIR constraints (i.e., to choose the SIR level that is in the j site. By using the formula (2) for nonnull values of
upper than SIRmin). the parameter f , the constraint SIR > SIRmin can then be
ii. Second hypothesis : the number of available spreading rewritten for each connection as illustrated below:
codes is bigger than the number of the connections
Precived
assigned to whatsoever BS. Such hypothesis is clearly SF ≥ SIRmin (8)
Iin (1 + f )
satisfied in the up-link direction on account of the big
number of the non-orthogonal codes. which is equivalent to:

A. Basic model Iin SF

≤ (9)
UMTS service is deployed to cover a zone. Assuming a Precived SIRmin (1 + f )
set of sites S = {1, ..., m} where a BS could be installed In a mechanism of power-based PC, the received power
for each S element having cj cost of installation associated within the BS of each mobile station in a TP which is assigned
to each j condidate site, such as j ∈ S. A set of test points to it is equal to Ptarget . The quality constraint
(TPs) I = {l, ..., n} is equally given. Each T Pi∈I can be Pn amounts
to imposing an upper bound on the number i=1 ui xij of
deemed a center where an indicated quantity of traffic di connections that can be assigned to that BS [8]. Specifically,
(in Erlang) is requested and where a certain level of service we have:
(measured in terms of SIR) should be guaranteed [5]. The
required number of simultaneously active connections for T Pi n
X SF
signaled by ui proves to be a function of the traffic request, that ui xij ≤ +1 (10)
SIRmin (1 + f )
is, ui = Φ(di ).The definition of the Φ function is a degree of i=1
liberty of the planning process. It can simply correspond to the for f = 0.4, SF = 128, and SIRtarget = 6dB, we obtain a
average number of active connections or to the number of non- higher limit of 23, 97 on the maximum number of connections
exceeded simultaneous connections with a given probability [9]. signal quality constraints of signal can be rewritten as:
p. The rate of connection movement can also be taken into
account. The propagation information is equally presumed to n
X
be known. Particularly gij , 0 < gij < 1, is the propagation ui xij ≤ 23yj (11)
factor of radio link between T P i, 1 ≤ i ≤ n, and the j-th i=1
condidate site , 1 ≤ j ≤ m, The matrice of propagation gain The resultant basic model will be:
G = [gij ]1≤i≤n,1≤j≤m is estimated according to the approx-
imative propagation models such as that proposed by Hata.
Pm Pn Pm
Tow classes of decision variables are taken into consideration, ui g1ij xij
min j=1 cj yj +λ i=1 j=1 (12)
namely, yi which equals to 1 if a BS is installed within site j,
0 otherwise, and xij whose value is 1 if the T Pi is assigned s.t.
 C. Enhanced Model with SIR-based PC
m
X Adopting a mechanism of Signal to Interference Ratio (SIR)
xij i∈I (13) based PC presupposes a mathematical model more included in
j=1 the power of emission pi , required to connect each affected
TPi∈I to a candidate site [10]. Such a power must be regarded
 
gij Pmax
xij ≤ min 1, yj i ∈ I, j ∈ S (14) as an explicit variable. Indeed, if TPi is assigned to the site j,
Ptarget
Xn pi is not taken to be equal to Ptarget /gij in order to guarantee
ui xij ≤ 23yj j∈S (15) a received given power Ptarget for each active connection. In
i=1 the presence of a mechanism of SIR-based PC, the values
xij , yj ∈ {0, 1} i ∈ I, j ∈ S. (16) of emission power pi can be freely selected provided that
it does not exceed the maximum power capacity Pmax . The
B. Enhanced model with power-based Power Control (PC) constraint (7) is substituted by 0 ≤ pi ≤ Pmax . The SIR level
of each active connection should not be lower than a prescribed
In the presence of a mechanism of power-based PC, the ther- SIRtarget . By ignoring the n new variables of power pi , the
mal noise η is omitted as in other studies which concentrate core model is then as in (3)-(6) except in the second term of
on this type of PC mechanism (see for example [8]). Further, the objective function, 1/gij is replaced by the real emission
for each site candidate, j ∈ S, the constraint of signal quality power pi . The quality constraint is now:
can be expressed as follows:
pg
Pn Pm i ij ≥ SIRtarget xij (24)
Ptarget h=1 uh ghj t=1 ph xht − pi gij + η
Pn Pm Ptarget ≥ SIRmin yj (17)
h=1 uh ghj t=1 ght xht − Ptarget Note that the pi gij is the power of the received signal within
BSj of TPi . If TPi is assigned to site j (i.e. xij = 1), this con-
Where Ptarget is, by definition, the received power of each straint makes sure that the level of SIR of the corresponding
assigned TP. If the BS is installed in a site j ∈ S (i.e., yj = 1), connection is rather high. Thus, the model of SIR based PC
the SIR value in j must be higher than SIRmin . The term of amounts to the following mathematical program:
double summation expresses the total power received within
the site j of all the TPh∈I , whose received power, Ptarget Pm Pn Pm
of the signal in question, is subtracted. Multiplying the two min j=1 cj yj +λ i=1 j=1 ui pi xij (25)
inequality sides (17) by the denominator on its left side and s.t.
dividing the left and right members by Ptarget , we obtain for m
X
each j ∈ S candidate site the quality of the signal which can xij i∈I (26)

be expressed by: j=1

xij ≤ yj i ∈ I, j ∈ S (27)
! n m
!
n X
m X X pi gij
X ghj xij uh ghj ph xht − pi gij + η ≤ i ∈ I, j ∈ S (28)
1 ≥ SIRmin yj uh xht − 1 (18) SIRmin
ght h=1 t=1
h=1 t=1
xij , yj ∈ {0, 1} i ∈ I, j ∈ S (29)
0 ≤ pi ≤ Pmax i ∈ I. (30)
Therefore, the emphasized model, assuming a mechanism
of power-based PC, amounts to the non-linear mathematical
program given below:
III. O PTIMIZATION ALGORITHMS
Since the location models of BSs in UMTS proposed in
Pm Pn Pm 1
min j=1 cj yj + λ i=1 j=1 ui gij xij (19) the preceding section takes into account a great number of
parameters, the location problem has an exponential com-
s.t. plexity. To obtain good approximate solutions in a reasonable
duration of calculation, we opted for the implementation four
m
algorithms. The two first are heuristic algorithms, selected for
X their simplicity. The two last, which are used to mitigate the
xij i∈I (20)
lack of effectiveness of the two first, are algorithms of local
j=1
  research, ”tabu algorithms” (meta-heuristic).
gij Pmax
xij ≤ min 1, yj i ∈ I, j ∈ S (21)
Ptarget A. Heuristic Algorithms
n Xm
!
X ghj 1 This first class of algorithms is inspired by the principle
yj uh xht − 1 ≤ j∈S (22) of glutton research. Such a method solves the problem of
t=1
ght SIRmin
h=1 optimization in an iterative way. Two algorithms are proposed:
xij , yj ∈ {0, 1} i ∈ I, j ∈ S. (23) Algorithm Add and Algorithm Remove. In the algorithm Add,
base stations are iteratively added to the solution. Any solution
is characterized by a vector of assignment y as for a station
j, yj = 1 if it is activated, yj = 0 otherwise. We associate to
each site an assignment vector of test points x, as for a TPi ,
xij = 1 if it is affected to the site j and xij = 0 otherwise,
knowing that a TPi can be connected to only one station. Thus,
the couple (x, y) describes a solution. The starting solution is
empty. With each iteration, we add a station to the current
solution. The station chosen, not yet activated, is that which
ensures the maximum of connections and which returns a
minimal cost of assignment. This can be formulated by the
following objective function:
n X
m m
X X
Fobj = uh xht − ω ct yt (31)
h=1 t=1 t=1
Pn Pm
The first term ( h=1P t=1 uh xht ) is the traffic currently
m
covered. The second (ω t=1 ct yt ) is the total cost of installa-
tion of the base stations in the selected sites. ω is a parameter
of compensation used to give a priority to the first objective.
The algorithm Remove takes as a starting solution where
all sites are activated. The base stations are iteratively desacti-
vated. With each iteration, we select the station which covers
the least of connections and then we assess the solution. If the
latter returns a value upper than that of the objective function,
the elected station is removed. The objective function used by
this algorithm is the same one as that of the Algorithm Add.
It desactivates the base stations with each iterative treatment
until we do not cover any totality of the test points.
B. Tabu Approach
The two algorithms presented in the preceding section are
constructive methods. The latter have as a disadvantage the
incapacity to see beyond the local optimum. Hence, the need
for a meta-heuristic research. Tabu research is a meta-heuristic
guided by a procedure of local research in order to cover
the space of solutions [11] [12] [13]. We will present in
the following sections two tabu algoritmes for the problem
of localization. The first algorithm (Tabu Search (TS)) is a
traditional tabu algorithm. The second algorithm (Tabu Search
with Random Walk (TS-RW)) integrates a procedure of a
random walk to diversify the research. A configuration is given
by a couple of binary vectors (x, y), checking the constraints
of the used model of localization. The space of research S is
then composed of all the combinations of these couples.
The neighborhood N of our problem is defined in the
following way: let’s assume (x, y), (x0 , y 0 ) ∈ S, (x, y) and
(x0 , y 0 ) are neighbor ((x0 , y 0 ) ∈ N ((x, y))) if they differ by
the value of only one variable from vector y. What results from
it is that from a configuration (x, y), it is possible to obtain a
nearby configuration (x0 , y 0 ) while adding or removing a site
(yj : 0 → 1or1 → 0) of y such as (x0 , y 0 ) remains realizable.
The movement is then characterized by the activation or the
desactivation of the site j. It is this index which will be
characterized as the attribute of the movement. The evaluation
of the vicinity is based on a function of evaluation which is
nothing other than the difference between the values of the
objective function of (x, y) and its elected neighbor (x0 , y 0 ).
This approach can be written formally as follows: let’s assume
(x, y) ∈ S and ((x0 , y 0 ) ∈ N ((x, y))). The evaluation of
(x0 , y 0 ) is assigned by the following function:
eval((x, y), (x0 , y 0 )) = (Fobj ((x0 , y 0 )) − Fobj ((x, y))) (32)
The Tabu list is among the strong points of this method. A
good management of such a list is required to guarantee a good
performances. Once a movement is applied to go from (x, y) to
(x0 , y 0 ), the index of the changed variable (which corresponds
to either the activated or desactivated site) is registered in the
Tabu List. Therefore, the reverse movement (corresponding to
the initial configuration) is denied for the k next iterations
of the algorithm. The ending condition of tabu algorithms is
carried out by a number of iteration L. This means that a tabu
procedure can execute L movements at each call.
IV. S IMULATION RESULTS
In order to evaluate the performances of our algorithms,
we have deployed the propagation model of Hata [14] to
calculate the attenuations produced in the case of uplink. For
each instance of calculation, we consider a rectangular service
area Lg × W , a number m of the condidate site to localize
the omnidirectionnal antennas and a number n of TP. Using a
pseudo-random generator of number, each site j and each test
point i is assigned to a position in the service surface with
a uniform distribution. The matrice of gain G is obtained by
employing the formulas of Hata which give the attenuation A
in dB due to the signal propagation. Specifically speaking, the
attenuation for the urban sectors is given by:
Au = 69.55 + 26.16log(F ) − 13.82log(Hb ) − [(1.1log(F ) − 0.7)Hm
−(1.56log(F ) − 0.8)] + [44.9 − 6.55log(Hb )] log(d) (33)
Where F as the signal frequency in MHz, Hb and Hm are
the height in meters of the base stations and the mobile stations
and d as the distance in km. The attenuation formula within
a rural zone is given by:
Ar = Au − 4.78 [log(F )]2 + 18.33log(F ) − 35.94 (34)
In this article, the localization model used to validate the
performances of the different algorithms is the simplified
model of power control based on the power (19)-(23). In
our calculations, we have considered three families of uplink
instances. For each family we have a service area of 500×500
meters, 1 × 1 kilometer and 1.5 × 1.5 kilometers, respec-
tively. The different instances of these families are generated
randomly. Two gain matrices are estimated for each family,
using the formulas of Hata model (urban and rural) with the
following values: Hb = 10m, Hm = 1m, F = 2000M Hz.
The small instances are characterized by a service area
of 500 × 500 meters, a set of condidate sites m = 2, and

Fig. 1. Number of connexions per Fig. 2. Number of connexions per
site (SU-4: Add procedure) site (SU-4: TS-Add procedure)
n = 100 test points whose number of connection ui = 1.
The service area of the instances having average size is of
1 × 1 kilometer, the number of condidate sites m = 150 and
n = 500 test points whose connection number ui = 1. The
instances of great size are characterized by a service area of
1.5 × 1.5 kilometers, a number of condidate sites m = 250,
and n = 1000 test points whose connection number ui = 1.
The installation cost of the base stations is the same for all
the sites as well as for all the instances, SIRmin = 0.03125
and Pmax = 30dBm.
In all the reported experiences in this paper, we have given
a great priority to the coverage of the connections required at
each test point in our calcualtions. This is interpreted by the
overevaluation of the first term of the objective function. The
weight ω of the second term which designates the total cost
of the installation has a value worth 1/(cm), knowing that the
installation cost of one base station is the same for all the sites
(∀ site j; cj = c = 1).
Results of small size family instances are illustrated in
TABLE I. All the algorithms proved to satisfy the 100
required connections. The first five instances are generated
by the means of Hata formulas for urban areas (SU), and
the five instances of the second table are produced by Hata
formulas for rural areas (SR). TS and TS-RW are applied to
each iteration of Add and Remove procedures. For the small
instances, we deployed the length of the tabu list was equal
to T L = 10. While Add and Remove procedures do not
guarantee an optimum solution, all the connections are covered
and the number of installed stations do not exceed 1 those
generated by TS. In contrast, Add and Remove do not give
any optimum solution of the required connections ( see Fig.1
and Fig.2). We can notice that the Tabu procedures in their
affectation for this instance reach the global optimum.
The solution found for the medium instances satisfy the
required connections (see TABLE II), except two instances
produced by Add algorithm (Medium Urban MU-4 and Med-
imum Rural MR-1). The number of sites installed by the
algorithms differ by 5 stations at maximum, with a TL length
T L = 10. Tabu algorithms yield more optimum solutions
compared to the constructive procedures (see Fig.1 and Fig.2).
They do not differ between them enormously, whereas TS-RW
offers the best solution.
Tabu algorithms are applied in the great size instances to
each 10 iterations of constructive algorithm. The size of TL is
Fig. 3. Number of connexions per Fig. 4. Number of connexions per
site (MU-1: Add procedure) site (MU-1: TS-Add procedure)
Fig. 5. Number of connexions per Fig. 6. Number of connexions per
site (LU-1: Add procedure) site (LU-1: TS-Add procedure)
LT = 50. The latter is selected as the greatest in this instance
family compared to those preceded in order to give more
importance to the diversification process, allowing thereby the
algorithms to cover all the solutions space. Unlike the other
instances (see TABLE III), the Add procedure failed to satisfy
the 1000 required connections in any instance. Tabu algorithms
yielded solutions that are more optimum (see Fig.5 and Fig.6).
V. C ONCLUSION
In this paper, we have tackled the poblem of planning
UMTS networks using the W-CDMA air interface by studying
the main elements that feature it. Focusing on the up-link, we
have presented discret optimization models for the UMTS BS
location problem by scrutinizing the signal quality constraint
and the PC mechanism for W-CDMA. As a solution to the
location problem, we have proposed four algorithms. These
are heuristic algorithms (Add, Remove) and meta-heuristics
(TS and TS-RW) for the local search.
R EFERENCES
[1] J. Cheung, M. Beach, and J. McGeehan, “Network planning for third-
generation mobile radio systems,” IEEE Communications Magazine, pp.
54–59, November 1994.
[2] E. Berruto, M. Gudmundson, R. Menolascino, W. Mohr, and
M. Pizarroso, “Research activities on UMTS radio interface, network
architectures, and planning,” IEEE Communications Magazine, pp. 82–
95, February 1998.
[3] M. Naghshineh and I. Katzela, “Channel assignment schemes for cellular
mobile telecommunication systems: A comprehensive survey,” IEEE
Personal Communications, vol. 3 (3), pp. 10–31, 1996.
[4] H. Sherali, M. Pendyala, and T. Rappaport, “Optimal location of
transmitters for micro-cellular radio communication system design,”
IEEE Journal on Selected Areas in Communications, vol. 14, no. 4,
pp. 662–673, 1996.
[5] K. Tutschku, “Demand-based radio network planning of cellular mobile
communication systems,” in Proceedings of the IEEE INFOCOM’98,
vol. 3, 1998, pp. 1054–1061.
[6] R. Mathar and T. Niessen, “Optimum positioning of base stations for
cellular radio networks,” Wireless Networks, pp. 421–428, 2000.
[7] A. Samukic, “UMTS universal mobile telecommunications system:
Development of standards for the third generation,” IEEE Transactions
on Vehicular Technology, vol. 47, no. 4, pp. 1099–1104, 1998.
 Add Remove TS (Add) TS (Remove) TS-RW (Add) TS-RW (Remove)
SU-1 5 100% 6 100% 6 100% 5 100% 5 100% 5 100%
SU-2 6 100% 6 100% 5 100% 6 100% 5 100% 5 100%
SU-3 6 100% 6 100% 5 100% 5 100% 6 100% 5 100%
SU-4 7 100% 7 100% 5 100% 5 100% 5 100% 6 100%
SU-5 7 100% 5 100% 6 100% 5 100% 5 100% 6 100%
SR-1 5 100% 6 100% 5 100% 5 100% 5 100% 5 100%
SR-2 5 100% 5 100% 5 100% 5 100% 5 100% 5 100%
SR-3 6 100% 6 100% 5 100% 5 100% 5 100% 5 100%
SR-4 5 100% 5 100% 5 100% 5 100% 5 100% 5 100%
SR-5 5 100% 5 100% 5 100% 5 100% 5 100% 5 100%
TABLE I
R ESULTS OBTAINED WITH A DD , R EMOVE , TS AND TS-RW FOR SMALL SIZE URBAN (SU) AND RURAL (SR) INSTANCES . F ROM LEFT TO RIGHT:
MINIMUM NUMBER OF BS S INSTALLED AND THE POURCENTAGE OF TP S AFFECTED

Add Remove TS (Add) TS (Remove) TS-RW (Add) TS-RW (Remove)

MU-1 28 100% 27 100% 24 100% 24 100% 23 100% 24 100%
MU-2 27 100% 28 100% 24 100% 25 100% 24 100% 24 100%
MU-3 27 100% 27 100% 25 100% 25 100% 24 100% 25 100%
MU-4 29 98.8% 28 100% 25 100% 25 100% 25 100% 24 100%
MU-5 26 100% 28 100% 23 100% 23 100% 24 100% 25 100%
MR-1 27 99% 26 100% 23 100% 22 100% 22 100% 21 100%
MR-2 23 100% 25 100% 22 100% 23 100% 22 100% 22 100%
MR-3 24 100% 23 100% 22 100% 24 100% 22 100% 23 100%
MR-4 26 100% 25 100% 22 100% 24 100% 22 100% 23 100%
MR-5 25 100% 27 100% 23 100% 22 100% 22 100% 22 100%
TABLE II
R ESULTS OBTAINED WITH A DD , R EMOVE , TS AND TS-RW FOR MEDIUM SIZE URBAN (MU) AND RURAL (MR) INSTANCES . F ROM LEFT TO RIGHT:
MINIMUM NUMBER OF BS S INSTALLED AND THE POURCENTAGE OF TP S AFFECTED

Add Remove TS (Add) TS (Remove) TS-RW (Add) TS-RW (Remove)

LU-1 47 97.5% 63 100% 46 100% 46 100% 45 100% 46 100%
LU-2 50 94.5% 57 100% 47 100% 46 100% 46 100% 46 100%
LU-3 48 98.6% 58 100% 45 100% 45 100% 46 100% 45 100%
LU-4 49 99% 61 100% 44 100% 45 100% 45 100% 45 100%
TABLE III
R ESULTS OBTAINED WITH A DD , R EMOVE , TS AND TS-RW FOR LARGE SIZE URBAN (LU) INSTANCES . F ROM LEFT TO RIGHT: MINIMUM NUMBER OF
BS S INSTALLED AND THE POURCENTAGE OF TP S AFFECTED

[8] A. M. Viterbi and A. J. Viterbi, “Erlang capacity of a power controlled

CDMA system,” IEEE Journal on Selected Areas in Communications,
vol. 11, no. 6, pp. 892–900, 1993.
[9] E. Amaldi, A. Capone, and F. Malucelli, “Base station configuration
and location problems in UMTS networks,” in Proceedings of the 9th
International Conference on Telecommunication Systems, Modeling and
Analysis, 2001, pp. 341–348.
[10] R. D. Yates, “A framework for uplink power control in cellular radio
systems,” IEEE Journal on Selected Areas in Communications, vol. 13,
pp. 1341–1347, 1995.
[11] F. Glover, “Tabu search - Part I,” ORSA Journal on Computing, vol. 1,
no. 3, pp. 190–206, 1989.
[12] ——, “Tabu search - Part II,” ORSA Journal on Computing, vol. 2, no. 1,
pp. 4–32, 1990.
[13] F. Glover and M. Laguna, Tabu search. Kluwer Academic Publishers,
1997.
[14] M. Hata, “Empirical formula for propagation loss in land mobile radio
service,” IEEE Trans. on Vehicular Technology, vol. 29, pp. 317–325,
1980.