Pareto simulated annealing—a metaheuristic technique for multiple-objective combinatorial optimization
✍ Scribed by Piotr Czyzżak; Adrezej Jaszkiewicz
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 377 KB
- Volume
- 7
- Category
- Article
- ISSN
- 1057-9214
No coin nor oath required. For personal study only.
✦ Synopsis
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 of efficient solutions of a multipleobjective combinatorial optimization problem. The procedure uses a sample, of so-called generating solutions. Each solution explores its neighbourhood in a way similar to that of classical simulated annealing. Weights of the objectives, used for their local aggregation, are tuned in each iteration in order to assure a tendency for approaching the efficient solutions set while maintaining a uniform distribution of the generating solutions over this set. A computational experiment shows that the method is a better tool for approximating the efficient set than some previous proposals.