A modified shuffled frog leaping algorithm for the bin packing problem

A modified shuffled frog leaping algorithm for the bin packing problem

Bin packing is a mathematical way to efficiently fit elements into bins. Since the bin packing problem (BPP) is NP-hard, the most efficient known algorithms use heuristics to accomplish results which, although very good in most cases, may not be the optimal solution. Among the heuristics currently u...

Täydet tiedot

Bibliografiset tiedot
Päätekijä: Go, Noel Anthony Mones
Aineistotyyppi: Opinnäyte
Kieli:English
Julkaistu: 2008
Aiheet:
Mutation.
Bin packing.
Bin packing > problems.
Shuffled frog leaping.
Uniform crossover.
Modified shuffeld frog leaping algorithms (MSFLA).
Shuffled frog leaping algorithm (SFLA).
Bin packing problem (BPP).
Genetic operators.
Genetic algorithms (GA)
Algorithms.