ENUMERATIVE VS GENETIC OPTIMIZATION - 2 PARALLEL ALGORITHMS FOR THE BIN PACKING PROBLEM

DC FieldValueLanguage
dc.contributor.authorKROGER, B
dc.contributor.authorVORNBERGER, O
dc.date.accessioned2021-12-23T15:57:48Z-
dc.date.available2021-12-23T15:57:48Z-
dc.date.issued1992
dc.identifier.issn03029743
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/3137-
dc.description.abstractTwo parallel, problem-specific algorithms to compute a certain optimization problem, the two-dimensional Bin Packing Problem, are set against. A parallel branch-&-bound procedure which guarantees to find the optimal solution is compard to a heuristic genetic algorithm which successively improves a set of solutions. Both algorithms were implemented on a local memory multiprocessor system of 32 transputers. Empirical results indicate that - due to the problem's complexity - sophisticated heuristics are the only mean to get reasonable solutions for larger problem sizes.
dc.language.isoen
dc.publisherSPRINGER VERLAG
dc.relation.ispartofLECTURE NOTES IN COMPUTER SCIENCE
dc.subjectComputer Science
dc.subjectComputer Science, Theory & Methods
dc.titleENUMERATIVE VS GENETIC OPTIMIZATION - 2 PARALLEL ALGORITHMS FOR THE BIN PACKING PROBLEM
dc.typejournal article
dc.identifier.isiISI:A1992LF68700017
dc.description.volume594
dc.description.startpage330
dc.description.endpage362
dc.publisher.place175 FIFTH AVE, NEW YORK, NY 10010
dcterms.isPartOf.abbreviationLect. Notes Comput. Sci.
crisitem.author.deptFB 06 - Mathematik/Informatik-
crisitem.author.deptidfb06-
crisitem.author.parentorgUniversität Osnabrück-
crisitem.author.netidVoOl593-
Show simple item record

Google ScholarTM

Check