A Multiplier - Adjustment - Based Branch - and - Bound Algorithm for Solving the Set Partitioning Problem.
dc.contributor.author | Chan, Thomas Justin | |
dc.date.accessioned | 2020-09-09T02:56:05Z | |
dc.date.available | 2020-09-09T02:56:05Z | |
dc.date.issued | 1987 | |
dc.identifier.uri | https://hdl.handle.net/2027.42/161638 | |
dc.description.abstract | We introduce a new branch- and -bound algorithm (called BB-SPP) for solving the set partitioning problem (SPP). The algorithm consists of a new lower bounding procedure (called MAM) and a new branching strategy, which complements MAM. MAM is a multiplier adjustment method which attempts to satisfy the constraints of SPP by adjusting the values of the dual variables. At each iteration, selected dual variables are increased to improve the lower bound, while others may be decreased to maintain dual feasibility. Computational results show that MAM is superior to subgradient optimization, the most popular bounding method currently used for SPP. In addition, MAM requires no fine tuning nor an upper bound, and the lower bound obtained at each iteration is monotonically nondecreasing. On average, based on the test problems, MAM provided a lower bound within 4% of the LP optimal objective value in only one iteration, and within 1% in four iterations. We also extend the concept of variable elimination of SPP and describe how it can be implemented within BB-SPP to reduce the computational effort. Finally, we apply BB-SPP to a set of ten airline crew scheduling problems. Computational results show that BB-SPP outperforms SETPAR, the fastest code currently available for SPP. On average, the computation times were 9.5 times faster than SETPAR. This ratio increases as the size of the problem increases. | |
dc.format.extent | 86 p. | |
dc.language | English | |
dc.title | A Multiplier - Adjustment - Based Branch - and - Bound Algorithm for Solving the Set Partitioning Problem. | |
dc.type | Thesis | |
dc.description.thesisdegreename | PhD | en_US |
dc.description.thesisdegreediscipline | Operations research | |
dc.description.thesisdegreegrantor | University of Michigan | |
dc.subject.hlbtoplevel | Engineering | |
dc.contributor.affiliationumcampus | Ann Arbor | |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/161638/1/8801295.pdf | en_US |
dc.owningcollname | Dissertations and Theses (Ph.D. and Master's) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.