Multiobjective Simulated Annealing: Principles and Algorithm Variants
Simulated annealing is a stochastic local search method, initially introduced for global combinatorial mono-objective optimisation problems, allowing gradual convergence to a near-optimal solution. An extended version for multiobjective optimisation has been introduced to allow a construction of nea...
Main Author: | Khalil Amine |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2019-01-01
|
Series: | Advances in Operations Research |
Online Access: | http://dx.doi.org/10.1155/2019/8134674 |
Similar Items
-
Multiobjective optimisation of bicycle frames using simulated annealing
by: Suppapitnarm, A, et al.
Published: (2014) -
An Enhanced Differential Evolution Based Algorithm with Simulated Annealing for Solving Multiobjective Optimization Problems
by: Bili Chen, et al.
Published: (2014-01-01) -
Solving Multiobjective Game in Multiconflict Situation Based on Adaptive Differential Evolution Algorithm with Simulated Annealing
by: Huimin Li, et al.
Published: (2021-01-01) -
Approximation Algorithm Variants for Convex Multiobjective Optimization Problems
by: Firdevs ULUS
Published: (2020-03-01) -
Multiswarm Multiobjective Particle Swarm Optimization with Simulated Annealing for Extracting Multiple Tests
by: Toan Bui, et al.
Published: (2020-01-01)