Sciweavers

14548 search results - page 347 / 2910
» The Optimal Path-Matching Problem
Sort
View
GECCO
2008
Springer
103views Optimization» more  GECCO 2008»
15 years 7 months ago
How generative encodings fare on less regular problems
Generative representations allow the reuse of code and thus facilitate the evolution of repeated phenotypic themes or modules. It has been shown that generative representations pe...
Jeff Clune, Charles Ofria, Robert T. Pennock
EOR
2006
118views more  EOR 2006»
15 years 6 months ago
A random-key genetic algorithm for the generalized traveling salesman problem
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
Lawrence V. Snyder, Mark S. Daskin
IOR
2008
109views more  IOR 2008»
15 years 6 months ago
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...
Yongpei Guan, Andrew J. Miller
CDC
2008
IEEE
111views Control Systems» more  CDC 2008»
15 years 8 months ago
A Hamiltonian approximation method for the reduction of controlled systems
Abstract-- This paper considers the problem of model reduction for controlled systems. The paper considers a dual/adjoint formulation of the general optimization problem to minimiz...
Siep Weiland
GECCO
2007
Springer
258views Optimization» more  GECCO 2007»
16 years 26 days ago
A genetic algorithm for resident physician scheduling problem
This paper formally presents the resident physician scheduling problem, which is one of the most important scheduling problems in hospital. The resident physician scheduling probl...
Chi-Way Wang, Lei-Ming Sun, Ming-Hui Jin, Chung-Ju...