An interactive heuristic method for multi-objective combinatorial optimization

An interactive heuristic method for multi-objective combinatorial optimization

0.00 Avg rating0 Votes
Article ID: iaor2001950
Country: United Kingdom
Volume: 27
Issue: 7/8
Start Page Number: 621
End Page Number: 634
Publication Date: Jun 2000
Journal: Computers and Operations Research
Authors: , ,
Keywords: programming: multiple criteria, optimization: simulated annealing
Abstract:

We have previously developed an adaptation of the simulated annealing for multi-objective combinatorial optimization problems to construct an approximation of the efficient set of such problem. In order to deal with large-scale problems, we transform this approach to propose an interactive procedure. The method is tested on the multi-objective knapsack problem and the multi-objective assignment problem.

Reviews

Required fields are marked *. Your email address will not be published.