Nested Partitions and Its Applications to the Intermodal Hub Location Problem

Weiwei Chen (), Liang Pi () and Leyuan Shi ()
Additional contact information
Weiwei Chen: University of Wisconsin-Madison
Liang Pi: University of Wisconsin-Madison
Leyuan Shi: University of Wisconsin-Madison

A chapter in Optimization and Logistics Challenges in the Enterprise, 2009, pp 229-251 from Springer

Abstract: Summary 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.

Keywords: Linear Programming Problem; Hybrid Algorithm; Mixed Integer Programming; Lagrangian Relaxation; Facility Location Problem (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations: View citations in EconPapers (2)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:spochp:978-0-387-88617-6_8

Ordering information: This item can be ordered from
http://www.springer.com/9780387886176

DOI: 10.1007/978-0-387-88617-6_8

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().