Sciweavers

511 search results - page 23 / 103
» Using Combinatorial Optimization Methods for Quantification ...
Sort
View
COR
2010
177views more  COR 2010»
14 years 9 months ago
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
Verena Schmid, Karl F. Doerner, Richard F. Hartl, ...
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
15 years 4 months ago
Crossover operators for multiobjective k-subset selection
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
Thorsten Meinl, Michael R. Berthold
AGENTS
2001
Springer
15 years 2 months ago
An auction-based method for decentralized train scheduling
We present a computational study of an auction-based method for decentralized train scheduling. The method is well suited to the natural information and control structure of moder...
David C. Parkes, Lyle H. Ungar
DSD
2005
IEEE
106views Hardware» more  DSD 2005»
15 years 3 months ago
Power-Constrained Hybrid BIST Test Scheduling in an Abort-on-First-Fail Test Environment
1 This paper presents a method for power-constrained system-on-chip test scheduling in an abort-on-first-fail environment where the test is terminated as soon as a fault is detecte...
Zhiyuan He, Gert Jervan, Zebo Peng, Petru Eles
AIPS
2007
14 years 12 months ago
Robust Local Search and Its Application to Generating Robust Schedules
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
Hoong Chuin Lau, Thomas Ou, Fei Xiao