Advertisement

New complexity results for the p-hub median problem

  • Hüseyin Güden
S.I.: CoDIT2017-Combinatorial Optimization
  • 77 Downloads

Abstract

Using transportation mode and flow dependent cost structures on the classical p-hub median problems affects the shape of its linear cost function. While there is a vast literature about the classical problem, the studies with cost structures different than linear functions are rare. In this study, several cost structures such as all unit discount model, modified all unit discount model, car load discount model and container cost structures, which are especially useful in freight transportation, are considered. It is shown that some easy classical problems become NP-hard when the linearity of the cost functions is lost.

Keywords

p-Hub median problem Non-linear objective function Complexity Transportation Discount models 

References

  1. Alamur, S., & Kara, B. Y. (2008). Network hub location problems: The state of the art. European Journal of Operational Research, 190, 1–21.CrossRefGoogle Scholar
  2. Alamur, S., Nickel, S., Saldanha-da-Gama, F., & Seçerdin, Y. (2016). Multi-period hub network design problems with modular capacities. Annals of Operations Research, 246, 289–312.CrossRefGoogle Scholar
  3. Aykin, T. (1995). The hub location and routing problem. European Journal of Operational Research, 83, 200–219.CrossRefGoogle Scholar
  4. Bryan, D. L. (1998). Extensions to the hub location problem: Formulations and numerical examples. Geographical Analysis, 30, 315–330.CrossRefGoogle Scholar
  5. Campbell, J. F. (1992). Location and allocation for distribution systems with transshipments and transportation economies of scale. Annals of Operations Research, 40, 77–99.CrossRefGoogle Scholar
  6. Campbell, J., Ernst, A., & Krishnamoorthy, M. (2002). Facility location, applications and theory. Berlin: Springer.Google Scholar
  7. Campbell, J. F., & O’Kelly, M. E. (2012). Twenty-five years of hub location research. Transportation Science, 46, 153–169.CrossRefGoogle Scholar
  8. Çetiner, S., Sepil, C., & Sural, H. (2010). Hubbing and routing in postal delivery systems. Annals of Operations Research, 181, 109–124.CrossRefGoogle Scholar
  9. Costa, M. G., Captivo, M. E., & Climaco, J. (2008). Capacitated single allocation hub location problem—A bi-criteria approach. Computers & Operations Research, 35(11), 3671–3695.CrossRefGoogle Scholar
  10. Cunha, C. B., & Silva, M. R. (2007). A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil. European Journal of Operational Research, 179, 747–758.CrossRefGoogle Scholar
  11. Farahani, R. Z., Hekmatfar, M., Arabani, A. B., & Nikbakhsh, E. (2013). Hub location problems: A review of models, classification, solution techniques, and applications. Computers & Industrial Engineering, 64, 1096–1109.CrossRefGoogle Scholar
  12. Goldman, A. J. (1969). Optimal location for centers in a network. Transportation Science, 3, 352–360.CrossRefGoogle Scholar
  13. Horner, M. W., & O’Kelly, M. E. (2001). Embedding economies of scale concepts for hub network design. Journal of Transport Geography, 9(4), 255–265.CrossRefGoogle Scholar
  14. Kara, B. Y. (1999). Modeling and analysis of issues in hub location problem. PHD thesis, Bilkent University, Turkey.Google Scholar
  15. Kimms, A. (2005). Economies of scale in hub and spoke network design models: We have it all wrong. Technical report. Technische Universität Bergakademie Freiberg, Lessingstrasse 45, 09599, Freiberg, Germany.Google Scholar
  16. Klincewicz, J. G. (2002). Enumeration and search procedures for a hub location problem with economies of scale. Annals of Operations Research, 110, 107–122.CrossRefGoogle Scholar
  17. Minas, J. S., & Mitten, L. G. (1958). The hub operation scheduling problem. Operations Research, 6(3), 329–345.CrossRefGoogle Scholar
  18. O’Kelly, M. E. (1987). A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research, 32, 393–404.CrossRefGoogle Scholar
  19. O’Kelly, M. E. (1992). A clustering approach to the planar hub location problem. Annals of Operations Research, 40, 339–353.CrossRefGoogle Scholar
  20. O’Kelly, M. E., & Bryan, D. L. (1998). Hub location with flow economies of scale. Transportation Research Part B, 32(8), 605–616.CrossRefGoogle Scholar
  21. Racunicam, I., & Wynter, L. (2005). Optimal location of intermodal freight hubs. Transportation Research Part B, 39(5), 453–477.CrossRefGoogle Scholar
  22. Skorin-Kapov, D., Skorin-Kapov, J., & O’Kelly, M. (1996). Tight linear programming relaxations of uncapacitated p-hub median problems. European Journal of Operational Research, 94, 582–593.CrossRefGoogle Scholar
  23. Sohn, J., & Park, S. (1997). A linear programming for the two hub location problem. European Journal of Operational Research, 100, 617–622.CrossRefGoogle Scholar
  24. Sohn, J., & Park, S. (1998). Efficient solution procedure and reduced size formulations for p-hub location problems. European Journal of Operational Research, 108, 118–126.CrossRefGoogle Scholar
  25. Yaman, H., & Carello, G. (2005). Solving the hub location problem with modular link capacities. Computers & Operations Research, 32(12), 3227–3245.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Industrial Engineering DepartmentEastern Mediterranean UniversityFamagustaTurkey

Personalised recommendations