Document Open Access Logo

A CP/LS Heuristic Method for Maxmin and Minmax Location Problems with Distance Constraints

Authors Panteleimon Iosif , Nikolaos Ploskas , Kostas Stergiou , Dimosthenis C. Tsouros

PDF
Thumbnail PDF

File

LIPIcs.CP.2024.14.pdf
  • Filesize: 0.71 MB
  • 21 pages

Document Identifiers

Author Details

Panteleimon Iosif
  • University of Western Macedonia, Kozani, Greece
Nikolaos Ploskas
  • University of Western Macedonia, Kozani, Greece
Kostas Stergiou
  • University of Western Macedonia, Kozani, Greece
Dimosthenis C. Tsouros
  • KU Leuven, Belgium

Cite AsGet BibTex

Panteleimon Iosif, Nikolaos Ploskas, Kostas Stergiou, and Dimosthenis C. Tsouros. A CP/LS Heuristic Method for Maxmin and Minmax Location Problems with Distance Constraints. In 30th International Conference on Principles and Practice of Constraint Programming (CP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 307, pp. 14:1-14:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.CP.2024.14

Abstract

In facility location problems we seek to locate a set of facilities in an area, where clients may be present, so that some criterion is optimized. For instance, in the p-center problem we seek to minimize the maximum distance between any client and its closest facility, whereas in the p-dispersion problem we seek to maximize the minimum distance between any two facilities. Hence, in the former we have a minmax objective, whereas in the latter we have a maxmin objective. Recently, a variant of p-dispersion where distance constraints exist between facilities was studied from a CP and ILP perspective. An incomplete CP solver that uses a greedy heuristic to prune branches was shown to significantly outperform Gurobi and OR-Tools in terms of execution time, although it failed to discover optimal or near-optimal solutions in many instances. We enhance this work in two directions, regarding the effectiveness and the applicability of the approach. We first show how local search can be used to obtain better estimations of the bound at each node, resulting in more focused pruning, which allows for optimal or near-optimal solutions to be discovered in many more instances. Then, we demonstrate how the framework can be applied on the p-center problem with distance constraints, comparing it to ILP and CP models implemented in Gurobi and OR-Tools, respectively.

Subject Classification

ACM Subject Classification
  • Theory of computation → Constraint and logic programming
Keywords
  • Constraint Programming
  • Local Search
  • facility location
  • distance constraints
  • optimization

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. T. Argo and E. Sandstrom. Separation distances in NFPA codes and standards (tech. rep.). Fire Protection Research Foundation. 2014. Google Scholar
  2. M.L. Balinski. Integer programming: methods, uses, computations. Management Science, 12(3):253-313, 1965. Google Scholar
  3. J.E. Beasley. A note on solving large p-median problems. European Journal of Operational Research, 21(2):270-273, 1985. Google Scholar
  4. O. Berman and R. Huang. The minimum weighted covering location problem with distance constraints. Computers and Operations Research, 35(12):356-372, 2008. URL: https://doi.org/10.1016/j.cor.2006.03.003.
  5. F. Boussemart, F. Heremy, C. Lecoutre, and L. Sais. Boosting systematic search by weighting constraints. In Proceedings of ECAI'04, pages 482-486, 2004. Google Scholar
  6. H. Calik and B.C. Tansel. Double bound method for solving the p-center location problem. Comput. Oper. Res., 40(12):2991-2999, 2013. URL: https://doi.org/10.1016/j.cor.2013.07.011.
  7. H. Cambazard, D. Mehta, B. O'Sullivan, and L. Quesada. A computational geometry-based local search algorithm for planar location problems. In Proceedings of the 9th International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2012), pages 97-112, 2012. Google Scholar
  8. S. Chaudhry, T. McCormick, and I. D. Moon. Locating independent facilities with maximum weight: Greedy heuristics. International Journal of Management Science, 14(5):383-389, 1986. Google Scholar
  9. R. L. Church and M. E. Meadows. Results of a new approach to solving the p-median problem with maximum distance constraints. Geographical Analysis, 9(4):364-378, 1977. Google Scholar
  10. V. Chvatal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4(3):233-235, 1979. URL: https://doi.org/10.1287/moor.4.3.233.
  11. W. Comley. The location of ambivalent facilities: Use of a quadratic zero-one programming algorithm. Applied Mathematical Modeling, 19(1):26-29, 1995. Google Scholar
  12. Z. Dai, K. Xu, and M. Ornik. Repulsion-based p-dispersion with distance constraints in non-convex polygons. Annals of Operations Research, 307:75-91, 2021. URL: https://doi.org/10.1007/s10479-021-04281-z.
  13. M.S. Daskin. Network and discrete location: models, algorithms, and applications, 2nd edn. Wiley, Hoboken, 2013. Google Scholar
  14. Choco development team. An Open-Source java library for constraint programming. https://choco-solver.org/. Google Scholar
  15. OR-Tools development team. OR-Tools, CP-SAT solver. https://developers.google.com/optimization/cp/cp_solver. Google Scholar
  16. T. Drezner, Z. Drezner, and A. Schöbel. The weber obnoxious facility location model: A big arc small arc approach. Computers and Operations Research, 98:240-250, 2018. URL: https://doi.org/10.1016/j.cor.2018.06.006.
  17. Z. Drezner, P. Kalczynski, and S. Salhi. The planar multiple obnoxious facilities location problem: A Voronoi based heuristic. Omega, 87:105-116, 2019. Google Scholar
  18. S. Elloumi, M. Labbé, and Y. Pochet. A new formulation and resolution method for the p-center problem. INFORMS J. Comput., 16(1):83-94, 2004. URL: https://doi.org/10.1287/ijoc.1030.0028.
  19. E. Erkut. The discrete p-dispersion problem. European Journal of Operational Research, 46(1):48-60, 1990. Google Scholar
  20. E. Erkut and S. Neuman. Analytical models for locating undesirable facilities. European Journal of Operational Research, 40(3):275-291, 1989. Google Scholar
  21. E. Erkut and S. Neuman. Comparison of four models for dispersing facilities. Information Systems and Operational Research, 29:68-86, 1991. Google Scholar
  22. E. Erkut, Y. Ülküsal, and O. Yeniçerioglu. A comparison of p-dispersion heuristics. Computers & Operations Research, 21(10):1103-1113, 1994. URL: https://doi.org/10.1016/0305-0548(94)90041-8.
  23. M. M. Fazel-Zarandi and J. C. Beck. Solving a location-allocation problem with logic-based benders' decomposition. In Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming (CP 2009), pages 344-351, 2009. Google Scholar
  24. F. Focacci, F. Laburthe, and A. Lodi. Local search and constraint programming. In F.W. Glover and G.A. Kochenberger, editors, Handbook of Metaheuristics, volume 57 of International Series in Operations Research & Management Science, pages 369-403. Kluwer / Springer, 2003. URL: https://doi.org/10.1007/0-306-48056-5_13.
  25. J. B. Ghosh. Computational aspects of the maximum diversity problem. Operations Research Letters, 19(4):175-181, 1996. URL: https://doi.org/10.1016/0167-6377(96)00025-9.
  26. C. Gomes and M. Sellmann. Streamlined constraint reasoning. In Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP 2004), pages 274-289, 2004. Google Scholar
  27. T. Guns. Increasing modeling language convenience with a universal n-dimensional array, CPpy as python-embedded example. In Proceedings of the 18th Workshop on Constraint Modelling and Reformulation, 2019. Google Scholar
  28. LLC Gurobi Optimization. Gurobi optimizer reference manual. , 2023. URL: https://www.gurobi.com.
  29. S.L. Hakimi. Optimum locations of switching centers and the absolute centers and medians of a graph. Operations Research, 12(3):450-459, 1964. Google Scholar
  30. S.L. Hakimi. Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Operations Research, 13(3):462-475, 1965. Google Scholar
  31. N. Isoart and J.-C. Régin. A k-Opt Based Constraint for the TSP. In Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), 2021. Google Scholar
  32. B. M. Khumawala. An efficient algorithm for the p-median problem with maximum distance constraints. Geographical Analysis, 5(4):309-321, 1973. Google Scholar
  33. J. Krarup, D. Pisinger, and F. Plastria. Discrete location problems with push-pull objectives. Discrete Applied Mathematics, 123(1-3):363-378, 2002. URL: https://doi.org/10.1016/S0166-218X(01)00346-8.
  34. M. J. Kuby. Programming models for facility dispersion: The p-dispersion and maxisum dispersion problems. Mathematical and Computer Modelling, 10(10):792, 1988. Google Scholar
  35. A.A. Kuehn and M.J. Hamburger. A heuristic program for locating warehouses. Management Science, 9:643-666, 1963. Google Scholar
  36. M.Z. Lagerkvist and M. Rattfeldt. Half-checking propagators. In Proceedings of the 19th Workshop on Constraint Modelling and Reformulation, 2020. Google Scholar
  37. R. Marti, A. Martinez-Gavara, S. Perez-Pelo, and J. Sanchez-Oro. A review on discrete diversity and dispersion maximization from an OR perspective. European Journal of Operational Research, 299(3):795-813, 2022. URL: https://doi.org/10.1016/j.ejor.2021.07.044.
  38. I. D. Moon and S. Chaudhry. An analysis of network location problems with distance constraints. Management Science, 30(3):290-307, 1984. Google Scholar
  39. I. D. Moon and L. Papayanopoulos. Minimax location of two facilities with minimum separation: Interactive graphical solutions. Journal of the Operations Research Society, 42:685-694, 1991. Google Scholar
  40. A.T. Murray, R.L. Church, R.A. Gerrard, and W.S. Tsui. Impact models for siting undesirable facilities. Papers in Regional Science, 77(1):19-36, 1998. Google Scholar
  41. N. Ploskas, K. Stergiou, and D.C. Tsouros. The p-dispersion problem with distance constraints. In Roland H. C. Yap, editor, 29th International Conference on Principles and Practice of Constraint Programming, CP 2023, August 27-31, 2023, Toronto, Canada, volume 280 of LIPIcs, pages 30:1-30:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/LIPIcs.CP.2023.30.
  42. D. Sabin and E.C. Freuder. Contradicting conventional wisdom in constraint satisfaction. In A.G. Cohn, editor, Proceedings of the Eleventh European Conference on Artificial Intelligence, Amsterdam, The Netherlands, August 8-12, 1994, pages 125-129, 1994. Google Scholar
  43. D. Sayah and S. Irnich. A new compact formulation for the discrete p-dispersion problem. European Journal of Operational Research, 256(1):62-67, 2017. URL: https://doi.org/10.1016/j.ejor.2016.06.036.
  44. F. Sayyady and Y Fathi. An integer programming approach for solving the p-dispersion problem. European Journal of Operational Research, 253(1):216-225, 2016. URL: https://doi.org/10.1016/j.ejor.2016.02.026.
  45. D. R. Shier. A min-max theorem for p-center problems on a tree. Transportation Science, 11:243-252, 1977. Google Scholar
  46. S.Y.D. Sorkhabi, D.A. Romero, J.C. Beck, and C. Amon. Constrained multi-objective wind farm layout optimization: Novel constraint handling approach based on constraint programming. Renewable Energy, 126(C):341-353, 2018. Google Scholar
  47. B.C. Tansel, R.L. Francis, T.J. Lowe, and M.L. Chen. Duality and distance constraints for the nonlinear p-center problem and covering problem on a tree network. Operations Research, 30(4):725-744, 1982. URL: https://doi.org/10.1287/opre.30.4.725.
  48. S.B. Welch and S. Salhi. The obnoxious p facility network location problem with facility interaction. European Journal of Operations Research, 102:302-319, 1997. Google Scholar
  49. 49 C.F.R. §175.701. Separation distance requirements for packages containing class 7 (radioactive) materials in passenger-carrying aircraft. Title 49 Code of Federal Regulations, Part 175. 2021. Google Scholar
  50. 29 C.F.R. §1910.157. Portable fire extinguishers. Title 29 Code of Federal Regulations, Part 157. 2021. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact