PARALLEL GENETIC PACKING OF RECTANGLES

DC ElementWertSprache
dc.contributor.authorKROGER, B
dc.contributor.authorSCHWENDERLING, P
dc.contributor.authorVORNBERGER, O
dc.date.accessioned2021-12-23T15:58:50Z-
dc.date.available2021-12-23T15:58:50Z-
dc.date.issued1991
dc.identifier.issn03029743
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/3588-
dc.description.abstractA parallel, problem-specific genetic algorithm to compute a certain optimization problem, the two-dimensional Bin Packing Problem, is presented. The algorithm includes a new graph-theoretical model to encode the problem and a problem specific mutation and crossover operator. Experimental results indicate that the algorithm is able to solve large Bin Packing Problems in reasonable time and that smaller instances are likely to be solved optimally.
dc.language.isoen
dc.publisherSPRINGER
dc.relation.ispartofLECTURE NOTES IN COMPUTER SCIENCE
dc.subjectComputer Science
dc.subjectComputer Science, Theory & Methods
dc.titlePARALLEL GENETIC PACKING OF RECTANGLES
dc.typejournal article
dc.identifier.isiISI:A1991GA06200025
dc.description.volume496
dc.description.startpage160
dc.description.endpage164
dc.publisher.place233 SPRING ST, NEW YORK, NY 10013 USA
dcterms.isPartOf.abbreviationLect. Notes Comput. Sci.
crisitem.author.deptFB 06 - Mathematik/Informatik-
crisitem.author.deptidfb06-
crisitem.author.parentorgUniversität Osnabrück-
crisitem.author.netidVoOl593-
Zur Kurzanzeige

Seitenaufrufe

4
Letzte Woche
0
Letzter Monat
4
geprüft am 07.06.2024

Google ScholarTM

Prüfen