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

Celý popis

Podrobná bibliografia

Vydané v:	Computers & operations research Ročník 27; číslo 7; s. 621 - 634
Hlavní autori:	Teghem, J., Tuyttens, D., Ulungu, E.L.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Elsevier Ltd 01.06.2000 Pergamon Press Inc
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!