Evolutionary optimization of set-covering problem
Result description
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.
Keywords
Bin packing problemCombinatorial optimizationGenetic algorithmsGlobal optimizationSet-covering problem
The result's identifiers
Result code in IS VaVaI
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Evolutionary optimization of set-covering problem
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
Jx - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Applied Mathematics and Information Sciences
ISSN
1935-0090
e-ISSN
—
Volume of the periodical
10
Issue of the periodical within the volume
4
Country of publishing house
US - UNITED STATES
Number of pages
9
Pages from-to
1293-1301
UT code for WoS article
—
EID of the result in the Scopus database
2-s2.0-84980378382
Basic information
Result type
Jx - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP
IN - Informatics
Year of implementation
2016