Sciweavers

1026 search results - page 16 / 206
» An Optimal Solution to Room Search Problem
Sort
View
TSMC
2011
324views more  TSMC 2011»
13 years 2 months ago
Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...
Shengxiang Yang, Sadaf Naseem Jat
EMO
2003
Springer
81views Optimization» more  EMO 2003»
14 years 19 days ago
Solving Hierarchical Optimization Problems Using MOEAs
Abstract. In this paper, we propose an approach for solving hierarchical multi-objective optimization problems (MOPs). In realistic MOPs, two main challenges have to be considered:...
Christian Haubelt, Sanaz Mostaghim, Jürgen Te...
ISPD
2003
ACM
121views Hardware» more  ISPD 2003»
14 years 20 days ago
Optimality, scalability and stability study of partitioning and placement algorithms
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
Jason Cong, Michail Romesis, Min Xie
SEAL
1998
Springer
13 years 11 months ago
Automating Space Allocation in Higher Education
The allocation of office space in any large institution is usually a problematical issue, which often demands a substantial amount of time to perform manually. The result of this a...
Edmund K. Burke, D. B. Varley
EOR
2002
125views more  EOR 2002»
13 years 7 months ago
Genetic local search for multi-objective combinatorial optimization
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
Andrzej Jaszkiewicz