A parallel genetic algorithm for the set partitioning problem
This paper describes a parallel genetic algorithm developed for the solution of the set partitioning problem- a difficult combinatorial optimization problem used by many airlines as a mathematical model for flight crew scheduling. The genetic algorithm is based on an island model where multiple independent subpopulations each run a steady-state genetic algorithm on their own subpopulation and occasionally fit strings migrate between the subpopulations. Tests on forty real-world set partitioning problems were carried out on up to 128 nodes of an IBM SP1 parallel computer. We found that performance, as measured by the quality of the solution found and the iteration on which it was found, improved as additional subpopulations were added to the computation. With larger numbers of subpopulations the genetic algorithm was regularly able to find the optimal solution to problems having up to a few thousand integer variables. In two cases, high- quality integer feasible solutions were found for problems with 36, 699 and 43,749 integer variables, respectively. A notable limitation we found was the difficulty solving problems with many constraints.
- Research Organization:
- Argonne National Lab., IL (United States). Mathematics and Computer Science Div.
- Sponsoring Organization:
- USDOE Office of Energy Research, Washington, DC (United States)
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 435291
- Report Number(s):
- MCS-P-458-0894; ON: DE97002611
- Resource Relation:
- Other Information: PBD: [1996]
- Country of Publication:
- United States
- Language:
- English
Similar Records
Novel Geometric Operations for Linear Programming
A biomimetic approach to fast selection of optimal controlled variables using multiagent algorithms and a decomposition approach