Nested Partitions and Its Applications to the Intermodal Hub Location Problem
The nested partitions (NP) method has been proven to be a useful framework for effectively solving large-scale discrete optimization problems. In this chapter, we provide a brief review of the NP method and its applications. We then present a hybrid algorithm that integrates mathematical programming with the NP framework. The efficiency of the hybrid algorithm is demonstrated by the intermodal hub location problem (IHLP), a class of discrete facility location problems. Computational results show that the hybrid approach is superior to the integer programming approach and the Lagrangian relaxation method.
KeywordsLinear Programming Problem Hybrid Algorithm Mixed Integer Programming Lagrangian Relaxation Facility Location Problem
Unable to display preview. Download preview PDF.
- 8.Marco Dorigo. Optimization, Learning and Natural Algorithms. PhD thesis, Politecnico di Milano, Italy, 1992.Google Scholar
- 13.D. E. Goldberg. Genetic Algorithm in Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA, 1989.Google Scholar
- 22.Liang Pi, Yunpeng Pan, and Leyuan Shi. Hybrid nested partitions and mathematical programming approach and its applications. Accepted by IEEE Transactions on Automation Science & Engineering, 2007.Google Scholar
- 28.Leyuan Shi and Sigurdur ’Olafsson. Nested Partitions Optimization: Methodology and Applications, volume 109 of International Series in Operations Research & Management Science. Springer, 2007.Google Scholar
- 32.Laurence A. Wolsey. Integer Programming. Wiley-Interscience, 1998.Google Scholar
- 33.Laurence A. Wolsey and George L. Nemhauser. Integer and Combinatorial Optimization. Wiley-Interscience, 1999.Google Scholar