A mathematical model for P-hub median location problem to multiple assignments between non-hub to hub nodes under fuzzy environment

Authors

  • Mohammad Bagher Fakhrzad Universiy of Yazd
  • Amir Mohammad Golmohammadi Universiy of Yazd
  • Farzaneh Bagheri Universiy of Yazd

DOI:

https://doi.org/10.24200/jmas.vol3iss02pp61-67

Abstract

One group of the optimization problems is Hub location problem. Hub facilities are used in transportation network which are provided transfer of products, information, passengers and postal package through of intermediate node instead of direct transfer. Methodology: One main group of these problems is discrete hub median location that seeks to minimize total transportation cost. Results: In this paper, we present hub median location problem with multiple allocation of non-hub nodes to hub nodes, moreover it is possible to connect non-hub nodes directly with considering a penalty coefficient. Conclusion: The numerical example for CAB25data set -which is related to flow and distance between 25 cities in America- with establishment cost under fuzzy circumstance solved and presented.

References

Abdashman, A. 2012. Evaluating the performance of funds joint venture in Iran. Senior thesis, Al-Zahra University, Faculty of Economics and Social Sciences, Tehran, Iran.

Abdinnour-Helm, S. 1998. A hybrid heuristic for the uncapacitated hub location problem, European Journal of Operational Research, 16 April 1998, 489–499.

Abzari, M., ketabi, S., & Abbasi, A. 2005. Portfolio optimization using linear programming and provide a practical model. Journal of Humanities and Social Sciences, Shiraz, 22 (2).

Barnhart, C., Schneur, R. 1996. Network design for express freight service. Operations Research 12 (6), 852–863.

Campbell, J. 2009. Hub location for time definite transportation, Computers & Operations Research 36: 3107 – 3116.

Chen, H., Campbell, A., & Thomas, B. 2008. Network design for timeconstrained delivery. Naval Research Logistics, 55:493–515.

Ebery, J. 2001. Solving large single allocation p-hub problems with two or three hubs, European Journal of Operational Research, 16 January 2001, 447–458.

Krishnamoorthy, E. 1996. Efficient algorithms for the uncapacitated single allocation p-hub medianproblem.LocationScience, 4:139–54.

Lustri, D. 2007. “Knowledge Management model: Practical Application Competency Development”. The Learning Organization, 14 (2): 186- 202.

Mahajan, V., Raji, S., & Wind, J. 2002. “The Dot.com Retail Failures of 2000: Were There Any Winners?” Journal of the Academy of Marketing Science , 30 (4), 474-86.

O’Kelly, M. 1987. "A quadratic integer problem for the location of interacting hub facilities."European Journal of Operational Research, 393-404.

Topcuoglua, H., Coruta, F., Ermisb, M., & Yilmaz, G. 2005. Solving the uncapacitated hub location problem using genetic algorithms, Computers & Operations Research, April 2005, 967–984.

Downloads

Published

2019-07-18

Issue

Section

Articles