Asymptotic convergence of a simulated annealing algorithm for multiobjective optimization problems

DOI10.1007/s00186-006-0082-4zbMath1132.90369OpenAlexW2051469813MaRDI QIDQ857946

Carlos A. Coello Coello, Mario Villalobos-Arias, Onésimo Hernández-Lerma

Publication date: 5 January 2007

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-006-0082-4

zbMATH Keywords

convergencevector optimizationsimulated annealingmultiobjective optimizationmultiple objective programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Simulated Stochastic Approximation Annealing for Global Optimization With a Square-Root Cooling Schedule ⋮ Existence of solutions of a vector optimization problem with a generic lower semicontinuous objective function

Cites Work

• Optimization by Simulated Annealing
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Efficiency of interactive multi-objective simulated annealing through a case study
• MOSA method: a tool for solving multiobjective combinatorial optimization problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item