An interactive heuristic method for multi-objective combinatorial optimization

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 pr...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & operations research Jg. 27; H. 7; S. 621 - 634
Hauptverfasser:	Teghem, J., Tuyttens, D., Ulungu, E.L.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Elsevier Ltd 01.06.2000 Pergamon Press Inc
Schlagworte:	Assignment problem Combinatorial optimization Knapsack problem Multi-objective programming Operations research Optimization Simulated annealing Studies Multi-objective programming Assignment problem Combinatorial optimization Simulated annealing Knapsack problem
ISSN:	0305-0548, 1873-765X, 0305-0548
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!