Advanced Search
DSpace@MIT

Computational experiments for local search algorithms for binary and mixed integer optimization

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.advisor Dimitris J. Bertsimas. en_US
dc.contributor.author Zhou, Jingting, S.M. Massachusetts Institute of Technology en_US
dc.contributor.other Massachusetts Institute of Technology. Computation for Design and Optimization Program. en_US
dc.date.accessioned 2011-03-24T20:23:27Z
dc.date.available 2011-03-24T20:23:27Z
dc.date.copyright 2010 en_US
dc.date.issued 2010 en_US
dc.identifier.uri http://hdl.handle.net/1721.1/61898
dc.description Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2010. en_US
dc.description Cataloged from PDF version of thesis. en_US
dc.description Includes bibliographical references (p. 53). en_US
dc.description.abstract In this thesis, we implement and test two algorithms for binary optimization and mixed integer optimization, respectively. We fine tune the parameters of these two algorithms and achieve satisfactory performance. We also compare our algorithms with CPLEX on large amount of fairly large-size instances. Based on the experimental results, our binary optimization algorithm delivers performance that is strictly better than CPLEX on instances with moderately dense constraint matrices, while for sparse instances, our algorithm delivers performance that is comparable to CPLEX. Our mixed integer optimization algorithm outperforms CPLEX most of the time when the constraint matrices are moderately dense, while for sparse instances, it yields results that are close to CPLEX, and the largest gap relative to the result given by CPLEX is around 5%. Our findings show that these two algorithms, especially the binary optimization algorithm, have practical promise in solving large, dense instances of both set covering and set packing problems. en_US
dc.description.statementofresponsibility by Jingting Zhou. en_US
dc.format.extent 53 p. en_US
dc.language.iso eng en_US
dc.publisher Massachusetts Institute of Technology en_US
dc.rights M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. en_US
dc.rights.uri http://dspace.mit.edu/handle/1721.1/7582 en_US
dc.subject Computation for Design and Optimization Program. en_US
dc.title Computational experiments for local search algorithms for binary and mixed integer optimization en_US
dc.type Thesis en_US
dc.description.degree S.M. en_US
dc.contributor.department Massachusetts Institute of Technology. Computation for Design and Optimization Program. en_US
dc.identifier.oclc 706817731 en_US


Files in this item

Name Size Format Description
706817731.pdf 2.251Mb PDF Preview, non-printable (open to all)
706817731-MIT.pdf 2.251Mb PDF Full printable version (MIT only)

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage