Sciweavers

16504 search results - page 219 / 3301
» New Problems, New Solutions
Sort
View
GECCO
2007
Springer
173views Optimization» more  GECCO 2007»
16 years 22 days 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
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
15 years 11 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...
COR
2010
116views more  COR 2010»
15 years 6 months ago
The multi-shift vehicle routing problem with overtime
: In this paper, we study a new variant of the vehicle routing problem (VRP) with time windows, multi-shift, and overtime. In this problem, a limited fleet of vehicles is used repe...
Yingtao Ren, Maged M. Dessouky, Fernando Ord&oacut...
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 6 months ago
Evolving Dynamic Change and Exchange of Genotype Encoding in Genetic Algorithms for Difficult Optimization Problems
The application of genetic algorithms (GAs) to many optimization problems in organizations often results in good performance and high quality solutions. For successful and efficien...
Maroun Bercachi, Philippe Collard, Manuel Clergue,...
AMAI
2006
Springer
15 years 6 months ago
Symmetric approximate linear programming for factored MDPs with application to constrained problems
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
Dmitri A. Dolgov, Edmund H. Durfee