Mathematical Problems in Engineering

Mathematical Problems in Engineering / 2012 / Article
Special Issue

Optimization Theory, Methods, and Applications in Engineering

View this Special Issue

Research Article | Open Access

Volume 2012 |Article ID 780637 | 14 pages |

Goal-Programming-Driven Genetic Algorithm Model for Wireless Access Point Deployment Optimization

Academic Editor: Jung-Fa Tsai
Received24 Feb 2012
Accepted08 May 2012
Published12 Jul 2012


Appropriate wireless access point deployment (APD) is essential for ensuring seamless user communication. Optimal APD enables good telecommunication quality, balanced capacity loading, and optimal deployment costs. APD is a typical NP-complex problem because improving wireless networking infrastructure has multiple objectives (MOs). This paper proposes a method that integrates a goal-programming-driven model (PM) and a genetic algorithm (GA) to resolve the MO-APD problem. The PM identifies the target deployment subject of four constraints: budget, coverage, capacity, and interference. The PM also calculates dynamic capacity requirements to replicate real wireless communication. Three experiments validate the feasibility of the PM. The results demonstrate the utility and stability of the proposed method. Decision makers can easily refer to the PM-identified target deployment before allocating APs.

1. Introduction

Appropriate wireless access point deployment (APD) is essential for ensuring seamless user communication. Optimal APD enables good telecommunication quality, balanced capacity loading, and optimal deployment costs. APD is a typical NP-complex problem [1] because it involves multiple decision objectives, such as budget [24], coverage [2, 58], interference [3, 4, 7], and dynamic capacity [1, 4, 69]. Furthermore, these objectives usually contradict each other [7]. For example, the number of APs is usually positively related to the wireless signal coverage rate and telecommunication reliability [1]. However, more APs increase deployment costs. These conflicting criteria should be considered simultaneously when solving APD problems [9, 10].

In the last decade, many studies have attempted to solve APD optimally by considering multiple objectives (MOs). There are four main objectives: budget, coverage rate, capacity, and interference. Studies have attempted to identify maximal coverage. For example, Huang et al. developed a growth-planning algorithm to establish the maximal coverage range [11]. Zhao et al. used a point-to-point signal strength strategy to implement indoor AP location optimization for maximal coverage [12]. For the capacity objective, the capacity requirements of wireless networks compared to wired networks are particularly difficult to evaluate because users are dynamic and can move from place to place. This makes APD a dynamic and complex problem. The dynamic capacity requirement must be addressed to resolve APD [13] because users can access particular APs to balance loads [9, 14]. Finally, for the interference objective, too many APs of the same type and placed too close together may cause AP malfunction because of frequency interference. To avoid communication interference, some studies [6, 15] have suggested that APs should be arranged on different communication channels, but this leads to other communication channel assignment problems.

This paper applies a goal-programming-driven model (PM) to the MO-APD problem. It uses goal programming (GP) to infer and model the PM and a genetic algorithm (GA) to search for near optimal solutions. These methods are easily applied to MO-APD problems to reflect real situations. The remainder of this paper is organized as follows: Section 2 defines the problem; Section 3 details the PM; Section 4 presents a discussion on the PM solution process using a GA; Section 5 provides the results of numerical experiments which are given in this section; lastly, Section 6 offers a conclusion and suggestions for future research.

2. Description of the APD Problem

This research resolves the MO-APD problem according to four decision constraints: budget, coverage, capacity requirements, and interference. The PM identifies a feasible target deployment (), which consists of three types of wireless APs, as shown in Table 1. This study conducted experiments and surveys that indicate that the coverage range and communication speed of a Type 3 AP are wider and faster, respectively, than AP Types 1 and 2. However, Type 1 AP equipment is cheaper than AP Types 2 and 3. Two APs may interfere with each other if they are the same type and are too near. Therefore, the PM must balance the four decision constraints and allocate three AP types in the target deployment of the APD problem. Table 2 lists the variables used in the proposed models.

AP TypeCost (NT$)Range (m)Speed (Mbit/s)Manufacturers

Type 1
802.11 b/g
136530 to 8954ASUS, D-Link, Lantech, SMC
Type 2
802.11 b/g
171033 to101108Corega, D-Link, PCI, SMC
Type 3
802.11 b/g/n
313851 to 163300Apple, ASUS, Buffalo, Corega, D-Link


