The Automatic Design of Multiobjective Ant Colony Optimization Algorithms

Multiobjective optimization problems are problems with several, typically conflicting, criteria for evaluating solutions. Without any a priori preference information, the Pareto optimality principle establishes a partial order among solutions, and the output of the algorithm becomes a set of nondomi...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on evolutionary computation Ročník 16; číslo 6; s. 861 - 875
Hlavní autoři:	Lopez-Ibanez, M., Stutzle, T.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.12.2012 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithm design and analysis Algorithmics. Computability. Computer arithmetics Algorithms Ant colony optimization Ant colony optimization (ACO) Applied sciences automatic algorithm configuration Computer science; control theory; systems Context Dealing Decision theory. Utility theory Equivalence Exact sciences and technology Flexibility Formulations Logistics Mathematical models multiobjective optimization Operational research and scientific management Operational research. Management science Operations research Optimization Software Software algorithms Software engineering Studies Theoretical computing traveling salesman problem Traveling salesman problems Vectors automatic algorithm configuration Ant colony optimization Artificial life Nondominated set traveling salesman problem Pareto optimum Multiobjective programming Algorithmics Travelling salesman problem Partial ordering Flexibility Particle swarm optimization multiobjective optimization Experimental result Experimental design Preference A priori estimation Problem solving Swarm intelligence Optimality principle Ant colony optimization (ACO) Mathematical programming
ISSN:	1089-778X, 1941-0026
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!