Applied Mathematics & Information Sciences
The article aims how to use evolutionary algorithms in solving a set-covering problem. We have focused on the bin packing problem. This problem is known to be NP-hard; hence many heuristic procedures for its solution have been suggested. We propose a new solution of the problem by a genetic algorithm. The included experimental study presents the use of a genetic algorithm to find an optimal layout for the placement of regular patterns of fixed sizes and simple shapes to minimize the waste. This study indicates that genetic algorithms can effectively be used to obtain highly efficient solutions.
Digital Object Identifier (DOI)
Volna, Eva and Kotyrba, Martin
"Evolutionary Optimization of Set-Covering Problem,"
Applied Mathematics & Information Sciences: Vol. 10:
4, Article 8.
Available at: https://digitalcommons.aaru.edu.jo/amis/vol10/iss4/8