DC Element | Wert | Sprache |
dc.contributor.author | KROGER, B | |
dc.contributor.author | SCHWENDERLING, P | |
dc.contributor.author | VORNBERGER, O | |
dc.date.accessioned | 2021-12-23T15:58:50Z | - |
dc.date.available | 2021-12-23T15:58:50Z | - |
dc.date.issued | 1991 | |
dc.identifier.issn | 03029743 | |
dc.identifier.uri | https://osnascholar.ub.uni-osnabrueck.de/handle/unios/3588 | - |
dc.description.abstract | A 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.iso | en | |
dc.publisher | SPRINGER | |
dc.relation.ispartof | LECTURE NOTES IN COMPUTER SCIENCE | |
dc.subject | Computer Science | |
dc.subject | Computer Science, Theory & Methods | |
dc.title | PARALLEL GENETIC PACKING OF RECTANGLES | |
dc.type | journal article | |
dc.identifier.isi | ISI:A1991GA06200025 | |
dc.description.volume | 496 | |
dc.description.startpage | 160 | |
dc.description.endpage | 164 | |
dc.publisher.place | 233 SPRING ST, NEW YORK, NY 10013 USA | |
dcterms.isPartOf.abbreviation | Lect. Notes Comput. Sci. | |
crisitem.author.dept | FB 06 - Mathematik/Informatik | - |
crisitem.author.deptid | fb06 | - |
crisitem.author.parentorg | Universität Osnabrück | - |
crisitem.author.netid | VoOl593 | - |