Abstract
An undirected graph \(G=(V,A)\) by a set V of n nodes, a set A of m edges, and a set \(D\subseteq V\) consists of h demand nodes are given. Peeters (Eur J Oper Res 104:299–309, 1998) presented the absolute 1-center problem, which finds a point x placed on nodes or edges of the graph G with the property that the cost distance from the most expensive demand node to x is as cheap as possible. In the absolute 1-center problem, the distance between two nodes is computed through a shortest path between them. This paper expands the idea of Peeters (1998) and presents a new version of the absolute 1-center problem, which is called the absolute quickest 1-center problem. A value \(\sigma \) is given, and the problem finds a point \(x^*\) placed on nodes or edges of the graph G with the property that the transmission time of the quickest path to send \(\sigma \) units of data from the farthest demand node to \(x^*\) is the minimum value. We presented an \(O(r|D|(m+n\mathrm{{log}}\ n))\) time algorithm to solve the absolute quickest 1-center problem, where r is the number of distinct capacity values.
Similar content being viewed by others
References
Calvete, H.I., del-Pozo, L., Iranzo, J.A.: Algorithms for the quickest path problem and the reliable quickest path problem. Comput. Manag. Sci. 9, 255–272 (2012)
Chen, Y.L., Chin, Y.H.: The quickest path problem. Comput. Oper. Res. 17, 153–161 (1990)
Climaco, J.C.N., Pascoal, M.M.B., Craveirinha, J.M.F., Captivo, M.E.V.: Internet packet routing: application of K-quickest path algorithm. Eur. J. Oper. Res. 181, 1045–1054 (2007)
Daskin, M.S.: Network and Discrete Location: Models, Algorithms, and Applications. Wiley, New York (2011)
Garey, M.R., Johnson, D.S.: The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32, 826–834 (1977)
Hamcher, H.W., Tjandra, S.A.: Mathematical modelling of evacuation problems-a state of the art. In: Pedestrian and Evacation Dynamics, pp. 227–266. Springer (2002)
Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. I: the p-centers. SIAM J. Appl. Math. 37, 513–538 (1979)
Keshtkar, I., Ghiyasvand, M.: Inverse quickest center location problem on a tree. Discrete Appl. Math. 260, 188–202 (2019)
Moore, M.H.: On the fastest route for convoy-type traffic in flowrate-constrained networks. Transport. Sci. 10, 113–124 (1976)
Martins, E.Q.V., Santos, J.L.E.: An algorithm for the quickest path problem. Oper. Res. Lett. 20, 195–198 (1997)
Nguyen, K.T.: Reverse 1-center problem on weighted trees. Optimization 65, 253–264 (2015)
Nguyen, K.T., Anh, L.Q.: Inverse k-centrum problem on trees with variable vertex weights. Math. Methods Oper. Res. 82, 19–30 (2015)
Nguyen, K.T., Chassein, A.: Inverse eccentric vertex problem on networks. Central Eur. J. Oper. Res. 23, 687–698 (2015)
Nguyen, K.T., Hieu, V.N.M., Pham, V.H.: Inverse group 1-median problem on trees. J. Ind. Manag. Optim. (2019). https://doi.org/10.3934/jimo.2019108
Nguyen, K.T., Nguyen-Thu, A., Hung, N.T.: On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks. Math. Methods Oper. Res. 88, 147–159 (2018)
Park, C.K., Lee, S., Park, S.: A label-setting algorithm for finding a quickest path. Comput. Oper. Res. 31, 2405–2418 (2004)
Pham, V.H., Nguyen, K.T.: Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms. Theor. Comput. Sci. 795, 119–127 (2019)
Peeters, P.H.: Some new algorithms for location problems on networks. Eur. J. Oper. Res. 104, 299–309 (1998)
Rosen, I.B., Sun, S.Z., Xue, G.L.: Algorithms for the quickest path problem and the enumeration of quickest paths. Comput. Oper. Res. 18, 579–584 (1991)
Acknowledgements
We would like to express great appreciation to anonymous reviewers for their valuable comments and suggestions, which have helped to improve the quality and presentation of this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Ebrahim Ghorbani.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Ghiyasvand, M., Keshtkar, I. Solving the Absolute 1-Center Problem in the Quickest Path Case. Bull. Iran. Math. Soc. 48, 643–671 (2022). https://doi.org/10.1007/s41980-021-00536-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s41980-021-00536-4