Genetic algorithms for two dimensional bin packing problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17310%2F15%3AA1601EAZ" target="_blank" >RIV/61988987:17310/15:A1601EAZ - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Genetic algorithms for two dimensional bin packing problem
Original language description
Evolutionary algorithms are general iterative algorithms for combinatorial optimization. These algorithms have been found to be very effective and robust in solving numerous problems from a wide range of application domains. In this paper we have performedan experimental studythat indicates the use of genetic algorithms for the two dimensional 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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2015
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
Article name in the collection
Volume 1648: Proceedings of the International Conference on Numerical Analysis and Applied Mathematics 2014 (ICNAAM-2014)
ISBN
978-0-7354-1287-3
ISSN
0094-243X
e-ISSN
—
Number of pages
4
Pages from-to
1-4
Publisher name
AIP Publishing
Place of publication
—
Event location
Rhodes, Greece
Event date
Sep 22, 2014
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000355339703033