Sciweavers

1940 search results - page 54 / 388
» Search with Synonyms: Problems and Solutions
Sort
View
EOR
2008
78views more  EOR 2008»
15 years 6 months ago
Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
We consider an extension of the optimal searcher path problem (OSP), where a searcher moving through a discretised environment may now need to spend a nonuniform amount of time tr...
Haye Lau, Shoudong Huang, Gamini Dissanayake
CEC
2008
IEEE
16 years 23 days ago
A self-adaptive cellular memetic algorithm for the DNA fragment assembly problem
Abstract— The DNA fragment assembly problem is to reconstruct a DNA chain from multiple fragments that have previously been sequenced in a laboratory. This is a critical step in ...
Bernabé Dorronsoro, Enrique Alba, Gabriel L...
AUSAI
2003
Springer
15 years 11 months ago
A New Hybrid Genetic Algorithm for the Robust Graph Coloring Problem
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
Ying Kong, Fan Wang, Andrew Lim, Songshan Guo
EOR
2007
158views more  EOR 2007»
15 years 6 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...
KES
2005
Springer
15 years 11 months ago
A Robust Approach for Improving Computational Efficiency of Order-Picking Problems
The new market forces have affected the operation of distribution centers (DCs) extremely. The DCs demand an increased productivity and a low cost in their daily operation. This pa...
Yu-Min Chiang, Shih-Hsin Chen, Kuo-Chang Wu