Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem

The bi-objective set packing problem is a multi-objective combinatorial optimization problem similar to the well-known set covering/partitioning problems. To our knowledge and surprise, this problem has not yet been studied whereas several applications have been reported. Unfortunately, solving the...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	European journal of operational research Ročník 204; číslo 2; s. 206 - 217
Hlavní autoři:	Delorme, Xavier, Gandibleux, Xavier, Degoutin, Fabien
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 16.07.2010 Elsevier Elsevier Sequoia S.A
Edice:	European Journal of Operational Research
Témata:	Applied sciences Approximation Computer Science Decision theory. Utility theory Exact sciences and technology Flows in networks. Combinatorial problems Genetic algorithms Heuristic Hybrid method Metaheuristics Multiple objective programming Multiple objective programming Metaheuristics Set packing problem Hybrid method Operational research and scientific management Operational research. Management science Operations Research Optimization algorithms Packing problem Set packing problem Studies Set packing problem Hybrid method Metaheuristics Multiple objective programming Pareto optimum Covering problem Evolutionary algorithm Multiobjective programming Algorithmics Bin packing problem Coverage Hybridization Set partitioning Randomized algorithm Combinatorial optimization Optimal design Genetic algorithm Heuristic method Greedy algorithm Problem solving Set covering Metamodel
ISSN:	0377-2217, 1872-6860
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!