Approximating the Pareto-front of Continuous Bi-objective Problems: Application to a Competitive Facility Location Problem | SpringerLink
Skip to main content
Springer Nature Link
Log in

Approximating the Pareto-front of Continuous Bi-objective Problems: Application to a Competitive Facility Location Problem

  • Conference paper
Management Intelligent Systems

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 171))

  • 1069 Accesses

Abstract

A new general multi-objective optimization heuristic algorithm, suitable for being applied to continuous multi-objective optimization problems is proposed. It deals with the problem at hand in a fast and efficient way. It combines ideas from different multi-objective and single-objective optimization evolutionary algorithms, although it also incorporates new devices which help to reduce the computational requirements, and also to improve the quality of the provided solutions. To show its applicability, a bi-objective competitive facility location and design problem is considered. This problem has been previously tackled through exact general methods, but they require high computational effort. A comprehensive computational study shows that the heuristic method is competitive, being able to reduce, in average, the computing time of the exact method by approximately 98%, and offering good quality in the final solutions.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 22879
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 28599
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

References

  1. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 182–197 (2002)

    Article  Google Scholar 

  2. Fernández, J., Tóth, B.: Obtaining an outer approximation of the efficient set of nonlinear biobjective problems. Journal of Global Optimization 38(2), 315–331 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Fernández, J., Tóth, B.: Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound method. Computational Optimization and Applications 42(3), 393–419 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Hammer, R., Hocks, M., Kulisch, U., Ratz, D.: C++ Toolbox for Verified Computing I: Basic Numerical Problems: Theory, Algorithms, and Programs. Springer, Berlin (1995)

    MATH  Google Scholar 

  5. Hendrix, E.M.T., Toth, B.G.: Introduction to Nonlinear and Global Optimization. Springer, New York (2010)

    Book  MATH  Google Scholar 

  6. Knowles, J.D., Corne, D.W.: The pareto archived evolution strategy: A new baseline algorithm for pareto multiobjective optimisation, vol. 1, pp. 98–105. IEEE Service Center (1999)

    Google Scholar 

  7. Knüppel, O.: PROFIL/BIAS - a fast interval library. Computing 1(53), 277–287 (1993)

    Google Scholar 

  8. Nebro, A.J., Luna, F., Alba, E., Dorronsoro, B., Durillo, J.J., Beham, A.: AbYSS: Adapting scatter search to multiobjective optimization. IEEE Transactions on Evolutionary Computation 12(4), 439–457 (2008)

    Article  Google Scholar 

  9. Ortigosa, P.M., García, I., Jelasity, M.: Reliability and performance of UEGO, a clustering-based global optimizer. Journal of Global Optimization 19(3), 265–289 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. Redondo, J.L., Fernández, J., Arrondo, A.G., García, I., Ortigosa, P.M.: Fixed or variable demand? does it matter when locating a facility? OMEGA-International journal of management science 40(1), 9–20 (2012)

    Article  Google Scholar 

  11. Redondo, J.L., Fernández, J., García, I., Ortigosa, P.M.: A robust and efficient global optimization algorithm for planar competitive location problems. Annals of Operations Research 167(1), 87–106 (2009)

    Article  MathSciNet  Google Scholar 

  12. Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: Improving the strength pareto evolutionary algorithm for multiobjective optimization. In: Giannakoglou, K.C., Tsahalis, D.T., Périaux, J., Papailiou, K.D., Fogarty, T. (eds.) Evolutionary Methods for Design Optimization and Control with Applications to Industrial Problems, Athens, Greece, pp. 95–100 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpt. of Computer Architecture and Technology, University of Granada, Granada, Spain

    J. L. Redondo

  2. Dpt. of Computer Sciences and Languages, University of Almería, ceiA3, Almería, Spain

    J. D. Álvarez

  3. Dpt. of Statistics and Operations Research, University of Murcia, Murcia, Spain

    J. Fernández & A. G. Arrondoa

  4. Dpt. of Computer Architecture and Electronics, University of Almería, ceiA3, Almería, Spain

    P. M. Ortigosa

Authors
  1. J. L. Redondo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Fernández
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. D. Álvarez
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. A. G. Arrondoa
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. P. M. Ortigosa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. L. Redondo .

Editor information

Editors and Affiliations

  1. Dept. Computer Science & A.I., University of Granada, Granada, 18071, Spain

    Jorge Casillas

  2. Dept. of Management, University of Granada, Granada, 18071, Spain

    Francisco J. Martínez-López

  3. Department of Computing Science, and Control, Universidad Salamanca, Plaza de la Merced, s/n s/n, Salamanca, 37008, Spain

    Juan Manuel Corchado Rodríguez

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Redondo, J.L., Fernández, J., Álvarez, J.D., Arrondoa, A.G., Ortigosa, P.M. (2012). Approximating the Pareto-front of Continuous Bi-objective Problems: Application to a Competitive Facility Location Problem. In: Casillas, J., Martínez-López, F., Corchado Rodríguez, J. (eds) Management Intelligent Systems. Advances in Intelligent Systems and Computing, vol 171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30864-2_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30864-2_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30863-5

  • Online ISBN: 978-3-642-30864-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics