Set partitioning and packing versus assignment formulations for subassembly matching problems
A Ghoniem and
H D Sherali
Additional contact information
A Ghoniem: University of Massachusetts Amherst, Massachusetts, USA
H D Sherali: Virginia Polytechnic Institute and State University, Blacksburg, USA
Journal of the Operational Research Society, 2011, vol. 62, issue 11, 2023-2033
Abstract:
This paper addresses alternative formulations and model enhancements for two combinatorial optimization problems that arise in subassembly matching problems. The first problem seeks to minimize the total deviation in certain quality characteristics for the resulting final products from a vector of target values, whereas the second aims at maximizing the throughput under specified tolerance restrictions. We propose set partitioning and packing models in concert with a specialized column generation (CG) procedure that significantly outperform alternative assignment-based formulations presented in the literature, even when the latter are enhanced via tailored symmetry-defeating strategies. In particular, we emphasize the critical importance of incorporating a complementary CG feature to consistently produce near-optimal solutions to the proposed set partitioning and packing models. Extensive computational results are presented to demonstrate the relative effectiveness of the different proposed modelling and algorithmic strategies.
Date: 2011
References: Add references at CitEc
Citations:
Downloads: (external link)
http://www.palgrave-journals.com/jors/journal/v62/n11/pdf/jors2010165a.pdf Link to full text PDF (application/pdf)
http://www.palgrave-journals.com/jors/journal/v62/n11/full/jors2010165a.html Link to full text HTML (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:62:y:2011:i:11:p:2023-2033
Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274
Access Statistics for this article
Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook
More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().