Sciweavers

616 search results - page 20 / 124
» Hybrid Numerical Optimization for Combinatorial Network Prob...
Sort
View
CPAIOR
2010
Springer
13 years 5 months ago
Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
Peter J. Stuckey
GECCO
2007
Springer
173views Optimization» more  GECCO 2007»
14 years 1 months ago
A hybrid GA for a supply chain production planning problem
The problem of production and delivery lot-sizing and scheduling of set of items in a two-echelon supply chain over a finite planning horizon is addressed in this paper. A single ...
Masoud Jenabi, S. Ali Torabi, S. Afshin Mansouri
OR
2007
Springer
13 years 7 months ago
Hybrid heuristics for the probabilistic maximal covering location-allocation problem
The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhan...
Francisco de Assis Corrêa, Antonio Augusto C...
EVOW
2009
Springer
14 years 6 days ago
Finding Balanced Incomplete Block Designs with Metaheuristics
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
David Rodríguez Rueda, Carlos Cotta, Antoni...
APIN
1999
143views more  APIN 1999»
13 years 7 months ago
Solving Electrical Distribution Problems Using Hybrid Evolutionary Data Analysis Techniques
Real-world electrical engineering problems can take advantage of the last Data Analysis methodologies. In this paper we will show that Genetic Fuzzy Rule-Based Systems and Genetic ...
Oscar Cordón, Francisco Herrera, Luciano S&...