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

Autor(en): KROGER, B
VORNBERGER, O 
Stichwörter: Computer Science; Computer Science, Theory & Methods
Erscheinungsdatum: 1992
Herausgeber: SPRINGER VERLAG
Journal: LECTURE NOTES IN COMPUTER SCIENCE
Volumen: 594
Startseite: 330
Seitenende: 362
Zusammenfassung: 
Two 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.
ISSN: 03029743

Show full item record

Google ScholarTM

Check