Abstract
This paper presents a direct search algorithm called PGSL – Probabilistic Global Search Lausanne. PGSL performs global search by sampling the solutions space using a probability density function (PDF). The PDF is updated in four nested cycles such that the search focuses on regions containing good solutions without avoiding other regions altogether. Tests on benchmark problems having multi-parameter non-linear objective functions revealed that PGSL performs better than genetic algorithms in most cases that were studied. Furthermore as problem sizes increase, PGSL performs increasingly better than other approaches. Finally, PGSL has already proved to be valuable for engineering tasks in areas of design, diagnosis and control.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Trosset, M.W.: I Know It When I See It: Toward a Definition of Direct Search Methods. SIAG/OPT Views-and-News (9), 7–10 (Fall 1997)
Ratschan, S.: Search Heuristics for Box Decomposition Methods. Journal of Global Optimization 24(3), 35–49 (2002)
Voorhis, T.V.: A Global Optimization Algorithm using Lagrangian Underestimates and the Interval Newton Method. Journal of Global Optimization 24(3), 349–370 (2002)
Lewis, R.M., Torczon, V., Trosset, M.W.: Direct search methods: then and now. Journal of Computational and Applied Mathematics 124, 191–207 (2000)
Reaume, D.J., Romeijn, H.E., Smith, R.L.: Implementing pure adaptive search for global optimisation using Markov chain sampling. Journal of Global Optimization 20, 33–47 (2001)
Hendrix, E.M.T., Klepper, O.: On uniform covering, adaptive random search and raspberries. Journal of Global Optimization 18, 143–163 (2000)
Brachetti, P., Ciccoli, M.F., Pillo, G., Lucidi, S.: A new version of Price’s algorithm for global optimisation. Journal of Global optimisation 10, 165–184 (1997)
Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimisation by simulated annealing. Science 673, 220 (1983)
Holland, J.: Adaptation in natural artificial systems. University of Michigan Press (1975)
Brooks, S.H.: Discussion of random methods for locating surface maxima. Operations Research 6, 244–251 (1958)
Masri, S.F., Bekey, G.A.: A global optimization algorithm using adaptive random earch. Applied mathematics and computation 7, 353–375 (1980)
Price, W.L.: A controlled random search procedure for global optimization. In: Dixon, L.C.W., Szego, G.P. (eds.) Towards Global Optimization, vol. 2, North-Holland, Amsterdam (1978)
Brachetti, P., Ciccoli, M.F., Pillo, G., Lucidi, S.: A new version of Price’s algorithm for global optimisation. Journal of Global optimisation 10, 165–184 (1997)
Davis, L.: Bit-climbing, representational bias and test suite design. In: Booker, L., Belew, R. (eds.) Proceedings of the 4th international conference on GAs, Morgan Kauffman, San Francisco (1991)
Tang, Z.B.: Adaptive Partitioned Random Search to Global Optimization. IEEE Transactions on Automatic Control 39, 2235–2244 (1994)
Shi, L., Olafsson, S.: Nested Partitions method for global optimization. Operations Research 48, 390–407 (2000)
Syswerda, G.: A study of reproduction in generational and steady-state genetic algorithms. In: Rawlins, G. (ed.) Foundations of Genetic algorithms, pp. 94–101. Morgan-Kaufmann, San Francisco (1991)
Eshelman, L.: The CHC adaptive search algorithm. In: Rawlins, G. (ed.) Foundations of genetic algorithms, pp. 256–283. Morgan-Kaufmann, San Francisco (1991)
De Jong, K.: Analyis of the behaviour of a class of genetic adaptive systems. Ph.D. thesis, Univerisity of Michigan, Ann Arbor (1975)
Whiltley, D.: Building better test functions. In: Eshelman, L. (ed.) Proceedings of the 6th international conference on GAs, Morgan Kauffman, San Francisco (1995)
Martin, O.: Combining simulated annealing with local search heuristics. In: Laporte, G., Osman, I. (eds.) Metaheuristics in combinatoric optimization (1995)
Mongeau, M., Karsenty, H., Rouzé, V., Hiriart-Urruty, J.-B.: Comparison of publicdomain software for black box global optimization. Optimization Methods & Software 13(3), 203–226 (2000)
Raphael, B., Smith, I.F.C.: A direct stochastic algorithm for global search, Applied Mathematics and computation (2003) (in press)
Svarerudh, P., Raphael, B., Smith, I.F.C.: Lowering costs of timber shear-wall design using global search. Engineering with Computers 18(2), 93–108 (2002)
Robert-Nicoud, Y., Raphael, B., Smith, I.F.C.: Decision support through multiple models and probabilistic search. In: Proceedings of Construction Information Technology 2000, Iceland building research institute (2000)
Domer, B., Raphael, B., Shea, K., Smith, I.F.C.: Comparing two stochastic search techniques for structural control. Journal of Structural engineering 129(5) (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Raphael, B., Smith, I.F.C. (2003). Global Search through Sampling Using a PDF. In: Albrecht, A., Steinhöfel, K. (eds) Stochastic Algorithms: Foundations and Applications. SAGA 2003. Lecture Notes in Computer Science, vol 2827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39816-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-39816-5_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20103-8
Online ISBN: 978-3-540-39816-5
eBook Packages: Springer Book Archive