On the Quadratic Programming Approach for Hub Location Problems
Hub networks play an important role in many real-life network systems such as transportation and telecommunication networks. Hub location problem is concerned with identifying appropriate hub locations in a network and connecting an efficient hub-and-spoke network that minimizes the flow-weighted costs across the network. This chapter is focused on the uncapacitated single allocation p-hub median problem (USApHMP), which arises in many real-world hub networks of logistics operations. There have been many approaches used to solve this problem. We herein focus on a quadratic programming approach, which has been proven very effective and efficient. This approach incorporates the use of the linearization for 0-1 quadratic program. In this chapter, we give a brief review of the linearization techniques for 0-1 quadratic programs and compare the performance of several existing linearization techniques for USApHMP. Toward the end, we discuss some properties, comments and possible developments of these linearization techniques in the real-life USApHMP.
KeywordsLinearization Technique Access Node Transit Node Quadratic Program Approach Original Quadratic Programming
Unable to display preview. Download preview PDF.
- 11.J.F. Campbell, A. Ernst, and M. Krishnamoorthy. Hub location problems. In H. Hamacher and Z. Drezner, editors. Location Theory: Applications and Theory, pp. 373-406, Springer-Verlag, New York, 2001.Google Scholar
- 23.F. Glover and E. Woolsey. Converting the 0-1 polynomial programming problem to a 0-1 linear program. IRMIS working paper, 9304, School of Business, Indiana University, Bollomington, Indiana, 1974.Google Scholar
- 24.S.A. Helm and M.A. Venkataramanan. Using simulated annealing to solve the p-hub location problem. Operations Research, 22:180-182, 1993.Google Scholar
- 27.R.F. Love, J.G. Morris, and G.O. Wesolowsky. Facilities Location, North Holland, Amsterdam, 1988.Google Scholar
- 36.W.I. Zangwill. Media selection by decision programming. Journal of Advertising Research, 5:30-36, 1965.Google Scholar