Skip to main content

A Multiobjective Metaheuristic for Spatial-based Redistricting

  • Conference paper
Applied Soft Computing Technologies: The Challenge of Complexity

Part of the book series: Advances in Soft Computing ((AINSC,volume 34))

Abstract

This study has developed and evaluated a multiobjective metaheuristic for redistricting to draw territory lines for geographical zones for the purpose of space control. The proposed multiobjective metaheuristic is briefly explained to shows its components and functionality. The redistricting problem definition is discussed, followed by the metaheuristic and the multiobjective decision rules. Then, an experiment is conducted in Geographic Information System (GIS) to shows its performances especially in term of its quality of result. The focus of the experiment is on the performance analysis of the coverage of the approximately non-dominated solution set and the number of objectives defined. The result of the experiment has demonstrated an improvement.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Agnew, J. (1994), “Geography and regional science program: geographic approaches to democratization,” National Science Foundation, Washington.

    Google Scholar 

  2. Alves, M.J. & Clímaco, M. (2000), “An interactive method for 0–1 multiobjective problems using simulated annealing and tabu search,” Journal of Heuristics 6: 385–403

    Article  MATH  Google Scholar 

  3. Battiti, R. & Tecchiolli, G. (1994), “The reactive tabu search,” ORSA Journal on Computing 6(2): 126–140

    MATH  Google Scholar 

  4. Bong, C.W. and Wang, Y.C. (2004), “An intelligent GIS-based spatial zoning with multiobjective hybrid metaheuristic method,” Proceeding of The 17th International Conference On Industrial & Engineering Applications of Artificial Intelligence And Expert System (IEA/EIA 2004), University of Otawa, Canada.

    Google Scholar 

  5. Bozkaya, B., Erkut, E. and Laporte, G. (2003), “A Tabu Search Heuristic and Adaptive Memory Procedure for Political Districting,” European Journal of Operational Research 144, pp. 12–26.

    Article  MATH  Google Scholar 

  6. Czyzak, P and Jaszkiewicz, A. (1998), “Pareto simulated annealing–a metaheuristic technique for multiple objective combinatorial optimization,” Journal of Multi-Criteria Decision Analysis 7, pp.34–47.

    Article  MATH  Google Scholar 

  7. Gandibleux, X. & Freville, A. (2000), “Tabu search based procedure for solving the 0–1 multiobjective knapsack problem: the two objectives case,” Journal of Heuristics 6: 361–383

    Article  MATH  Google Scholar 

  8. Glover, F. and Laguna, M. (2002), “Tabu search,” in Pardalos, P. M. and Resende, M. G. C. (eds.), Handbook of Applied Optimization, Oxford University Press, pp. 194–208

    Google Scholar 

  9. Glover, F. (1998), “A template for scatter search and path relinking,” in Hao, J.-K., Lutton, E., Ronald, E., Schoenauer M. and Snyers, D. (eds.), Artificial Evolution, Lecture Notes in Computer Science, 1363, pp.13–54.

    Google Scholar 

  10. Hansen, M.P. (1997), “Tabu search for multiobjective optimization: MOTS,” Proceedings of MCDM′97

    Google Scholar 

  11. Jaszkiewicz, A. (2001), Multiple Objective Metaheuristic Algorithms for Combinatorial Optimisation (Draft), Habilitation thesis 360, Poznan University of Technology, Poznan.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer

About this paper

Cite this paper

Wei, B.C. (2006). A Multiobjective Metaheuristic for Spatial-based Redistricting. In: Abraham, A., de Baets, B., Köppen, M., Nickolay, B. (eds) Applied Soft Computing Technologies: The Challenge of Complexity. Advances in Soft Computing, vol 34. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-31662-0_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-31662-0_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31649-7

  • Online ISBN: 978-3-540-31662-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics