A rolling window optimization method for large-scale WCDMA base stations planning problem

European Journal of Operational Research

Volumn 183, Issue 1, 2007, Pages 370-383

  Zhang, Hong Yuan ^a,b   Xi, Yu Geng ^a   Gu, Han Yu ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b Shanghai P and T Design Institute   (China)

Author keywords

Base stations planning; Rolling strategy; Rolling window; WCDMA wireless networks

Indexed keywords

BASE STATIONS; COMPUTER SIMULATION; GLOBAL OPTIMIZATION; STRATEGIC PLANNING; WIRELESS NETWORKS;

BASE STATIONS PLANNING; ROLLING STRATEGIES; ROLLING WINDOW; WCDMA WIRELESS NETWORKS;

CODE DIVISION MULTIPLE ACCESS;

EID: 34249062951     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.09.085     Document Type: Article

References (21)

1. Guoxin X., Yifan Z., and Ping Z. WCDMA radio networks planning and optimization. Telecommunications Science (PRC) (J) 4 (2003) 32-38
2. Ahmad R.S. Bahai, Hamid Aghvami, Networks planning and optimization in the third generation wireless networks (C), in: 3G Mobile Communication Technologies, Conference Publication No. 471, IEE, 2000, pp. 441-445.
3. Andreas Eisenblatter, Armin Fugenschuh, Thorsten Koch, Arie Koster, Modelling Feasible Network Configurations for UMTS [W]. www.informs.org/Conf/Telecom02/Abstracts/Eisenblaetter01318080251.pdf, IST-2000-28088.
4. Kurt Tutschku, Kenji Leibnitz, Phuoc Tran-Gia, ICEPT - an integrated cellular network planning Tool [C], in: IEEE VTC'97, Phoenix, USA, May, 1997, pp. 766-769.
5. Kurt Tutschku, Demanded-based radio network planning of cellular mobile communication systems [C], in: Proceedings IEEE INFOCOM'98, vol. 3, April, 1998, pp. 1054-1061.
6. Matthias Galota, Christian Glaßer, Steffen Reith, Heriber Vollmer, A polynomial-time approximation scheme for base station positioning in UMTS networks [C], in: Proceedings of the Fifth International Workshop on Discrete Algorithms and Methods For Mobile Computing and Communications, 2001, pp. 52-59.
7. Glaßer C., Reith S., and vollner H. The Complexity of base station positioning in cellular networks [C]. Proceedings in Informatics 8 (2000) 167-177
8. E. Amaldi, A. Capone, F. Malucelli, Discrete models and algorithms for the capacitated location problem arising in UMTS network planning [C], in: Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communication (DIAL-M), ACM, 2001, pp. 1-8.
9. Amaldi E., Capone A., and Malucelli F. Planning UMTS base station location: optimization models with power control and algorithms [J]. IEEE Transactions on Wireless Communications 2 5 (2003) 939-952
10. E. Amaldi, A. Capone, F. Malucelli, F. Signori, Optimization models and algorithms for Downlink UMTS radio planning (C), in: Proceedings of IEEE Wireless Communications and Networking Conference (WCNC'03), 2003, pp. 831-827.
11. E. Amaldi, A. Capone, F. Malucelli, F. Signori, UMTS radio planning: optimizing base station configuration (C), in: Proceedings of IEEE VTC Fall, 2002, vol. 2, pp. 768-772.
12. Jin Kyu Han, Yong Seok Choi, Han Kyu Park, Genetic approach with a new representation for base station placement in mobile communications [C], Vehicular Technology Conference, IEEE VTC 54th, vol. 4, 2001, Fall, pp. 2703-2707.
13. Lóránt Farkas, István Laki, Lajos Nagy, Heuristic optimization of initial cell planning in UMTS[C], in: ECWT'2001, London, 2001, pp. 101-104.
14. Hurley S. Automatic base station selection and configuration in mobile networks [J]. IEEE VTC (2000) 2585-2591
15. Calégaria P., Guideca F., Kuonena P., and Nielsenb F. Combinatorial optimization algorithms for radio network planning [J]. Theoretical Computer Science 265 1-2 (2001) 235-245
16. Lee C.Y., and Kang H.G. Cell planning with capacity expansion in mobile communications: A tabu search approach [J]. IEEE Transactions on Vechicular Technology 49 5 (2000) 1678-1688
17. Byoung-Seong P., Jong-Gwan Y., and Han-Kyu P. Genetic approach to base station placement from pre-defined candidate sites for wireless communications [J]. IEICE Transactions on Communications E86-B 3 (2003) 1153-1156
18. Ovacik I.M., and Uzsoy R. Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times. International Journal of Production Research 32 6 (1994) 1243-1263
19. Chung S.L., Lafortune S., and Lin F. Limited lookahead policies in supervisory control of discrete event systems. IEEE Transactions on Automatic Control 37 12 (1992) 1921-1935
20. A. Stentz, Optimal and Efficient Path Planning for Unknown and Dynamic Environments, Carnegie ellon Robotics Institute Technical Report CMU-RI-TR-93-20, August, 1993.
21. Bishop C.M. Neural Networks for Pattern Recognition (1995), Oxford University Press, Oxford, England