Abstract
A discrete location problem is formulated for the design of a postal service network. The cost objective of this problem includes a nonlinear concave component. A parametric integer programming algorithm is developed to find an approximate solution to the problem. The algorithm reduces the problem into a sequence of p-median problems and deals with the nonlinear cost by a node-replacement scheme. Preliminary computational results are presented.
Similar content being viewed by others
References
G. Cornuéjols, M.L. Fisher, and G.L. Nemhauser, “The un capacitated facility location problem,” in Discrete Location Theory, P.B. Mirchandani and R.L. Francis (Eds.), Wiley-Interscience: New York, 1977.
M.S. Daskin, Network and Discrete Location: Models, Algorithms, and Applications, Wiley: New York, 1995.
F.E. Maranzana, “On the location of supply points to minimize transport costs,” Operational Research Quarterly, vol. 15, pp. 261–270, 1964.
M.B. Teitz and P. Bart, “Heuristic methods for estimating generalized vertex median of a weighted graph,” Operations Research, vol. 16, pp. 955–961, 1968.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sun, J., Gu, Y. A Parametric Approach for a Nonlinear Discrete Location Problem. Journal of Combinatorial Optimization 6, 119–132 (2002). https://doi.org/10.1023/A:1013802826295
Issue Date:
DOI: https://doi.org/10.1023/A:1013802826295