The base station for the potential AP deployment area, where i is a row and j is a column. ; .
Represents the type q AP allocated to , where in Table 1. If , no AP has been allocated to .
Represents the AP cost for each AP type, .
The networking capacity requirement between and .

2.1. The Budget Constraint

Budget is the most important APD-MO constraint that directly affects the feasibility of . The cost function in (2.1) evaluates the total cost of . Equation (2.2) evaluates the budget constraint. In (2.2), bgt represents the given budget constraint for the AP allocation for :

2.2. The Coverage Constraint

Figure 1 shows that to enable seamless user communication, two APs are allocated, but two capacity requirements (req2,1 and req2,3) have no signal coverage. The coverage function () evaluates the signal coverage area of . Equation (2.3) evaluates the coverage fulfillment rate:

2.3. The Capacity Constraint

Figure 2 shows a dynamic capacity scenario. The target area allocates two Type 1 APs (AP1 and AP2), and two APs simultaneously cover the capacity requirements (). For time slot 1 (), the capacity requirements of access AP1, and the capacity requirements of access AP2. Therefore, for time slot , AP1 and AP2 must provide 55 and 25 mbit/s capacity, respectively. In time slot , shifts connection from AP1 to AP2 for balance loading. Therefore, for time slot , AP1 and AP2 must provide 35 and 45 mbit/s, respectively. Actual capacity requirements are difficult to evaluate accurately. A Monte Carlo simulation algorithm—that simulates the capacity of —implements the function. Equation (2.4) evaluates the capacity fulfillment rate:

2.4. The Interference Constraint

Figure 3 shows that many Type 1 APs are used to maximize coverage and capacity of because of budget constraints. However, too many APs of the same type and allocated too near to each other may lead to AP malfunction because of AP frequency interference. For example, Figure 3 shows a perfect coverage design. However, it also shows an increased interference rate. The interference function () evaluates the interference area of . Equation (2.5) evaluates the interference fulfillment rate:

3. Proposed Model to Solve MO-APD

Two main approaches can be used to formulate MO-APD. One approach is the cost-oriented approach, which aims to minimize total cost subject to MO performance constraints. This study formulated MO-APD using the cost-oriented approach as shown in Proposal 1 (P1). GAL-CVG, GAL-CP, and GAL-IFT are the given constraints for coverage rate, capacity fulfillment rate, and interference fulfillment rate, respectively.

(P1) subject to

Equations (3.2)–(3.4) are the coverage, capacity, and interference constraints. Equation (3.1) is the objective function, which minimizes the total cost subject to multiple decision constraints (3.2)–(3.4).

The second approach is performance oriented, and it maximizes the performance of target deployment subjects to real constraints (e.g., budget). This study reformulated the MO-APD using the performance-oriented method, shown in Proposal  2  (P2).

(P2) subject to (3.1)–(3.4).

Equation (3.5) is the objective function in P2, which maximizes the coverage, capacity fulfillment, and interference fulfillment rates of subject to budgetary (3.1) and other decision constraints (3.2)–(3.4). GP aids MO decision-making problem modeling. It was first introduced by Charnes and Cooper [16] and further developed by Tamiz et al. [17], Romero [18], and Chang [19]. Various types of GP approaches exist, such as lexicographic GP, weighted GP, MINMAX (Chebyshev) GP, and multichoice GP [19]. To enable decision makers to easily set the constraint weighting according to their preferences, this study used a weighted GP approach to translate (P2) into the (PM). , , and are the important weights (between 0 and 1) for the GAL-CVG, GAL-CP, and GAL-IFT constraints, respectively.

(PM) subject to

4. Process for Solving the PM Using a GA

The GA is a stochastic searching method that uses the mechanics of natural selection to solve optimization problems. The GA was developed from the theory of natural selection [20]. Because the GA is a good stochastic technique for solving combinatorial optimization problems, this study uses the GA as the PM search tool, as shown in Figure 4.

An initial solution population is randomly created. The fitness of each individual in the population then determines whether it survives. Termination criteria (such as the generation size or the fitness value exceeding the threshold) determine the target deployment () to be achieved. Finally, genetic operators such as selection, crossover, and mutation identify the next generation. After meeting a number of iterations or predefined criteria, a near optimal solution is found.

4.1. Representation Structure: Encode/Decode

A graph represents a target deployment () that can also be expressed as a two-dimensional matrix. In the graph, each potential base station () has two states: AP () allocated and no AP () allocated. A base station with an allocated AP must have an AP type (). bit strings were used as chromosomes to represent

4.2. Evaluation Function

The PM objective function () was used as a GA evaluation function in (4.2). All variables in (4.2) are defined as in the PM:

4.3. GA Manipulations

(1)Selection: roulette wheel selection ensures that highly fit chromosomes produce more offspring. This method selects a candidate network according to its survival probability, which is equal to its fitness relative to the whole population, as shown in (4.3): (2)Crossover: the crossover method randomly selects two chromosomes from the mating pool for mating. Crossover site is randomly selected in the interval . Two new chromosomes, called offspring, are then obtained by swapping all characters between position and .(3)Mutation: the combined reproduction and crossover methods occasionally lose potentially useful chromosome information. Mutation is introduced to overcome this. It is implemented by randomly complementing a bit (0 to 1 and vice versa). This ensures that good chromosomes are not permanently lost.

5. Experiment Validation and Analysis

To validate the efficiency and feasibility of the PM at resolving APD problems, three experiments were designed and implemented. Experiment 1 included four subtests to validate parameter combination types consisting of different decision variables. Experiment 2 included two subtests to confirm the ability of the PM to solve dynamic capacity problems. Experiment 3 ensured that the PM is suitable for large-scale problems and tested the GA parameter effects.

5.1. Experiment 1: Decision Variable Combination Validation

Four subtests consisting of different decision variables and important weights validated the ability of the PM to solve APD problems. The target area in Figure 5 is a 90 km2 irregularly shaped area. The capacity requirements in Figure 5 were identical for all subtests. All could move around the target area, where signal coverage was present. For comparative purposes, the GA parameters of the four subtests—population size (600), terminated generation (500), crossover rate (0.4), and mutation rate (0.1)—were fixed. Table 3 lists the other decision variables.

Decision variableE1.aE1.bE1.cE1.d

Budget30000 ( = .25)30000 ( = .40)35000 ( = .25)
Coverage rate85% ( = .25)85% ( = .20)85% ( = .25)
Capacity fulfillment rate80% ( = .25)80% ( = .20)80% ( = .25)
Interference fulfillment rate80% ( =  25)80% ( = .20)80% ( =  25)90% ( = 25)

Note that important weights are marked in parentheses.

Table 4 shows the four subtests formulated as Model I and Model II according to the PM. To avoid the randomizing effect of the GA, all subtests were run three times with the same parameters on the same machine. The result averages are reported. Table 5 shows the analysis of the experiment results. The E1.a and E1.b  results show that the important budget weight is less in E1.b than in E1.a. Therefore, only 15 APs (on average) are deployed for E1.b, as shown in Figure 6. The results also show that the decision maker must either increase the budget or adjust the other decision objectives. For example, E1.b shows that the coverage and capacity fulfillment rates can only reach 0.7 at the current budget. As the budget increases from 30000 (in E1.b) to 35000 (in E1.c and E1.d), the number of APs deployed increases to 22 (on average). The coverage and capacity rates increase from 0.7 in E1.b to 0.82 in E1.c and E1.d. E1.d deployed more APs (23) at a lower cost than E1.a (22 APs). Figure 6 shows that the APs in E1.c and E1.d are spread evenly in the target area to avoid interference. Figure 7 shows the convergence trends for all subtests. emerges after 100–150 iterations.

Model I (for subtests E1.a and E1.b)Model II (for subtests E1.c and E1.d)

Note that ais for E1(a), bfor E1(b), cfor E1(c), and dfor E1(d).


Time (s)160.0993160.106159.0593170.4233
Coverage rate.85.6967.8167.8233
Capacity fulfillment rate.8490.6981.8189.8269
Interference fulfillment rate.94.9867.94.99
Number of APs22152123

5.2. Experiment 2: Dynamic Capacity Requirement Validation

