Computational Experiments For Local Search Algorithms For Binary And Mixed Integer Optimization
Download Computational Experiments For Local Search Algorithms For Binary And Mixed Integer Optimization full books in PDF, epub, and Kindle. Read online free Computational Experiments For Local Search Algorithms For Binary And Mixed Integer Optimization ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
Computational Experiments for Local Search Algorithms for Binary and Mixed Integer Optimization
Author | : Jingting Zhou (S.M.) |
Publisher | : |
Total Pages | : 53 |
Release | : 2010 |
Genre | : |
ISBN | : |
Download Computational Experiments for Local Search Algorithms for Binary and Mixed Integer Optimization Book in PDF, Epub and Kindle
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.
Computational Experiments for Local Search Algorithms for Binary and Mixed Integer Optimization Related Books
Pages: 53
Pages: 687
Pages: 348
Pages: 69
Pages: 1376