Sciweavers

4112 search results - page 35 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
150
Voted
GECCO
2006
Springer
287views Optimization» more  GECCO 2006»
15 years 7 months ago
A GA-ACO-local search hybrid algorithm for solving quadratic assignment problem
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
Yiliang Xu, Meng-Hiot Lim, Yew-Soon Ong, Jing Tang
GECCO
2010
Springer
189views Optimization» more  GECCO 2010»
15 years 1 months ago
Multiobjective evolutionary algorithm for software project portfolio optimization
Large software companies have to plan their project portfolio to maximize potential portfolio return and strategic alignment, while balancing various preferences, and considering ...
Thomas Kremmel, Jirí Kubalík, Stefan...
125
Voted
INFORMATICALT
2006
108views more  INFORMATICALT 2006»
15 years 3 months ago
Experiments with Hybrid Genetic Algorithm for the Grey Pattern Problem
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
Alfonsas Misevicius
117
Voted
IOR
2008
109views more  IOR 2008»
15 years 3 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
140
Voted
CCE
2004
15 years 3 months ago
An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
Jaein Choi, Jay H. Lee, Matthew J. Realff