Weight Annealing Heuristics for Solving Bin Packing and other Combinatorial Optimization Problems: Concepts, Algorithms and Computational Results

Simple item page
dc.contributor.advisorGolden, Bruce L.en_US
dc.contributor.authorLoh, Kok-Huaen_US
dc.contributor.departmentDecision and Information Technologiesen_US
dc.contributor.publisherDigital Repository at the University of Marylanden_US
dc.contributor.publisherUniversity of Maryland (College Park, Md.)en_US
dc.date.accessioned2006-11-01T06:32:49Z
dc.date.available2006-11-01T06:32:49Z
dc.date.issued2006-10-23en_US
dc.description.abstractThe application of weight annealing to combinatorial optimization problems is relatively new, compared to applications of well-known optimization techniques such as simulated annealing and tabu search. The weight annealing approach seeks to expand a neighborhood search by creating distortions in different parts of the search space. Distortion is controlled through weight assignment based on insights gained from one iteration of the search procedure to the next with a view towards focusing computational efforts on the poorly solved regions of the search space. The search for the global optimum should be accelerated and the solution quality should be improved with weight annealing. In this dissertation, we present key ideas behind weight annealing and develop algorithms that solve combinatorial optimization problems. Our weight annealing-based heuristics solve the one-dimensional bin packing problem and the two-dimensional bin packing problem with and without guillotine cutting and item orientation constraints. We also solve the maximum cardinality bin packing problem and the multidimensional multiple knapsack problem with our heuristics.en_US
dc.format.extent1027487 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/3980
dc.language.isoen_US
dc.subject.pqcontrolledOperations Researchen_US
dc.subject.pqcontrolledOperations Researchen_US
dc.subject.pquncontrolledWeight Annealingen_US
dc.subject.pquncontrolledHeuristicsen_US
dc.subject.pquncontrolledCombinatorics en_US
dc.subject.pquncontrolledBin Packingen_US
dc.titleWeight Annealing Heuristics for Solving Bin Packing and other Combinatorial Optimization Problems: Concepts, Algorithms and Computational Resultsen_US
dc.typeDissertationen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
umi-umd-3863.pdf
Size:
1003.41 KB
Format:
Adobe Portable Document Format
Download

Collections

UMD Theses and Dissertations
Decision, Operations & Information Technologies Theses and Dissertations