A mathematical model for P-hub median location problem to multiple assignments between non-hub to hub nodes under fuzzy environment
DOI:
https://doi.org/10.24200/jrset.vol3iss02pp39-43Abstract
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. One main group of these problems is discrete hub median location that seeks to minimize total transportation cost. 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. 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
M. E. O’Kelly, "A quadratic integer problem for the location of interacting hub facilities."European Journal of Operational Research, 1987, pp. 393-404.
James F. Campbell, Hub location for time definite transportation, Computers & Operations Research 36 ,2009, 3107 - 3116
Ernst A, Krishnamoorthy M. Efficient algorithms for the uncapacitated single allocation p-hub medianproblem.LocationScience1996, 4, 139–54.
Jamie Ebery, Solving large single allocation p-hub problems with two or three hubs, European Journal of Operational Research, 16 January 2001, Pages 447–458.
Sue Abdinnour-Helm, A hybrid heuristic for the uncapacitated hub location problem, European Journal of Operational Research, 16 April 1998, Pages 489–499.
H. Topcuoglua, F. Coruta , M. Ermisb , G. Yilmaz, Solving the uncapacitated hub location problem using genetic algorithms, Computers & Operations Research, April 2005, Pages 967–984 .
Chen H, Campbell AM, Thomas B. Network design for time-constrained delivery. Naval Research Logistics 2008, 55, 493–515.
