×

A comprehensive numerical algorithm for solving service points location problems. (English) Zbl 1094.65062

Summary: This article introduces a numerical algorithm to solve the generalized max-separable optimization problem Min\(F(f_1,f_2, \dots,f_n)\)under the set of constraints \(r_{ij}(x_j)\leq 0\), where the function \(F\) is non-decreasing and continuous in each of its components and the functions \(r_{ij}(x_j)\) are continuous for each index. This work is motivated from the class of emergency service location problems, which were studied by various authors [cf. R. A. Cuningham-Green [Discrete Appl. Math. 7, 275–283 (1984; Zbl 0538.90091); Z. Drezner Nav. Res. Logist 34, 229–234 (1987; Zbl 0614.90034)]. The general version of the considered problem is NP-hard [cf. Z. Drezner, loc. cit. M. Gavalec and O. Hudec, Optimization 35, No. 4, 367–372 (1995; Zbl 0874.90114)]. Finally a numerical example is given to illustrate the introduced algorithm.

MSC:

65K05 Numerical mathematical programming methods
90C35 Programming involving graphs or networks
Full Text: DOI

References:

[1] Cuninghame-Green, R. A., Mini-Max Algebra, Lecture Notes in Economics and Mathematical Systems (1979), Springer Verlag · Zbl 0709.93534
[2] Cuninghame-Green, R. A., The absolute centre of a graph, Disc. Appl. Math., 7, 275-283 (1984) · Zbl 0538.90091
[3] Drezener, Z., On rectangular p-center problem, Naval Res. Logist., 34, 229-234 (1987) · Zbl 0614.90034
[4] O. Hudec, An alternative p-centre problem, in: Proceedings of “Optimization” Conference, Eisenach, 1989.; O. Hudec, An alternative p-centre problem, in: Proceedings of “Optimization” Conference, Eisenach, 1989.
[5] Hudec, O.; Zimmermann, K., Biobjective centre-balance graph location model, Optimization, 45, 107-115 (1999) · Zbl 0956.90059
[6] A. Tharwat, K. Zimmermann, Optimal choice of parameters in a machine time scheduling problems, in: Proceedings of “Mathematical Methods in Economics ad Industry” Conference, Liberec, Czech Republic, 1968, pp. 107-112.; A. Tharwat, K. Zimmermann, Optimal choice of parameters in a machine time scheduling problems, in: Proceedings of “Mathematical Methods in Economics ad Industry” Conference, Liberec, Czech Republic, 1968, pp. 107-112.
[7] Press, W.; Flannery, B.; Teukolsky, S.; Vetterling, W., Numerical Recipes in C: The Art of Scientific Computing (1992), Cambridge University Press · Zbl 0845.65001
[8] A. Tharwat, A generalized algorithm to solve emergency service location-problem, in: Proceedings of “Mathematical Methods in Economics” International Conference, Prague, Czech Republic, 2000.; A. Tharwat, A generalized algorithm to solve emergency service location-problem, in: Proceedings of “Mathematical Methods in Economics” International Conference, Prague, Czech Republic, 2000.
[9] A. Tharwat, K. Zimmermann, A difference scalarization technique to solve bi-criteria location problem, in: Proceedings of the First International Conference on Informatics ad Systems, Faculty of Computer ad Information, Cairo University, 2002.; A. Tharwat, K. Zimmermann, A difference scalarization technique to solve bi-criteria location problem, in: Proceedings of the First International Conference on Informatics ad Systems, Faculty of Computer ad Information, Cairo University, 2002.
[10] Zimmermann, K., Max-Separable optimization problems with uni-modal functions, Eknomicko-matematicky obzor, 27, 2, 159-169 (1991) · Zbl 0749.90076
[11] Zimmermann, K., A parametric approach to solving one location problem with additional constraints, (Proceedings “Parametric Optimization and Related Topics III”, Approximation and Optimization (1993), Verlag Peter Lang), 557-568 · Zbl 0839.90070
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.