Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-26T05:40:44.215Z Has data issue: false hasContentIssue false
  • English
  • Français

Facility location via continuous optimization with discontinuous objective functions

Published online by Cambridge University Press:  17 February 2009

J. Ugon ,
S. Kouhbor ,
M. Mammadov ,
A. Rubinov  and
A. Kruger
A. Rubinov
Affiliation:
Deceased.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Facility location problems are one of the most common applications of optimization methods. Continuous formulations are usually more accurate, but often result in complex problems that cannot be solved using traditional optimization methods. This paper examines theuse of a global optimization method—AGOP—for solving location problems where the objective function is discontinuous. This approach is motivated by a real-world application in wireless networks design.

Keywords

global optimizationdiscontinuous optimizationlocation problems.
Type
Research Article
Information
The ANZIAM Journal , Volume 48 , Issue 3 , January 2007 , pp. 315 - 325
Copyright
Copyright © Australian Mathematical Society 2007

References

[1]Adicks, M. D., Billo, R. E., Norman, B. A., Banerjee, S., Nnaji, B. O. and Rajgopal, J., “Optimization of indoor wireless communication network”, IIE Trans. 34 (2002) 823–836.CrossRefGoogle Scholar
[2]Bagirov, A. M., Rubinov, A. M., Soukhoroukova, N. and Yearwood, J., “Supervised and unsupervised data classification via nonsmooth and global optimisation”, TOP 11 (2003) 1–93.CrossRefGoogle Scholar
[3]Beckmann, M. J., “Continuous models of transportation and location”, Sist. Urb. 3 (1981) 403–413.Google Scholar
[4]Hale, T., http://www.ent.ohiou.edu/~thale/thlocation.html.Google Scholar
[5]Hansen, E. R., Global optimization using interval analysis (Dekker, New York, 1992).Google Scholar
[6]Kiwiel, K. C., Methods of descent for nondifferentiable optimization, Lecture Notes in Mathematics 1133 (Springer, Berlin, 1985).CrossRefGoogle Scholar
[7]Kolda, T. G., Lewis, R. M. and Torczon, V., “Optimization by direct search: New perspectives on some classical and modern methods”, SIAM Rev. 45 (2003) 385–482.CrossRefGoogle Scholar
[8]Lemaréchal, C., “Nonsmooth optimization and descent methods”, Technical Report RR-78-004, International Institute for Applied System Analysis, Laxemburg, Austria, 1978.Google Scholar
[9]Mammadov, M., “A new global optimization algorithm based on a dynamical systems approach”, in Proceedings International Conference on Optimization: Techniques and Applications—ICOTA6, (University of Ballarat,Australia, 2004), article index number 198.Google Scholar
[10]Mammadov, M., Rubinov, A. M. and Yearwood, J., “Dynamical systems described by relational elasticities with applications”, in Continuous Optimisation: current trends and applications (eds. Jeyakumar, V. and Rubinov, A. M.), (Springer, 2005) 365–385.CrossRefGoogle Scholar
[11]Morrow, R., Wireless Network Coexistence (McGraw-Hill, New York, USA, 2004).Google Scholar
[12]Pahlavan, K. and Krishnamurthy, P., Wireless Communications: Principles and Practice, 2nd ed. (Prentice Hall, New Jersey, USA, 2002).Google Scholar
[13]Panjwani, M. A., Abbott, A. L. and Rappaport, T. S., “Interactive computation of coverage regions for wireless communication in multifloored indoor environments“, IEEE J. Sel. Areas Comm. 14 (1996) 420–430.CrossRefGoogle Scholar
[14]Park, B. S., Yook, J. G. and Park, H. K., “The determination of base station placement and transmit power in an inhomogeneous traffic distribution for radio network planning”, in Proceedings of IEEE 56th Vehicular Technology Conference, Volume 4, (IEEE,Vancouver, 2002), 2051–2055.Google Scholar
[15]Rodrigues, R., Mateus, G. and Loureiro, A., “Optimal base station placement and fixed channel assignment applied to wireless local area projects”, in Proceedings of IEEE International Conference on Networks, (IEEE Computer Society,Brisbane,09 1999), 186–192.Google Scholar
[16]Scaparra, M. P. and Scutellà, M. G., “Facilities, locations, customers: Building blocks of location models: a survey”, Technical Report TR-01-18, Università di Pisa, Italy, 2001.Google Scholar
[17]Sherali, H. D., Pendyala, C. M. and Rappaport, T. S., “Optimal location of transmitters for microcellular radio communication system design”, IEEE J. Sel. Areas Comm. 14 (1996) 662–673.CrossRefGoogle Scholar
[18]Tang, K. S., Man, K. F. and Ko, K. T., “Wireless LAN design using hierarchical genetic algorithm”, in Proceedings of 7th International Conference on Genetic Algorithm, (Morgan Haufman,East Lansing, MI, USA, 1997), 629–635.Google Scholar
[19]Tang, K. S., Man, K. F. and Kwong, S., “Wireless communication network design in IC factory”, IEEE Trans. Indust. Elect. 48 (2001) 452–158.CrossRefGoogle Scholar
[20]Unbehanun, M. and Kamenetsky, M., “On the deployment of picocellular wireless infrastructure”, IEEE Comm. Mag. 10 (2003) 70–80.Google Scholar
[21] “Victorian partnership for advanced computing”, www.vpac.org.Google Scholar