A Simulated Annealing-Based Multiobjective Optimization Algorithm: AMOSA

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 domination between two solutions is also used for this purpose. A complexity analysis of the proposed algorithm is provided. An extensive comparative study of the proposed algorithm with two other existing and well-known multiobjective evolutionary algorithms (MOEAs) demonstrate the effectiveness of the former with respect to five existing performance measures, and several test problems of varying degrees of difficulty. In particular, the proposed algorithm is found to be significantly superior for many ...

• Type: Journal
• Year: 2008
• Where: TEC
• Authors: Sanghamitra Bandyopadhyay, Sriparna Saha, Ujjwal Maulik, K. Deb
• Keywords: Algorithm, Multiobjective Optimization Algorithm, Solutions, TEC 2008