Communications - Scientific Letters of the University of Zilina 2016, 18(3):50-53 | DOI: 10.26552/com.C.2016.3.50-53
Location Problems in Transportation Networks
- 1 Department of Mathematical Methods and Operations Research, Faculty of Management Science and Informatics, University of Zilina, Slovakia
It is known that many optimisation problems on networks are NP-hard. However, it seems that the real transport networks have some interesting properties which allow us to find a "good" solution in reasonable time. In this paper, we suggest and study some new parameters of the transportation networks which could be useful in optimisation problems. We define the evenness and the robustness of the solution. We also concern ourselves with the statistical distribution of distances and edge values in transportation networks.
Keywords: transportation networks; Euclidean networks; robustness; distribution of distances
Published: September 30, 2016 Show citation
References
- COOK, W. J.: In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation, Princeton University Press, 2012, ISBN 978-0691152707.
- SCHILLING, D. A., ROSING, K. E., REVELLE, C. S.: Network Distance Characteristics that Affect Computational Effort in P-Median Location Problems, European J. of Operational Research 127, p. 525 - 536, 2000.
Go to original source...
- PALUCH, S.: Graph Theory (in Slovak), EDIS: University of Zilina, p. 173 - 177, 2001.
- PALUCH, S., PESKO, S.: Quantitative Methods in Logistics (in Slovak), EDIS: University of Zilina, 2006.
- KARIV, O., HAKIMI, S. L.: An Algorithmic Approach to Network Location Problems, Part I: The p-centers, SIAM J. of Applied Mathematics, 37, p. 513 - 538, 1979.
Go to original source...
- KARIV, O., HAKIMI, S. L.: An Algorithmic Approach to Network Location Problems, Part II: The p-medians, SIAM J. of Applied Mathematics, 37, p. 539 - 560, 1979.
Go to original source...
- JANACEK, J., JANOSIKOVA, L., BUZNA, L.: Optimized Design of Large-Scale Social Welfare Supporting Systems on Complex Networks, Chapter 12 in Handbook of Optimization in Complex Networks: Theory and Applications, Springer Optimization and Its Applications 57, editors: Thai, M. T., Pardalos, P. M., 2012.
Go to original source...
- JANACEK, J., Radial approach to the emergency public service system design with generalized system utility, International J. of Applied Mathematics and Informatics, 8: 7-14, 2014.
- JANOSIKOVA, L.: Emergency Medical Service Planning, Communications - Scientific Letters of the University of Zilina, 9(2): 64-68, 2007.
Go to original source...
- CZIMMERMANN, P., PESKO, S.: A Polynomial Algorithm for a Particular Obnoxious Facility Location Problem, Proc. of the 13th Intern. Symposium on Operational Research in Slovenia, SOR'15, Bled, 2015.
- PLESNIK, J.: Graph Algorithms (in Slovak), VEDA: Bratislava, 1983.
- SCAPARRA, M., P., CHURCH, R., L.: Location Problems under Disaster Events, Chapter 24 in Location Science, Springer, editors: Laporte, G., Nickel, S., Saldanha da Gama, F., 2015.
Go to original source...
- SHOOMAN, M., L.: Reliability of Computer Systems and Networks: Fault Tolerance, Analysis, and Design, John Wiley & Sons : New York, 2002.
Go to original source...
- KREMPASKY, J., Physics (in Slovak), ALFA, Bratislava, 1988
- LU, H., SHI, Y.: Complexity of Public Transport Networks, Tsinghua Science and Technology, vol. 12, No. 2, 2007.
Go to original source...
- PHILIP, J.: The Probability Distribution of the Distance between two Random Points in a Box, Trita Mat, 7(10), 2007.
This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.