Experiment 2 consisted of two subtests to validate the ability of the PM to resolve dynamic capacity requirements. Figure 6(a) shows that in subtest E2.a, most capacity requirements are in the central area of the target (32 km2). Figure 6(b) shows that in subtest E2.b, the capacity requirements are scattered in the corners of the target area. Table 6 shows that the capacity requirements and all default decision variables are identical for both tests. The GA parameters—population size (600), terminated generation (500), crossover rate (0.4), and mutation rate (0.1)—were fixed to enable result comparison. To avoid random GA effects, all subtests were run three times with the same parameters on the same machine. The result averages are reported.

Decision variableVariable value

Budget15000 ( = .3)
Coverage rate85% ( = .15)
Interference fulfill rate85% ( = .15)
Capacity fulfill rate95% ( = .4)

Note that the important weights are marked in parentheses.

Table 7 shows the experiment results analysis. As expected, APD follows the capacity requirements, as shown in Figures 8(a) and 8(b). Figures 8(a) and 8(b) also show that APs are more central in E2.a than in E2.b to fulfill the capacity requirements. Although the capacity requirements are the same in both experiments, E2.a requires nine APs, which is more than E2.b (seven APs). Therefore, capacity requirements are dynamic, and requires more APs to manage the capacity requirement increase in  E2.a.


Time (s)5.18834.7797
Coverage rate.8518.8518
Capacity fulfillment rate11
Interference fulfillment rate.9815.9259
Number of APs9 APs7 APs

5.3. Experiment 3: The Effect of Large-Scale Problems and GA Parameters on Validation

Two subtests of Experiment 3 were designed as large-scale problems. Table 8 lists the decision variables and the important weights. Experiment 3 also tested GA parameter combinations, including crossover and mutation rates.


Target area2250 km290000 km2
Budget ( = .55)13500005650000
Coverage rate ( = .15)85%85%
Capacity and interference fulfillment rates ( = =  0.15)80%80%

Note that the capacity requirements are shown in the Appendix and the important weights are marked in parentheses.

The results analysis in Table 9 shows that the PM is more sensitive to crossover rate. Generation—as an evaluation indicator for subtests E3.a and E3.b—shows that feasible deployment can be reached in the following order of crossover rates: 0.6 (converged by 22 iterations), 0.4 (converged by 70 iterations), and 0.2 (converged by 95 iterations). However, no such pattern exists for mutation rate in either test. Therefore, a crossover rate of 0.4 and a mutation rate of 0.1 are recommended for experiment implementation to avoid GA parameter effects. The results in Table 9 show that large-scale problems (E3.b) can be resolved within an acceptable time (4191.52 s, approximately 1 h).

IndicatorFixed mutation rate ( )Fixed crossover rate ( )

Fitness1 (.9869)1 ( )1 ( )1 ( )1 ( )
Generation96 (93)53 (86)18 (26)9 (94)22 (62)
Capacity fulfillment rate.8485
Coverage fulfillment rate.8500

The experiment results for E3(b) are in parentheses.

6. Conclusion

Optimal wireless LAN (WLAN) design is important to ensure seamless user communication. Appropriately locating wireless APs for WLANs is important. Optimal APD enables high telecommunication quality, balanced capacity loading, and optimal deployment costs. This study proposes a GP-driven model integrated with a GA to solve MO-APD subject to four constraints: budget, capacity, interference, and coverage. The experiment results show that the PM resolves many APD problems and achieves dynamic capacity replication. Results confirm the ability of the PM to solve large-scale APD problems. Future research should focus on other applications and further verification of PM.


