Skip to main content
SpringerLink
Log in

Solving Multilocal Optimization Problems with a Recursive Parallel Search of the Feasible Region

  • Conference paper
Computational Science and Its Applications – ICCSA 2014 (ICCSA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8580))

Included in the following conference series:

Abstract

Stretched Simulated Annealing (SSA) combines simulated annealing with a stretching function technique, in order to solve multilocal programming problems. This work explores an approach to the parallelization of SSA, named PSSA-HeD, based on a recursive heterogeneous decomposition of the feasible region and the dynamic distribution of the resulting subdomains by the processors involved. Three PSSA-HeD variants were implemented and evaluated, with distinct limits on the recursive search depth, offering different levels of numerical and computational efficiency. Numerical results are presented and discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chelouah, R., Siarry, P.: A continuous genetic algorithm designed for the global optimization of multimodal functions. Journal of Heuristics 6, 191–213 (2000)

    Article  MATH  Google Scholar 

  2. Eriksson, P., Arora, J.: A comparison of global optimization algorithms applied to a ride comfort optimization problem. Structural and Multidisciplinary Optimization 24, 157–167 (2002)

    Article  Google Scholar 

  3. Floudas, C.: Recent advances in global optimization for process synthesis, design and control: enclosure of all solutions. Computers and Chemical Engineering, 963–973 (1999)

    Google Scholar 

  4. The GNU C Library, http://www.gnu.org/software/libc/manual/ .

  5. Guibas, L.J., Sedgewick, R.: A Dichromatic Framework for Balanced Trees. In: Proceedings of the 19th Annual Symposium on Foundations of Computer Science, pp. 8–21 (1978)

    Google Scholar 

  6. Hedar, A.R.: Global Optimization Test Problems, http://www-optima.amp.i.kyoto-u.ac.jp/member/student/hedar/Hedar_files/TestGO.htm

  7. High-Performance Portable MPI, http://www.mpich.org/

  8. Ingber, L.: Very fast simulated re-annealing. Mathematical and Computer Modelling 12, 967–973 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kernighan, Ritchie, D.M.: The C Programming Language, 2nd edn. Prentice Hall, Englewood Cliffs (1988) ISBN 0-13-110362-8

    Google Scholar 

  10. Kiseleva, E., Stepanchuk, T.: On the efficiency of a global non-differentiable optimization algorithm based on the method of optimal set partitioning. Journal of Global Optimization 25, 209–235 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  11. León, T., Sanmatías, S., Vercher, H.: A multi-local optimization algorithm. Top 6(1), 1–18 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  12. Message Passing Interface Forum, http://www.mpi-forum.org/

  13. Parsopoulos, K., Plagianakos, V., Magoulas, G., Vrahatis, M.: Objective function stretching to alleviate convergence to local minima. Nonlinear Analysis 47, 3419–3424 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  14. Parsopoulos, K., Vrahatis, M.: Recent approaches to global optimization problems through particle swarm optimization. Natural Computing 1, 235–306 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  15. Pereira, A.I., Fernandes, E.M.G.P.: A reduction method for semi-infinite programming by means of a global stochastic approach. Optimization 58, 713–726 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  16. Pereira, A.I., Fernandes, E.M.G.P.: Constrained Multi-global Optimization using a Penalty Stretched Simulated Annealing Framework. In: Numerical Analysis and Applied Mathematics, AIP Conference Proceedings, vol. 1168, pp. 1354–1357 (2009)

    Google Scholar 

  17. Pereira, A.I., Fernandes, E.M.G.P.: Comparative Study of Penalty Simulated Annealing Methods for Multiglobal Programming. In: 2nd International Conference on Engineering Optimization (2010)

    Google Scholar 

  18. Pereira, A.I., Ferreira, O., Pinho, S.P., Fernandes, E.M.G.P.: Multilocal Programming and Applications. In: Zelinka, I., Snasel, V., Abraham, A. (eds.) Handbook of Optimization. Intelligent Systems Series, pp. 157–186. Springer (2013)

    Google Scholar 

  19. Price, C.J., Coope, I.D.: Numerical experiments in semi-infinite programming. Computational Optimization and Applications 6, 169–189 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  20. Ribeiro, T., Rufino, J., Pereira, A.I.: PSSA: Parallel Stretched Simulated Annealing. In: Numerical Analysis and Applied Mathematics, AIP Conference Proceedings, vol. 1389, pp. 783–786 (2011)

    Google Scholar 

  21. Salhi, S., Queen, N.: A Hybrid Algorithm for Identifying Global and Local Minima When Optimizing Functions with Many Minima. European Journal of Operations Research 155, 51–67 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  22. Tsoulos, I., Lagaris, I.: Gradient-controlled, typical-distance clustering for global optimization (2004), http://www.optimization.org

  23. Tu, W., Mayne, R.: Studies of multi-start clustering for global optimization. International Journal Numerical Methods in Engineering 53, 2239–2252 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Polytechnic Institute of Bragança, 5301-857, Bragança, Portugal

    Ana I. Pereira & José Rufino

  2. Algoritmi R&D Centre, University of Minho, Campus de Gualtar, 4710-057, Braga, Portugal

    Ana I. Pereira

  3. Laboratório de Instrumentação e Física Experimental de Partículas, Campus de Gualtar, 4710-057, Braga, Portugal

    José Rufino

Authors
  1. Ana I. Pereira
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José Rufino
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Engineering, University of Basilicata, 85100, Potenza, Italy

    Beniamino Murgante

  2. Department of Computer and Information Sciences, Covenant University, Ota, Nigeria

    Sanjay Misra

  3. Department of Production and Systems, University of Minho, 4710-057, Braga, Portugal

    Ana Maria A. C. Rocha

  4. DICAR, Polytecnico di Bari, 70125, Bari, Italy

    Carmelo Torre

  5. University of Minho, Braga, Portugal

    Jorge Gustavo Rocha  & Maria Irene Falcão  & 

  6. Monash University, 3800, Clayton, VIC, Australia

    David Taniar

  7. Department of Intelligent Informatics, Kyushu Sangyo University, 2-3-1 Matsukadai, 813-8503, Higashi-ku, Fukuoka, Japan

    Bernady O. Apduhan

  8. Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli, 1, 06123, Perugia, Italy

    Osvaldo Gervasi

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Pereira, A.I., Rufino, J. (2014). Solving Multilocal Optimization Problems with a Recursive Parallel Search of the Feasible Region. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2014. ICCSA 2014. Lecture Notes in Computer Science, vol 8580. Springer, Cham. https://doi.org/10.1007/978-3-319-09129-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09129-7_12

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09128-0

  • Online ISBN: 978-3-319-09129-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation