Sciweavers

25 search results - page 3 / 5
» Differential evolution for discrete optimization: An experim...
Sort
View
CPAIOR
2011
Springer
12 years 9 months ago
Manipulating MDD Relaxations for Combinatorial Optimization
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
David Bergman, Willem Jan van Hoeve, John N. Hooke...
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 7 months ago
Application domain study of evolutionary algorithms in optimization problems
This paper deals with the problem of comparing and testing evolutionary algorithms, that is, the benchmarking problem, from an analysis point of view. A practical study of the app...
Pilar Caamaño, Francisco Bellas, José...
NHM
2010
87views more  NHM 2010»
13 years 23 days ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...
GECCO
2010
Springer
214views Optimization» more  GECCO 2010»
13 years 9 months ago
Mixed-integer evolution strategy using multiobjective selection applied to warehouse design optimization
This paper reports about the application of a new variant of multiobjective Mixed-Integer Evolution Strategy to a warehouse design optimization problem. The algorithm is able to d...
Edgar Reehuis, Thomas Bäck
CDC
2008
IEEE
167views Control Systems» more  CDC 2008»
13 years 8 months ago
Convex formulations of aggregate network air traffic flow optimization problems
The problem of regulating air traffic in the en route airspace of the National Airspace System is studied using an Eulerian network model to describe air traffic flow. The evolutio...
Daniel B. Work, Alexandre M. Bayen