Title of article
An interactive heuristic method for multi-objective combinatorial optimization
Author/Authors
J. Teghem، نويسنده , , D. Tuyttens، نويسنده , , E. L. Ulungu، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2000
Pages
14
From page
621
To page
634
Abstract
We have previously developed an adaptation of the simulated annealing for multi-objective combinatorial optimization (MOCO) 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.
Keywords
Multi-objective programming , Combinatorial optimization , Knapsack problem , Assignment problem , Simulated annealing
Journal title
Computers and Operations Research
Serial Year
2000
Journal title
Computers and Operations Research
Record number
927982
Link To Document