Abstract
This paper considers a stochastic p-hub center problem, in which travel time is characterized by discrete random vector. The objective of the problem is to minimize the efficient time point of total travel time. For Poisson travel time, the problem is equivalent to a deterministic programming problem by finding the quantiles of the related probability distribution functions. For general discrete distributed travel time, the proposed problem is equivalent to a deterministic mixed-integer linear programming problem. So, we can employ conventional optimization algorithms such as branch-and-bound method to solve the deterministic programming problem. Finally, one numerical example is presented to demonstrate the validity of the proposed model and the effectiveness of the solution method.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Hakimi, S.L.: Optimum Distribution of Switching Centres in a Communication Network and Some Related Graph Theoretic Problems. Oper. Res. 13, 462–475 (1965)
Klincewicz, J.G.: Hub Location in Backbone/Tributary Network Design: the State of the Art. Eur. J. Oper. Res. 4, 139–154 (2008)
Alumur, S., Kara, B.Y.: Network Hub Location Problem: a Review. Location Sci. 6, 307–335 (1998)
Bryan, D.L., O’Kelly, M.E.: Hub-and-Spoke Networks in Air Transportation: an Analytical Review. J. Regional Sci. 39, 275–295 (1999)
Chung, S.H., Myung, Y.S., Tcha, D.W.: Optimal Design of a Distributed Network with a Two-Level Hierarchical Structure. Eur. J. Oper. Res. 62, 105–115 (1992)
Ernst, A.T., Krishnamoorthy, M.: Efficient Algorithm for the Uncapacited Single Allocation p-Hub Median Problem. Location Sci. 4, 139–154 (1996)
O’Kelly, M.E., Miller, H.J.: Solution Strategies for the Single Facility Minimax Hub Location Problem. The J. RSAI 70, 367–380 (1991)
Campbell, J.F.: Integer Programming Formulations of Discrete Hub Location Problems. Eur. J. Oper. Res. 72, 387–405 (1987)
Kara, B.Y., Tansel, B.: On the Single Assignment p-Hub Center Problem. Eur. J. Oper. Res. 125, 648–655 (2000)
Ernst, A.T., Hamacher, H.W., Jiang, H., Krishnamoorthy, M., Woeginger, G.: Uncapacitated Single and Multiple Allocation p-Hub Center Problems. Comput. Oper. Res. 36, 2230–2241 (2009)
Sim, T., Lowe, T.J., Thomas, B.W.: The Stochastic p-Hub Center Problem with Service-Level Constraints. Comput. Oper. Res. 36, 3166–3177 (2009)
Rubinstein, R.Y., Melamed, B.: Modern Simulation and Modeling. John Wiley & Sons, Chichester (1998)
Kall, P., Mayer, J.: Stochastic Linear Programming: Models, Theory and Computation. Kluwer Academic Publishers, Dordrecht (2005)
Walker, R.C.: Introduction to Mathematical Programming. Pearson Eduction Inc., London (1999)
Atamtürk, A., Savelsbergh, M.W.P.: Integer-Programming Software Systems. Ann. Oper. Res. 140, 67–124 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, K., Liu, Y., Zhang, X. (2011). Stochastic p-Hub Center Problem with Discrete Time Distributions. In: Liu, D., Zhang, H., Polycarpou, M., Alippi, C., He, H. (eds) Advances in Neural Networks – ISNN 2011. ISNN 2011. Lecture Notes in Computer Science, vol 6676. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21090-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-21090-7_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21089-1
Online ISBN: 978-3-642-21090-7
eBook Packages: Computer ScienceComputer Science (R0)