Sciweavers

13987 search results - page 265 / 2798
» The Two Guards Problem
Sort
View
JCST
2008
134views more  JCST 2008»
15 years 4 months ago
Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
Xiaomin Hu, Jun Zhang, Yun Li
EOR
2007
89views more  EOR 2007»
15 years 4 months ago
The service allocation problem at the Gioia Tauro Maritime Terminal
The Service Allocation Problem (SAP) is a tactical problem arising in the yard management of a container transshipment terminal. The objective is the minimization of the container...
Jean-François Cordeau, Manlio Gaudioso, Gil...
EOR
2007
158views more  EOR 2007»
15 years 4 months ago
A graph-based hyper-heuristic for educational timetabling problems
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...
Edmund K. Burke, Barry McCollum, Amnon Meisels, Sa...
JUCS
2006
104views more  JUCS 2006»
15 years 4 months ago
Multi-Objective Evolutionary Algorithms and Pattern Search Methods for Circuit Design Problems
: The paper concerns the design of evolutionary algorithms and pattern search methods on two circuit design problems: the multi-objective optimization of an Operational Transconduc...
Tonio Biondi, Angelo Ciccazzo, Vincenzo Cutello, S...
EOR
2007
90views more  EOR 2007»
15 years 4 months ago
Accelerating column generation for variable sized bin-packing problems
In this paper, we study different strategies to stabilize and accelerate the column generation method, when it is applied specifically to the variable sized bin-packing problem,...
Cláudio Alves, José M. Valéri...