OU Portal
Log In
Welcome
Applicants
Z6_60GI02O0O8IDC0QEJUJ26TJDI4
Error:
Javascript is disabled in this browser. This page requires Javascript. Modify your browser's settings to allow Javascript to execute. See your browser's documentation for specific instructions.
{}
Close
Publikační činnost
Probíhá načítání, čekejte prosím...
publicationId :
tempRecordId :
actionDispatchIndex :
navigationBranch :
pageMode :
tabSelected :
isRivValid :
Record type:
stať ve sborníku (D)
Home Department:
Katedra informatiky a počítačů (31400)
Title:
Genetic algorithms for two dimensional bin packing problem
Citace
Volná, E. Genetic algorithms for two dimensional bin packing problem.
In:
The International Conference on Numerical Analysis and Applied Mathematics 2014 (ICNAAM-2014): Volume 1648: Proceedings of the International Conference on Numerical Analysis and Applied Mathematics 2014 (ICNAAM-2014) 2014-09-22 Rhodes, Greece.
AIP Publishing, 2015. s. 1-4. ISBN 978-0-7354-1287-3.
Subtitle
Publication year:
2015
Obor:
Informatika
Number of pages:
4
Page from:
1
Page to:
4
Form of publication:
Elektronická verze
ISBN code:
978-0-7354-1287-3
ISSN code:
0094-243X
Proceedings title:
Volume 1648: Proceedings of the International Conference on Numerical Analysis and Applied Mathematics 2014 (ICNAAM-2014)
Proceedings:
Mezinárodní
Publisher name:
AIP Publishing
Place of publishing:
Neuveden
Country of Publication:
Sborník vydaný v ČR
Název konference:
The International Conference on Numerical Analysis and Applied Mathematics 2014 (ICNAAM-2014)
Místo konání konference:
Rhodes, Greece
Datum zahájení konference:
Typ akce podle státní
příslušnosti účastníků:
Celosvětová akce
WoS code:
000355339703033
EID:
2-s2.0-84939648182
Key words in English:
Genetic algorithms, two dimensional bin packing problem, optimization.
Annotation in original language:
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.
Annotation in english language:
References
Reference
R01:
RIV/61988987:17310/15:A1601EAZ
Complementary Content
Deferred Modules
${title}
${badge}
${loading}
Deferred Modules