Evolutionary Optimization of Set-Covering Problem

Authors

Eva Volna, Department of Informatics and Computers, University of Ostrava, 30 dubna 22, Ostrava, Czech RepublicFollow
Martin Kotyrba, Department of Informatics and Computers, University of Ostrava, 30 dubna 22, Ostrava, Czech RepublicFollow

Author Country (or Countries)

Czech Republic

Abstract

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)

http://dx.doi.org/10.18576/amis/100408

Recommended Citation

Volna, Eva and Kotyrba, Martin (2016) "Evolutionary Optimization of Set-Covering Problem," Applied Mathematics & Information Sciences: Vol. 10: Iss. 4, Article 8.
DOI: http://dx.doi.org/10.18576/amis/100408
Available at: https://digitalcommons.aaru.edu.jo/amis/vol10/iss4/8