498 search results - page 9 / 100 » Optimization of Genetic Operators for Scheduling Problems |
EC
1998
14 years 9 months ago
1998
This paper analyzes different representations for permutation flowshop problems. This is done using forma analysis to assess the quality of these representations with respect to m...
106
click to vote
SAC
2011
ACM
14 years 7 days ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
ICGA
1997
14 years 10 months ago
1997
The routing and scheduling of vehicles and their crews is an area of increasing importance. In this paper, we describe a large scale vehicle scheduling and routing problem which i...
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
This paper presents a new Genetic Algorithm for Protein Structure Prediction problem in both 2D and 3D hydrophobichydrophilic lattice models, introduced in [1]. Our algorithm evol...