A novel programming model and optimisation algorithms for WCDMA networks

Yang J., Zhang J., Aydin M. E., Wu J. Y.

2007 IEEE 65th Vehicular Technology Conference - VTC2007-Spring, Dublin, İrlanda, 22 - 25 Nisan 2007, ss.1182-1187, (Tam Metin Bildiri) identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Doi Numarası: 10.1109/vetecs.2007.250
  • Basıldığı Şehir: Dublin
  • Basıldığı Ülke: İrlanda
  • Sayfa Sayıları: ss.1182-1187
  • Anahtar Kelimeler: Heuristic algorithm, Network planning, Optimisation, Programming model, WCDMA
  • İstanbul Ticaret Üniversitesi Adresli: Hayır

Özet

To obtain a good trade-off between accuracy and the computational load of WCDMA (wideband code-division multiple access) network planning and optimisation, link-level performance factors such as the impact of soft handover and fast power control need to be taken into account in system-level simulations. However, they have not been investigated together in previous works. In this paper, we propose a mixed integer programming model considering these factors in both uplink and downlink, and present optimisation strategies based on three meta-heuristics, namely simulated annealing (SA), evolutionary SA (ESA) and variable neighbourhood search (VNS). The base station location problem is modelled as a simplified p-median problem. Experimental results are provided to compare the performance of different algorithms with respect to the solution quality and the level of robustness. © 2007 IEEE.