Model Hub Median Problem Dengan Batasan Travel Time
DOI:
https://doi.org/10.22219/JTIUMM.Vol18.No1.1-8Keywords:
Uncapacitated hub, travel time, median problem.Abstract
This article describes the development of an uncapacitated p-hub median problem model. The established model will be applied in determining the location of the hub. Generally in the median p-hub model problem, it is known that the number of hubs built with the total cost minimization function. In this developed model, there is no limit to the number of hubs and the function of the intended destination is how many hubs are built. The model also looks for where the hub location will be built and which nodes are allocated to each hub. By eliminating the limitation of the number of hubs built, the model adds a total total timeout limit. The numerical experiments are dealing with the model. The solution to solve the model using excel solver. So that it will be designed spread sheet excel appropriate model. In numerical experiments, dummy data representing real systems will be used with the aim of shortening computational time. Numerical experiments are performed in several conditions scenarios. Computational results generate the location of hubs and nodes allocated to each hub with various experimental scenarios.Downloads
References
R. Martí, Á. Corberán, and J. Peiró, "Scatter search for an uncapacitated p-hub median problem," Computers & Operations Research, vol. 58, pp. 53-66, 6// 2015.
S. Khosravi and M. R. Akbari Jokar, "Facility and hub location model based on gravity rule," Computers & Industrial Engineering, vol. 109, pp. 28-38, 7// 2017.
C.-C. Lin, J.-Y. Lin, and Y.-C. Chen, "The capacitated p-hub median problem with integral constraints: An application to a Chinese air cargo network," Applied Mathematical Modelling, vol. 36, pp. 2777-2787, 6// 2012.
A. T. Ernst, H. Hamacher, H. Jiang, M. Krishnamoorthy, and G. Woeginger, "Uncapacitated single and multiple allocation p-hub center problems," Computers & Operations Research, vol. 36, pp. 2230-2241, 7// 2009.
M. Peker and B. Y. Kara, "The P-Hub maximal covering problem and extensions for gradual decay functions," Omega, vol. 54, pp. 158-172, 7// 2015.
B. Y. Kara and B. C. Tansel, "The single-assignment hub covering problem: Models and linearizations," Journal of the Operational Research Society, vol. 54, pp. 59-64, 2003.
A. Hoff, J. Peiró, Á. Corberán, and R. Martí, "Heuristics for the Capacitated Modular Hub Location Problem," Computers & Operations Research.
J. Puerto, A. B. Ramos, and A. M. Rodríguez-Chía, "Single-allocation ordered median hub location problems," Computers & Operations Research, vol. 38, pp. 559-570, 2// 2011.
M. R. Silva and C. B. Cunha, "A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem," European Journal of Operational Research.
