Skip to main content
SpringerLink
Log in

Fixed Set Search Applied to the Territory Design Problem

  • Conference paper
  • First Online:
Metaheuristics (MIC 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13838))

Included in the following conference series:

  • 482 Accesses

Abstract

In this paper, we apply the novel fixed set search (FSS) metaheuristic in combination with mixed-integer programming to solve the Territory Design Problem (TDP). In this matheuristic approach, we select the territory centers with an extended greedy randomised adaptive search procedure (GRASP) while optimising the subproblem of the territory-center allocation with a standard mixed-integer programming solver. The FSS adds a learning procedure to GRASP and helps us to narrow down the most common territory centers in the solution population in order to fix them. This improves the speed of the optimisation and helps to find high-quality solutions on all instances of our computational study at least once within a small number of runs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Note added in proof: Switching to the latest version of a different solver, this picture changed but this is not reported here.

References

  1. Blum, C., Pinacho, P., López-Ibáñez, M., Lozano, J.A.: Construct, merge, solve & adapt A new general algorithm for combinatorial optimization. Comput. Oper. Res. 68, 75–88 (2016). https://doi.org/10.1016/j.cor.2015.10.014

    Article  MathSciNet  MATH  Google Scholar 

  2. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269–271 (1959). https://doi.org/10.1007/BF01386390

    Article  MathSciNet  MATH  Google Scholar 

  3. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Global Optim. 6(2), 109–133 (1995). https://doi.org/10.1007/bf01096763

    Article  MathSciNet  MATH  Google Scholar 

  4. Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP - part I: algorithms. Int. Trans. Oper. Res. 16(1), 1–24 (2009). https://doi.org/10.1111/j.1475-3995.2009.00663.x

    Article  MathSciNet  MATH  Google Scholar 

  5. Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP - part II: applications. Int. Trans. Oper. Res. 16(2), 131–172 (2009). https://doi.org/10.1111/j.1475-3995.2009.00664.x

    Article  MathSciNet  MATH  Google Scholar 

  6. Festa, P., Resende, M.G.C.: Hybridizations of GRASP with path-relinking. In: Talbi, E.G. (ed.) Hybrid Metaheuristics. Studies in Computational Intelligence, vol. 434, pp. 135–155. Springer, Berlin, Heidelberg (2013). https://doi.org/10.1007/978-3-642-30671-6_5

    Chapter  Google Scholar 

  7. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY (1979)

    MATH  Google Scholar 

  8. Ge, L., Kliewer, N., Nourmohammadzadeh, A., Voß, S., Xie, L.: Revisiting the richness of integrated vehicle and crew scheduling. Public Transp. (2022). https://doi.org/10.1007/s12469-022-00292-6

    Article  Google Scholar 

  9. Geofabrik GmbH and OpenStreetMap Contributors: OpenStreetMap Data Hamburg (2020). https://download.geofabrik.de/europe/germany/hamburg.html

  10. Hart, J.P., Shogan, A.W.: Semi-greedy heuristics: an empirical study. Oper. Res. Lett. 6(3), 107–114 (1987). https://doi.org/10.1016/0167-6377(87)90021-6

    Article  MathSciNet  MATH  Google Scholar 

  11. Hill, A., Voß, S.: An equi-model matheuristic for the multi-depot ring star problem. Networks 67(3), 222–237 (2016). https://doi.org/10.1002/net.21674

    Article  Google Scholar 

  12. Jovanovic, R., Sanfilippo, A.P., Voß, S.: Fixed set search applied to the multi-objective minimum weighted vertex cover problem. J. Heuristics 28, 481–508 (2022). https://doi.org/10.1007/s10732-022-09499-z

    Article  Google Scholar 

  13. Jovanovic, R., Tuba, M., Voß, S.: Fixed set search applied to the traveling salesman problem. Lect. Notes Comput. Sci. 11299, 63–77 (2019). https://doi.org/10.1007/978-3-030-05983-5_5

    Article  Google Scholar 

  14. Jovanovic, R., Voss, S.: The fixed set search applied to the power dominating set problem. Expert. Syst. 37(6), e12559 (2020). https://doi.org/10.1111/exsy.12559

    Article  Google Scholar 

  15. Jovanovic, R., Voß, S.: Fixed set search applied to the minimum weighted vertex cover problem. Lect. Notes Comput. Sci. 11544, 490–504 (2019). https://doi.org/10.1007/978-3-030-34029-2_31

    Article  MathSciNet  Google Scholar 

  16. Jovanovic, R., Voß, S.: A matheuristic approach for solving the 2-connected dominating set problem. Appl. Anal. Discrete Math. 14(3), 775–799 (2020). https://doi.org/10.2298/aadm190227052j

    Article  MathSciNet  MATH  Google Scholar 

  17. Jovanovic, R., Voß, S.: Fixed set search application for minimizing the makespan on unrelated parallel machines with sequence-dependent setup times. Appl. Soft Comput. 110, 107521 (2021). https://doi.org/10.1016/j.asoc.2021.107521

    Article  Google Scholar 

  18. Kalcsics, J., Nickel, S., Schröder, M.: Towards a unified territorial design approach – applications, algorithms and GIS integration. TOP 13(1), 1–56 (2005). https://doi.org/10.1007/BF02578982

    Article  MathSciNet  MATH  Google Scholar 

  19. Kalcsics, J., Ríos-Mercado, R.Z.: Districting problems. In: Laporte, G., Nickel, S., Saldanha da Gama, F. (eds.) Location Sci., pp. 705–743. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-32177-2_25

    Chapter  Google Scholar 

  20. Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. II: the p-medians. SIAM J. Appl. Math. 37(3), 539–560 (1979). https://doi.org/10.2307/2100911

    Article  MathSciNet  MATH  Google Scholar 

  21. Maniezzo, V., Stützle, T., Voß, S. (eds.): Matheuristics: hybridizing metaheuristics and mathematical programming. Springer, Cham (2009). https://doi.org/10.1007/978-1-4419-1306-7

    Book  MATH  Google Scholar 

  22. Mitchell, P.S.: Optimal selection of police patrol beats. J. Crim. Law Criminol. Police Sci. 63(4), 577 (1972). https://doi.org/10.2307/1141814

    Article  Google Scholar 

  23. Mittelmann, H.D.: Benchmarking optimization software - a (Hi)story. SN Oper. Res. Forum 1(1), 1–6 (2020). https://doi.org/10.1007/s43069-020-0002-0

    Article  MathSciNet  MATH  Google Scholar 

  24. Önal, H., Wang, Y., Dissanayake, S.T., Westervelt, J.D.: Optimal design of compact and functionally contiguous conservation management areas. Eur. J. Oper. Res. 251(3), 957–968 (2016). https://doi.org/10.1016/j.ejor.2015.12.005

    Article  MathSciNet  MATH  Google Scholar 

  25. Resende, M.G., Ribeiro, C.C.: Greedy randomized adaptive search procedures: advances, hybridizations, and applications. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 283–319. Springer, Boston (2010). https://doi.org/10.1007/978-1-4419-1665-5_10

    Chapter  Google Scholar 

  26. Ríos-Mercado, R.Z.: Research trends in optimization of districting systems. In: Ríos-Mercado, R.Z. (ed.) Optimal Districting and Territory Design. ISORMS, vol. 284, pp. 3–8. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-34312-5_1

    Chapter  MATH  Google Scholar 

  27. Ríos-Mercado, R.Z., Fernández, E.: A reactive GRASP for a commercial territory design problem with multiple balancing requirements. Comput. Oper. Res. 36(3), 755–776 (2009). https://doi.org/10.1016/j.cor.2007.10.024

    Article  MATH  Google Scholar 

  28. Taillard, E.D., Voß, S.: Popmusic—partial optimization metaheuristic under special intensification conditions. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics. Operations Research/Computer Science Interfaces Series, vol. 15, pp. 613–629. Springer, Boston (2002). https://doi.org/10.1007/978-1-4615-1507-4_27

    Chapter  Google Scholar 

  29. Talbi, E.-G.: Combining metaheuristics with mathematical programming, constraint programming and machine learning. Ann. Oper. Res. 240(1), 171–215 (2015). https://doi.org/10.1007/s10479-015-2034-y

    Article  MathSciNet  MATH  Google Scholar 

  30. Voß, S., Lalla-Ruiz, E.: A set partitioning reformulation for the multiple-choice multidimensional knapsack problem. Eng. Optim. 48(5), 831–850 (2016). https://doi.org/10.1080/0305215X.2015.1062094

    Article  MathSciNet  Google Scholar 

  31. Zoltners, A.A., Sinha, P.: Sales territory alignment: a review and model. Manage. Sci. 29, 1237–1256 (1983). https://doi.org/10.1287/mnsc.29.11.1237

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Operations Management, University of Hamburg, Moorweidenstraße 18, 20148, Hamburg, Germany

    Tobias Cors

  2. Institute of Logistics, Transport and Production, University of Hamburg, Moorweidenstraße 18, 20148, Hamburg, Germany

    Tobias Vlćek

  3. Institute of Information Systems, University of Hamburg, Von-Melle-Park 5, 20146, Hamburg, Germany

    Stefan Voß

  4. Qatar Environment and Energy Research Institute, Hamad bin Khalifa University, PO Box 5825, Doha, Qatar

    Raka Jovanovic

Authors
  1. Tobias Cors
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tobias Vlćek
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stefan Voß
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Raka Jovanovic
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stefan Voß .

Editor information

Editors and Affiliations

  1. University of Udine, Udine, Italy

    Luca Di Gaspero

  2. University of Napoli - Federico II, Napoli, Italy

    Paola Festa

  3. University of Paris Est, Paris, France

    Amir Nakib

  4. University of Catania, Catania, Italy

    Mario Pavone

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Cors, T., Vlćek, T., Voß, S., Jovanovic, R. (2023). Fixed Set Search Applied to the Territory Design Problem. In: Di Gaspero, L., Festa, P., Nakib, A., Pavone, M. (eds) Metaheuristics. MIC 2022. Lecture Notes in Computer Science, vol 13838. Springer, Cham. https://doi.org/10.1007/978-3-031-26504-4_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-26504-4_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-26503-7

  • Online ISBN: 978-3-031-26504-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation