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 relatively short time good approximation set efficient solutions combinatorial optimization problem. uses sample, so-called generating solutions. Each solution explores its neighbourhood way similar that classical Weights objectives, used for their local aggregation, are tuned each iteration order assure tendency approaching while maintaining uniform distribution over this set. A computational experiment shows method better tool approximating than some previous proposals. © 1998 John Wiley & Sons, Ltd.