Skip to main content

Simulated Annealing for Multi Objective Optimization Problems

  • Conference paper
Multiple Criteria Decision Making

Abstract

In the last decade some large scale combinatorial optimization problems have been tackled by way of a stochastic technique called ‘simulated annealing’ first proposed by Kirkpatrick et al. (1983). This technique has proved to be a valid tool to find acceptable solutions for problems whose size makes impossible any exact solution method.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

  • Černy, V., 1985, “Thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm”, J. of Optimization Theory and Applications, 45, 41–51

    Article  MATH  Google Scholar 

  • Grötschel, M. and 0. Holland, 1991, “Solution of large-scale symmetric travelling sales-man problems”, Mathtmatical Programming, 51, 141–202

    Google Scholar 

  • Kirkpatrick, S., C.D. Gelatt, Jr., and M.P. Vecchi, 1983, “Optimization by simulated annealing”, Science, 220, 671–680

    Google Scholar 

  • Kirkpatrick, S. and R. Swendsen, 1985, “Statistical mechanics and disordered systems”, Communications of ACM, 28, 363–373

    Article  MathSciNet  Google Scholar 

  • Laarhoven, P.J.M. van and E.H.L. Aarts, 1987, Simulated Annealing: Theory and Applications, Reidel, Dordrecht

    MATH  Google Scholar 

  • Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys eds., 1985, The Traveling Salesman Problem: a Guided Tour of Combinatorial Optimization, Wiley, Chichester

    MATH  Google Scholar 

  • Lundy, M. and A. Mees, 1986, “Convergence of an annealing algorithm”, Mathematical Programming, 34, 111–124

    Article  MathSciNet  MATH  Google Scholar 

  • Padberg, M. and G. Rinaldi, 1990, “Facet identification for the symmetric travelling salesman problem”, Mathematical Programming, 47, 219–257

    Article  MathSciNet  MATH  Google Scholar 

  • Yu, P.L., 1989, “Multiple criteria decision kaking: five basic concepts”, in Handbooks in OR & MS, Vol 1: Optimization, G.L. Nemhauser et al., Eds., North Holland, Amsterdam

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag New York, Inc.

About this paper

Cite this paper

Serafini, P. (1994). Simulated Annealing for Multi Objective Optimization Problems. In: Tzeng, G.H., Wang, H.F., Wen, U.P., Yu, P.L. (eds) Multiple Criteria Decision Making. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2666-6_29

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-2666-6_29

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7626-5

  • Online ISBN: 978-1-4612-2666-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics