Advertisement

Journal of Heuristics

, Volume 22, Issue 4, pp 507–537 | Cite as

Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex \(p\)-centre problems

  • Chandra Ade Irawan
  • Said Salhi
  • Zvi Drezner
Article

Abstract

Large-scale unconditional and conditional vertex \(p\)-centre problems are solved using two meta-heuristics. One is based on a three-stage approach whereas the other relies on a guided multi-start principle. Both methods incorporate Variable Neighbourhood Search, exact method, and aggregation techniques. The methods are assessed on the TSP dataset which consist of up to 71,009 demand points with \(p\) varying from 5 to 100. To the best of our knowledge, these are the largest instances solved for unconditional and conditional vertex \(p\)-centre problems. The two proposed meta-heuristics yield competitive results for both classes of problems.

Keywords

Large unconditional and conditional vertex \(p\)-centre Aggregation Variable neighbourhood search Exact method 

Notes

Acknowledgments

The authors would like to thank both referees for their useful suggestions that improved both the content as well as the presentation of the paper. We are also grateful to the Indonesian Government and Department of Industrial Engineering—ITENAS Bandung, Indonesia for the sponsorship of the first author.

References

  1. Al-Khedhairi, A., Salhi, S.: Enhancements to two exact algorithms for solving the vertex \(p\)-center problem. J. Math. Model. Algorithm 4, 129–147 (2005)MathSciNetCrossRefMATHGoogle Scholar
  2. Avella, P., Boccia, M., Salerno, S., Vasilyev, I.: An aggregation heuristic for large scale p-median problem. Comput. Oper. Res. 39(7), 1625–1632 (2012)MathSciNetCrossRefMATHGoogle Scholar
  3. Barua, S., Sander, J.: Mining statistically sound co-location patterns at multiple distances. In: Proceedings of the 26th International Conference on Scientific and Statistical Database Management, Article No. 7 (2014)Google Scholar
  4. Berman, O., Drezner, Z.: A new formulation for the conditional \(p\)-median and \(p\)-center problems. Oper. Res. Lett. 36, 481–483 (2008)MathSciNetCrossRefMATHGoogle Scholar
  5. Berman, O., Simchi-Levi, D.: The conditional location problem on networks. Transp. Sci. 24, 77–78 (1990)MathSciNetCrossRefMATHGoogle Scholar
  6. Bozkaya, B., Tansel, B.: A spanning tree approach to the absolute \(p-\)center problem. Locat. Sci. 6, 83–107 (1998)CrossRefGoogle Scholar
  7. Calik, H., Tansel, B.C.: Double bound method for solving the \(p\)-center location problem. Comput. Oper. Res. 40, 2991–2999 (2013)MathSciNetCrossRefGoogle Scholar
  8. Caruso, C., Colorni, A., Aloi, L.: Dominant, an algorithm for the \(p\)-center problem. Eur. J. Oper. Res. 149, 53–64 (2003)MathSciNetCrossRefMATHGoogle Scholar
  9. Casillas, P.: Aggregation problems in location-allocation modeling. In: Gosh, A., Rushton, G. (eds.) Spatial analysis and location-allocation models, pp. 327–344. Van Nostrand Reinhold, New York (1987)Google Scholar
  10. Chen, D., Chen, R.: New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems. Comput. Oper. Res. 36, 1646–1655 (2009)MathSciNetCrossRefMATHGoogle Scholar
  11. Chen, D., Chen, R.: A relaxation-based algorithm for solving the conditional p-center problem. Oper. Res. Lett. 38, 215–217 (2010)MathSciNetCrossRefMATHGoogle Scholar
  12. Chen, R.: Conditional minisum and minimax location-allocation problems in euclidean space. Transp. Sci. 22, 158–160 (1990)MathSciNetGoogle Scholar
  13. Cheng, T.C.E., Kang, L., Ng, C.T.: An improved algorithm for the p-center problem on interval graphs with unit lengths. Comput. Oper. Res. 34, 2215–2222 (2007)MathSciNetCrossRefMATHGoogle Scholar
  14. Current, J.R., Schilling, D.A.: Elimination of source A and B errors in \(p\)-median location problems. Geogr. Anal. 19, 95–110 (1987)CrossRefGoogle Scholar
  15. Daskin, M.S.: Network and discrete location: models, algorithms, and applications. Wiley, New York (1995)CrossRefMATHGoogle Scholar
  16. Daskin, M.S.: A new approach to solving the vertex \(p\)-center problem to optimality: algorithm and computational results. Commun. Oper. Res. Soc. Jpn. 45, 428–436 (2000)Google Scholar
  17. Davidovic, T., Ramljak, D., Selmic, M., Teodorovic, D.: Bee colony optimization for the \(p\)-center problem. Comput. Oper. Res. 38, 1367–1376 (2011)MathSciNetCrossRefMATHGoogle Scholar
  18. Dongarra, J.J.: Performance of various computers using standard linear equation software. http://www.netlib.org/benchmark/performance.pdf. Accessed 15 April 2013
  19. Drezner, Z.: The \(p\)-Centre problem-heuristic and optimal algorithms. J. Oper. Res. Soc. 35, 741–748 (1984)MATHGoogle Scholar
  20. Drezner, Z.: Conditional \(p\)-center problems. Transp. Sci. 23, 51–3 (1989)MathSciNetCrossRefMATHGoogle Scholar
  21. Drezner, Z.: On the conditional p-median problem. Comput. Oper. Res. 22, 525–530 (1995)CrossRefMATHGoogle Scholar
  22. Elloumi, S., Labbe, M., Pochet, Y.: A new formulation and resolution method for the \(p\)-center problem. INFORMS J. Comput. 16, 84–94 (2004)MathSciNetCrossRefMATHGoogle Scholar
  23. Fortney, J., Rost, K., Warren, J.: Comparing alternative methods of measuring geographic access to health services. Health Serv. Outcomes Res. Methodol. 1, 173–184 (2000)CrossRefGoogle Scholar
  24. Francis, R.L., Lowe, T.J., Tamir, A.: Demand Point Aggregation Analysis for a Class of Constrained Location Models: A Penalty Function Approach. IIE Trans. 36, 601–609 (2004a)CrossRefGoogle Scholar
  25. Francis, R.L., Lowe, T.J., Tamir, A., Emir-Farinas, H.: Aggregation Decomposition and Aggregation Guidelines for a Class of Minimax and Covering Location Models. Geogr. Anal. 36, 332–349 (2004b)CrossRefMATHGoogle Scholar
  26. Francis, R.L., Rayco, M.B.: Asymptotically optimal aggregation for some unweighted \(p\)-center problems with rectilinear distances. Stud. Locat. Anal. 10, 25–36 (1996)MathSciNetMATHGoogle Scholar
  27. Francis, R.L., Lowe, T.J., Rayco, M.B., Tamir, A.: Aggregation error for location models: survey and analysis. Ann. Oper. Res. 167, 171–208 (2009)MathSciNetCrossRefMATHGoogle Scholar
  28. Gamal, M.D.H., Salhi, S.: Constructive heuristics for the uncapacitated continuous location-allocation problem. J. Oper. Res. Soc. 52, 821–829 (2001)CrossRefMATHGoogle Scholar
  29. Hakimi, S.L.: Optimum locations of switching centers and the absolute centers and medians of a graph. Oper. Res. 12, 450–459 (1964)CrossRefMATHGoogle Scholar
  30. Hansen, P., Brimberg, J., Urosevic, D., Mladenovic, N.: Solving large p-median clustering problems by primal-dual variable neighborhood search. Data Min. Knowl. Discov. 19, 351–375 (2009)MathSciNetCrossRefGoogle Scholar
  31. Hansen, P., Mladenovic, N.: Variable neighbourhood search for the p-median. Locat. Sci. 5, 207–225 (1997)CrossRefMATHGoogle Scholar
  32. Hansen, P., Mladenovic, N., Perez, J.A.M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175, 367–407 (2010)MathSciNetCrossRefMATHGoogle Scholar
  33. Hillsman, E.L., Rhoda, R.: Errors in measuring distances from populations to service centers. Ann. Reg. Sci. 12, 74–88 (1978)CrossRefGoogle Scholar
  34. Ilhan, T., Pinar, M.: An efficient exact algorithm for the vertex \(p\)-center problem (2001). http://www.ie.bilkent.edu.tr/~mustafap/pubs/
  35. Irawan, C.A., Salhi, S.: Solving large p-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search. J. Glob. Optim. (2013). doi: 10.1007/s10898-013-0080-z
  36. Irawan, C.A., Salhi, S., Scaparra, M.P.: An adaptive multiphase approach for large unconditional and conditional p-median problems. Eur. J. Oper. Res. 237, 590–605 (2014)MathSciNetCrossRefMATHGoogle Scholar
  37. Jaeger, M., Kariv, O.: Algorithms for finding \(p\)-centers on a weighted tree (for relatively small \(p)\). Networks 15, 381–389 (1985)MathSciNetCrossRefMATHGoogle Scholar
  38. Kariv, O., Hakimi, S.L.: An algorithmic approach for the vertex \(p-\)center problem. Part I: The \(p-\)centers. SIAM J. Appl. Math. 37, 513–538 (1979)MathSciNetCrossRefMATHGoogle Scholar
  39. Kaveh, A., Nasr, H.: Solving the conditional and unconditional \(p\)-center problem with modified harmony search: a real case study. Sci. Iran. A. 18, 867–877 (2011)CrossRefGoogle Scholar
  40. Liu, S., Liu, Y., Ni, L. M., Fan, J., Li, M.: Towards Mobility-based Clustering. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 919–928 (2010)Google Scholar
  41. Lu, C.: Robust weighted vertex \(p\)-center model considering uncertain data: An application to emergency management. Eur. J. Oper. Res. 230, 113–121 (2013)MathSciNetCrossRefMATHGoogle Scholar
  42. Lu, C., Sheu, J.: Robust vertex \(p\)-center model for locating urgent relief distribution centers. Comput. Oper. Res. 40, 2128–2137 (2013)MathSciNetCrossRefGoogle Scholar
  43. Minieka, E.: The \(m\)-center problem. SIAM Rev. 12, 138–139 (1970)MathSciNetCrossRefMATHGoogle Scholar
  44. Minieka, E.: Conditional centers and medians on a graph. Networks 10, 265–272 (1980)MathSciNetCrossRefGoogle Scholar
  45. Mladenovic, N., Labbe, M., Hansen, P.: Solving the \(p-\)center problem with tabu search and variable neighbourhood search. Networks 42, 48–64 (2003)MathSciNetCrossRefMATHGoogle Scholar
  46. Qu, Q., Liu, S., Yang, B. Jensen, C.S.: Integrating non-spatial preferences into spatial location queries. In: Proceedings of the 26th International Conference on Scientific and Statistical Database Management, Article No. 8 (2014)Google Scholar
  47. Rayco, M.B., Francis, R.L., Lowe, T.J.: Error-bound driven demand point aggregation for the rectilinear distance \(p\)-center model. Locat. Sci. 4, 213–235 (1997)CrossRefMATHGoogle Scholar
  48. Rayco, M.B., Francis, R.L., Tamir, A.: A \(p\)-center grid-positioning aggregation procedure. Comput. Oper. Res. 26, 1113–1124 (1999)MathSciNetCrossRefMATHGoogle Scholar
  49. Salhi, S., Al-Khedhairi, A.: Integrating heuristic information into exact methods: the case of the vertex \(p-\)centre problem. J. Oper. Res. Soc. 61, 1619–1631 (2010)CrossRefMATHGoogle Scholar
  50. Salhi, S., Sari, M.: A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. Eur. J. Oper. Res. 103, 95–112 (1997)CrossRefMATHGoogle Scholar
  51. Shaw, D.X.: A unified limited column generation approach for facility location problems on trees. Ann. Oper. Res. 87, 363–382 (1999)MathSciNetCrossRefMATHGoogle Scholar
  52. Tansel, B.C., Francis, R.L., Lowe, T.J.: State of the art-location on network: a survey. Part I: the \(p\)-center and \(p\)-median problems. Manag. Sci. 29, 482–497 (1983a)Google Scholar
  53. Tansel, B.C., Francis, R.L., Lowe, T.J.: State of the art-location on network: a survey. Part II: exploiting tree network structure. Manag. Sci. 29, 498–511 (1983b)Google Scholar
  54. Tansel, B.C., Francis, R.L., Lowe, T.J., Chen, M.: Duality and distance constraints for the nonlinear \(p-\)center and covering problem on a tree network. Oper. Res. 30, 725–744 (1982)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Centre for Operational Research and Logistics (CORL), Department of MathematicsUniversity of PortsmouthLion TerraceUK
  2. 2.Department of Industrial EngineeringInstitut Teknologi NasionalBandungIndonesia
  3. 3.Centre for Logistics & Heuristic Optimization (CLHO)Kent Business School, University of KentCanterburyUK
  4. 4.Department of Information Systems and Decision Sciences, Steven G. Mihaylo College of Business and EconomisCalifornia State University-FullertonFullertonUSA

Personalised recommendations