Combinatorial Optimization Searches


Please sign in to view the rest of this entry.

Combinatorial Optimization Searches
Combinatorial Optimization Searches
<emphasis role="bold">Introduction</emphasis> Due to the complexity of the DISASSEMBLY LINE BALANCING PROBLEM (DLBP) there is currently no known way to optimally solve even moderately sized instances of the problem; therefore, alternatives must be considered. In fully conducting a combinatorial optimization treatment of this problem, several combinatorial optimization techniques are selected in order to solve the DLBP. While each was selected based upon its unique approach to obtaining a solution, because none can be expected to consistently generate the optimal solution, these method…
Citation
Seamus M. McGovern; Surendra M. Gupta: Disassembly Line: Balancing and Modeling. Combinatorial Optimization Searches, Chapter (McGraw-Hill Professional, 2011), AccessEngineering Export