A new binary mathematical programming problem model for mobile communication

Abstract EN

The aim of this study is to determine the number of base slatlons and capacity of each base station to satisfy the increased traffic demand and serving all traffic demand areas with a sufficient number of base stations, which is using a minimum number of base stations in order to minimize the total cost.

The problem is formulated as a binary linear program ming problem, and is solved by a specific algorithm.

For this reason, we have built a specific algorithm to solve the model, with programming this algorithm by using Microsoft Access using Visual Basic applications, which has ability to have a decision about any changes and fluctuations.

Advantages of the algorithm can obtain best (optimum) solution with least steps.

Computational results show that the proposed model is highly effective and it is applicable, as well.

For (30) candidate base stations and (15) TDAs, we have applied the model with low costs differ by ( 10 unit $) with satisfying the required demand for all TDAs.