The p-Median Problem with Concave Costs

Chuan Xu, Abdel Lisser, Janny Leung, Marc Letournel

Abstract

In this paper, we propose a capacitated p-median problem with concave costs, in which the global cost incurred for each established facility is a concave function of the quantity q delivered by this facility. We use DICOPT to solve this concave model. And then we transform this model into a linear programming problem and solve it using the commercial solver CPLEX. We also use the metaheuristic Variable Neighbourhood Search (VNS) to solve this problem. Computational results show that our linearization method helps to improve the calculations of the concave model. With VNS, we solve large size instances with up to 1500 facilities within a reasonable CPU time.

References

  1. Avella, P., Sassano, A., and Vasil'ev, I. (2007). Computational study of large-scale p-median problems. Mathematical Programming, 109(1):89-114.
  2. Beltran, C., Tadonki, C., and Vial, J. P. (2006). Solving the p-median problem with a semi-lagrangian relaxation. Computational Optimization and Applications, 35(2):239-260.
  3. Ceselli, A. and Righini, G. (2005). A branch-and-price algorithm for the capacitated p-median problem. Networks, 45(3):125-142.
  4. Charikar, M. and Guha, S. (1999). Improved combinatorial algorithms for the facility location and k-median problems. In Foundations of Computer Science, 1999. 40th Annual Symposium on, pages 378-388. IEEE.
  5. Drud, A. (1996). Conopt - a system for large scale nonlinear optimization. REFERENCE MANUAL for CONOPT Subroutine Library, ARKI Consulting and Development A/S.
  6. Dupont, L. (2008). Branch and bound algorithm for a facility location problem with concave site dependent costs. International Journal of Production Economics, 112(1):245-254.
  7. Fathali, J. and Kakhki, H. (2006). Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases. European journal of operational research, 170(2):440- 462.
  8. Fleszar, K. and Hindi, K. (2008). An effective vns for the capacitated p-median problem. European Journal of Operational Research, 191(3):612-622.
  9. Ghoseiri, K. and Ghannadpour, S. (2007). Solving capacitated p-median problem using genetic algorithm. In Industrial Engineering and Engineering Management, 2007 IEEE International Conference on, pages 885-889. IEEE.
  10. Hansen, P., Brimberg, J., Uros?evic, D., and Mladenovic, N. (2009). Solving large p-median clustering problems by primal-dual variable neighborhood search. Data mining and knowledge discovery, 19(3):351-375.
  11. Hansen, P. and Mladenovic, N. (1997). Variable neighborhood search for the p-median. Location Science, 5(4):207-226.
  12. Hansen, P., Mladenovic, N., and Moreno Pérez, J. (2010). Variable neighbourhood search: methods and applications. Annals of Operations Research, 175(1):367- 407.
  13. Jain, K. and Vazirani, V. V. (2001). Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. Journal of the ACM (JACM), 48(2):274-296.
  14. Kariv, O. and Hakimi, S. (1979). An algorithmic approach to network location problems. ii: The p-medians. SIAM Journal on Applied Mathematics, pages 539- 560.
  15. Kocis, G. and Grossmann, I. (1989). Computational experience with dicopt solving fMINLPg problems in process systems engineering. Computers & Chemical Engineering, 13(3):307 - 315.
  16. Landa-Torres, I., Ser, J. D., Salcedo-Sanz, S., Gil-Lopez, S., Portilla-Figueras, J., and Alonso-Garrido, O. (2012). A comparative study of two hybrid grouping evolutionary techniques for the capacitated p-median problem. Computers & Operations Research, 39(9):2214 - 2222.
  17. Nagy, G. and Salhi, S. (2007). Location-routing: Issues, models and methods. European Journal of Operational Research, 177(2):649-672.
  18. Osman, I. and Ahmadi, S. (2006). Guided construction search metaheuristics for the capacitated p-median problem with single source constraint. Journal of the Operational Research Society, 58(1):100-114.
  19. Osman, I. H. and Christofides, N. (1994). Capacitated clustering problems by hybrid simulated annealing and tabu search. International Transactions in Operational Research, 1(3):317-336.
  20. ReVelle, C. and Swain, R. (1970). Central facilities location. Geographical Analysis, 2(1):30-42.
  21. Stanimirovic, Z. (2008). A genetic algorithm approach for the capacitated single allocation p-hub median problem. Computing and Informatics, 27.
  22. Sun, J. and Gu, Y. (2002). A parametric approach for a nonlinear discrete location problem. Journal of combinatorial optimization, 6(2):119-132.
  23. Verter, V. and Dasci, A. (2002). The plant location and flexible technology acquisition problem. European Journal of Operational Research, 136(2):366-382.
  24. Verter, V. and Dincer, M. (1995). Facility location and capacity acquisition: an integrated approach. Naval Research Logistics (NRL), 42(8):1141-1160.
  25. Xu, X., Li, X., Li, X., and Lin, H. (2010). An improved scatter search algorithm for capacitated p-median problem. In Computer Engineering and Technology (ICCET), 2010 2nd International Conference on, volume 2, pages V2-316. IEEE.
  26. Yaghini, M., Karimi, M., and Rahbar, M. (2013). A hybrid metaheuristic approach for the capacitated p-median problem. Applied Soft Computing, 13(9):3922 - 3930.
Download


Paper Citation


in Harvard Style

Xu C., Lisser A., Leung J. and Letournel M. (2014). The p-Median Problem with Concave Costs . In Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-017-8, pages 205-212. DOI: 10.5220/0004832502050212


in Bibtex Style

@conference{icores14,
author={Chuan Xu and Abdel Lisser and Janny Leung and Marc Letournel},
title={The p-Median Problem with Concave Costs},
booktitle={Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2014},
pages={205-212},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004832502050212},
isbn={978-989-758-017-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - The p-Median Problem with Concave Costs
SN - 978-989-758-017-8
AU - Xu C.
AU - Lisser A.
AU - Leung J.
AU - Letournel M.
PY - 2014
SP - 205
EP - 212
DO - 10.5220/0004832502050212