Figure 9 shows the capacity requirement for the E3.a subtest.


  1. N. Weicker, G. Szabo, K. Weicker, and P. Widmayer, “Evolutionary multiobjective optimization for base station transmitter placement with frequency assignment,” IEEE Transactions on Evolutionary Computation, vol. 7, no. 2, pp. 189–203, 2003. View at: Publisher Site | Google Scholar
  2. A. Mc Gibney, M. Klepal, and D. Pesch, “Agent-based optimization for large scale WLAN design,” IEEE Transactions on Evolutionary Computation, vol. 15, no. 4, pp. 470–486, 2011. View at: Publisher Site | Google Scholar
  3. L. Liao, W. Chen, C. Zhang, L. Zhang, D. Xuan, and W. Jia, “Two birds with one stone: wireless access point deployment for both coverage and localization,” IEEE Transactions on Vehicular Technology, vol. 60, no. 5, pp. 2239–2252, 2011. View at: Publisher Site | Google Scholar
  4. K. P. Scheibe and C. T. Ragsdale, “A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem,” European Journal of Operational Research, vol. 197, no. 2, pp. 773–784, 2009. View at: Publisher Site | Google Scholar
  5. K. Collins, S. Mangold, and G. M. Muntean, “Supporting mobile devices with wireless LAN/MAN in large controlled environments,” IEEE Communications Magazine, vol. 48, no. 12, pp. 36–43, 2010. View at: Publisher Site | Google Scholar
  6. A. Hills, “Large-scale wireless LAN design,” IEEE Communications Magazine, vol. 39, no. 11, pp. 98–104, 2001. View at: Publisher Site | Google Scholar
  7. K. Jaffrès-Runser, J. M. Gorce, and S. Ubéda, “Mono- and multiobjective formulations for the indoor wireless LAN planning problem,” Computers and Operations Research, vol. 35, no. 12, pp. 3885–3901, 2008. View at: Publisher Site | Google Scholar
  8. R. Whitaker and S. Hurely, “Evolution of planning for wireless communication systems,” in Proceedings of the 36th Hawaii International Conference on System Sciences, p. 10, January 2003. View at: Google Scholar
  9. J. H. Lee, B. J. Han, H. J. Lim, Y. D. Kim, N. Saxena, and T. M. Chung, “Optimizing access point allocation using genetic algorithmic approach for smart home environments,” Computer Journal, vol. 52, no. 8, pp. 938–949, 2009. View at: Publisher Site | Google Scholar
  10. I. E. Liao and K. F. Kao, “Enhancing the accuracy of WLAN-based location determination systems using predicted orientation information,” Information Sciences, vol. 178, no. 4, pp. 1049–1068, 2008. View at: Publisher Site | Google Scholar
  11. X. Huang, U. Behr, and W. Wiesbecd, “Automatic cell planning for a low-cost and spectrum efficient wireless network,” in Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM '00), vol. 1, pp. 282–276, December 2000. View at: Google Scholar
  12. Y. Zhao, H. Zhou, and M. Li, “Indoor access points location optimization using Differential Evolution,” in Proceedings of the International Conference on Computer Science and Software Engineering (CSSE '08), pp. 382–385, December 2008. View at: Publisher Site | Google Scholar
  13. J. H. Lee, B. J. Han, H. K. Bang, and T. M. Chung, “An optimal access points allocation scheme based on genetic algorithm,” in Proceedings of the International Conference on Future Generation Communication and Networking (FGCN '07), pp. 55–59, December 2007. View at: Google Scholar
  14. F. Guo and T. C. Chiueh, “Scalable and robust WLAN connectivity using access point array,” in Proceedings of the International Conference on Dependable Systems and Networks, pp. 288–297, July 2005. View at: Google Scholar
  15. X. Ling and K. L. Yeung, “Joint access point placement and channel assignment for 802.11 wireless LANs,” IEEE Transactions on Wireless Communications, vol. 5, no. 10, pp. 2705–2711, 2006. View at: Publisher Site | Google Scholar
  16. A. Charnes and W. W. Cooper, Management Model and Industrial Application of Linear Programming, vol. 1, Wiley, New York, NY, USA, 1961. View at: Zentralblatt MATH
  17. M. Tamiz, D. Jones, and C. Romero, “Goal programming for decision making: an overview of the current state-of-the-art,” European Journal of Operational Research, vol. 111, no. 3, pp. 569–581, 1998. View at: Google Scholar
  18. C. Romero, “Extended lexicographic goal programming: a unifying approach,” Omega, vol. 29, no. 1, pp. 63–71, 2001. View at: Publisher Site | Google Scholar
  19. C. T. Chang, “Revised multi-choice goal programming,” Applied Mathematical Modelling, vol. 32, no. 12, pp. 2587–2595, 2008. View at: Publisher Site | Google Scholar | Zentralblatt MATH
  20. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, 1989.

Copyright © 2012 Chen-Shu Wang and Ching-Ter Chang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

More related articles

846 Views | 642 Downloads | 1 Citation
 PDF  Download Citation  Citation
 Download other formatsMore
 Order printed copiesOrder

Related articles

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19. Sign up here as a reviewer to help fast-track new submissions.