A parallel genetic algorithm for the set partitioning problem
- Argonne National Lab., IL (United States). Mathematics and Computer Science Division.
In this dissertation the author reports on his efforts to develop a parallel genetic algorithm and apply it to the solution of set partitioning problem -- a difficult combinatorial optimization problem used by many airlines as a mathematical model for flight crew scheduling. He developed a distributed steady-state genetic algorithm in conjunction with a specialized local search heuristic for solving the set partitioning problem. The genetic algorithm is based on an island model where multiple independent subpopulations each run a steady-state genetic algorithm on their 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. The authors found that performance, as measured by the quality of the solution found and the iteration on which it was found, improved as additional subpopulation 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 they found was the difficulty solving problems with many constraints.
- Research Organization:
- Argonne National Lab., IL (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 10161119
- Report Number(s):
- ANL--94/23; ON: DE94014048
- Country of Publication:
- United States
- Language:
- English
Similar Records
A parallel genetic algorithm for the set partitioning problem
A hypercube algorithm for the 0/1 knapsack problem
Genetic algorithms for graph partitioning and incremental graph partitioning
Technical Report
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:435291
A hypercube algorithm for the 0/1 knapsack problem
Journal Article
·
Mon Aug 01 00:00:00 EDT 1988
· J. Parallel Distrib. Comput.; (United States)
·
OSTI ID:6275035
Genetic algorithms for graph partitioning and incremental graph partitioning
Book
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:87649