A Simulated Annealing-Based Multiobjective Optimization Algorithm: AMOSA

@article{Bandyopadhyay2008ASA,
  title={A Simulated Annealing-Based Multiobjective Optimization Algorithm: AMOSA},
  author={Sanghamitra Bandyopadhyay and Sriparna Saha and Ujjwal Maulik and Kalyanmoy Deb},
  journal={IEEE Transactions on Evolutionary Computation},
  year={2008},
  volume={12},
  pages={269-283}
}
This paper describes a simulated annealing based multiobjective optimization algorithm that incorporates the concept of archive in order to provide a set of tradeoff solutions for the problem under consideration. To determine the acceptance probability of a new solution vis-a-vis the current solution, an elaborate procedure is followed that takes into account the domination status of the new solution with the current solution, as well as those in the archive. A measure of the amount of… Expand
A simulated annealing algorithm for constrained Multi-Objective Optimization
TLDR
The proposed simulated annealing algorithm behaves like recently proposed Archived Multi-Objective Simulated Annealing (AMOSA) algorithm, whereas when operating in the infeasible region, it tries to minimize constraint violation by moving along Approximate Descent Direction (ADD). Expand
An Enhanced Differential Evolution Based Algorithm with Simulated Annealing for Solving Multiobjective Optimization Problems
TLDR
An enhanced differential evolution based algorithm, named multi-objective differential evolution with simulated annealing algorithm (MODESA), is presented for solving multiobjective optimization problems (MOPs) and incorporates an efficient diversity maintenance approach, which is used to prune the obtained nondominated solutions for a good distributed Pareto front. Expand
C-PSA: Constrained Pareto simulated annealing for constrained multi-objective optimization
TLDR
The focus of the presented work is to develop a simulated annealing algorithm for constrained multi-objective problems which allows for non-greedy or uphill moves and a comparison with other established multi-Objective optimization algorithms has been included to highlight the benefits of the proposed approach. Expand
A simulated annealing algorithm for noisy multiobjective optimization
TLDR
The proposed algorithm performs as good or better compared with the reference algorithms in majority of the experiments and therefore represents a promising solution method for noisy multiobjective optimization problems. Expand
Development of a Robust Multiobjective Simulated Annealing Algorithm for Solving Multiobjective Optimization Problems
This paper describes the development of a robust algorithm for multiobjective optimization, known as robust multiobjective simulated annealing (rMOSA). rMOSA is a simulated annealing basedExpand
A simulated annealing for multi-criteria optimization problem: DBMOSA
TLDR
The overall performance of the proposed SA is generally superior to both of the AMOSA and NSGA-II, particularly, for the MOPs with three objectives the performance ofthe former is far better than the latter, and the proposed CHT can be very conveniently extended into any of the existing EAs for MOP such that they can be applied to solve the CMOPs. Expand
Evolutionary Multi-objective Simulated Annealing with adaptive and competitive search direction
  • Hui Li, Dario Landa Silva
  • Mathematics, Computer Science
  • 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)
  • 2008
TLDR
A population-based implementation of simulated annealing to tackle multi-objective optimisation problems, in particular those of combinatorial nature, is proposed, which combines local and evolutionary search by incorporating two distinctive features. Expand
An Adaptive Evolutionary Multi-Objective Approach Based on Simulated Annealing
TLDR
An improved version of MOEA/D is presented, called EMOSA, which incorporates an advanced local search technique (simulated annealing) and adapts the search directions (weight vectors) corresponding to various subproblems, and outperforms six other well established multi-objective metaheuristic algorithms. Expand
The multiobjective evolutionary algorithm based on determined weight and sub-regional search
  • Hai-Lin, Xueqiang Li
  • Mathematics, Computer Science
  • 2009 IEEE Congress on Evolutionary Computation
  • 2009
TLDR
This paper presents a kind of easy technology dealing with the constraint, which makes the proposed algorithm solved unconstrained multiobjective problems can also be used to solve constrained multi objective problems. Expand
Simulated annealing for many objective optimization problems
TLDR
A novel variant of Simulated Annealing (SA) is proposed as an alternative to solve MaOP problems, combining also the proposed SA with clustering reduction techniques and tabu search. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 45 REFERENCES
A SIMULATED ANNEALING ALGORITHM FOR MULTIOBJECTIVE OPTIMIZATION
TLDR
This paper describes a novel implementation of the Simulated Annealing algorithm designed to explore the trade-off between multiple objectives in optimization problems and concludes that the proposed algorithm offers an effective and easily implemented method for exploring thetrade-off in multiobjective optimization problems. Expand
A survey of simulated annealing as a tool for single and multiobjective optimization
TLDR
A comprehensive review of simulated annealing (SA)-based optimization algorithms, which solve single and multiobjective optimization problems, where a desired global minimum/maximum is hidden among many local minima/maxima. Expand
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
TLDR
This paper provides a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions and shows that elitism is shown to be an important factor for improving evolutionary multiobjectives search. Expand
An evolutionary algorithm for multiobjective optimization: the strength Pareto approach
TLDR
A new evolutionary approach to multicriteria optimization the Strength Pareto Evolutionary Algorithm SPEA is proposed which combines various features of previous multiobjective EAs in a unique manner and is characterized as follows. Expand
Multi-objective Optimization using Evolutionary Algorithms
This is a progress report describing my research during the last one and a half year, performed during part A of my Ph.D. study. The research field is multi-objective optimization using evolutionaryExpand
Pareto Simulated Annealing for Fuzzy Multi-Objective Combinatorial Optimization
TLDR
The paper presents a metaheuristic method for solving fuzzy multi-objective combinatorial optimization problems called fuzzy Pareto simulated annealing (FPSA), which does not transform the original fuzzy MOCO problem to an auxiliary deterministic problem but works in theOriginal fuzzy objective space. Expand
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
TLDR
It is argued that PAES may represent the simplest possible nontrivial algorithm capable of generating diverse solutions in the Pareto optimal set and provides strong evidence thatPAES performs consistently well on a range of multiobjective optimization tasks. Expand
MOSA method: a tool for solving multiobjective combinatorial optimization problems
The success of modern heuristics (Simulated Annealing (S.A.), Tabu Search, Genetic Algorithms, …) in solving classical combinatorial optimization problems has drawn the attention of the researchExpand
Using unconstrained elite archives for multiobjective optimization
TLDR
It is demonstrated thatMOEAs using the new data structures run significantly faster than standard, unconstrained archive MOEAs, and result in estimated Pareto fronts significantly ahead of MOE as using a constrained archive. Expand
Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
This paper presents a multiple-objective metaheuristic procedure—Pareto simulated annealing. The goal of the procedure is to find in a relatively short time a good approximation of the set ofExpand
...
1
2
3
4
5
...