Copyright © 2002 Published by Elsevier Science Ltd. All rights reserved.
Performance evaluation of acceptance probability functions for multi-objective SA
Received 1 September 2000;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
A probabilistic local search algorithm called simulated annealing (SA) is a useful approximate solution technique for multi-objective optimization problems. When we use SA to solve multi-objective optimization problems, we cannot use an acceptance probability function used for single objective optimization problems. Therefore, several types of acceptance probability functions for multi-objective SA have been previously proposed. In this paper, we introduce a parameterized acceptance probability function for multi-objective SA, which changes its type depending on the parameter, and investigate how the performance of the multi-objective SA depends on the type of acceptance probability function in two test problems.
Scope and purpose
There are many real-life problems that are formulated as multi-objective optimization problems. However, large-scale problems of this type are often difficult to solve by specific conventional exact procedures. Simulated annealing (SA) is an efficient tool for finding useful approximate solutions to such problems. Several types of acceptance probability functions are available for multi-objective SA. In this paper, we investigate how the performance of the multi-objective SA depends on the type of acceptance probability function applied.
Author Keywords: Multi-objective optimization; Simulated annealing; Acceptance probability function







E-mail Article
Add to my Quick Links

Cited By in Scopus (9)







