Table of Contents Author Guidelines Submit a Manuscript
Corrigendum

A corrigendum for this article has been published. To view the corrigendum, please click here.

Mathematical Problems in Engineering
Volume 2015, Article ID 828374, 14 pages
http://dx.doi.org/10.1155/2015/828374
Research Article

A CDT-Based Heuristic Zone Design Approach for Economic Census Investigators

1ADREM, Beijing Normal University, Beijing 100875, China
2LREIS, Institute of Geographic Science and Resources Research, Beijing 100101, China
3School of Software, Tsinghua University, Beijing 100084, China
4China Internet Network Information Center, Beijing 100101, China

Received 30 July 2015; Accepted 19 October 2015

Academic Editor: Xiaobo Qu

Copyright © 2015 Changixu Cheng et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. L. Muyldermans, D. Cattrysse, and D. Van Oudheusden, “District design for arc-routing applications,” Journal of the Operational Research Society, vol. 54, no. 11, pp. 1209–1221, 2003. View at Publisher · View at Google Scholar · View at Scopus
  2. M. Altman, “The computational complexity of automated redistricting: is automation the answer?” Rutgers Computer & Technology Law Journal, vol. 23, no. 1, pp. 81–142, 1997. View at Google Scholar
  3. P. K. Bergey, C. T. Ragsdale, and M. Hoskote, “A simulated annealing genetic algorithm for the electrical power districting problem,” Annals of Operations Research, vol. 121, no. 1, pp. 33–55, 2003. View at Publisher · View at Google Scholar · View at Scopus
  4. S. W. Hess, J. B. Weaver, H. J. Siegfeldt, J. N. Whelan, and P. A. Zitlau, “Nonpartisan political redistricting by computer,” Operations Research, vol. 13, no. 6, pp. 998–1006, 1965. View at Publisher · View at Google Scholar
  5. M. E. T. Horn, “Solution techniques for large regional partitioning problems,” Geographical Analysis, vol. 27, no. 3, pp. 230–248, 1995. View at Google Scholar · View at Scopus
  6. A. Mehrotra, E. L. Johnson, and G. L. Nemhauser, “An optimization based heuristic for political districting,” Management Science, vol. 44, no. 8, pp. 1100–1114, 1998. View at Publisher · View at Google Scholar · View at Scopus
  7. F. Ricca and B. Simeone, “Local search algorithms for political districting,” European Journal of Operational Research, vol. 189, no. 3, pp. 1409–1426, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  8. C. Easingwood, “A heuristic approach to selecting sales regions and territories,” Operational Research Quarterly, vol. 24, no. 4, pp. 527–534, 1973. View at Publisher · View at Google Scholar · View at Scopus
  9. L. M. Lodish, “Sales territory alignment to maximize profit,” Journal of Marketing Research, vol. 12, no. 1, pp. 30–36, 1975. View at Publisher · View at Google Scholar
  10. A. A. Zoltners and P. Sinha, “Integer programming models for sales resource allocation,” Management Science, vol. 26, no. 3, pp. 242–260, 1980. View at Publisher · View at Google Scholar · View at Scopus
  11. J. A. Ferland and G. Guenette, “Decision support system for the school districting problem,” Operations Research, vol. 38, no. 1, pp. 15–21, 1990. View at Publisher · View at Google Scholar · View at Scopus
  12. R. G. González-Ramírez, N. R. Smith, R. G. Askin, and V. Kalashinkov, “A heuristic approach for a logistics districting problem,” International Journal of Innovative Computing, Information and Control, vol. 6, no. 8, pp. 3551–3562, 2010. View at Google Scholar · View at Scopus
  13. C. F. Daganzo, “The distance traveled to visit N points with a maximum of C stops per vehicle: an analytic model and an application,” Transportation Science, vol. 18, no. 4, pp. 331–350, 1984. View at Publisher · View at Google Scholar · View at Scopus
  14. G. F. Newell and C. F. Daganzo, “Design of multiple-vehicle delivery tours—I a ring-radial network,” Transportation Research Part B, vol. 20, no. 5, pp. 345–363, 1986. View at Publisher · View at Google Scholar · View at Scopus
  15. A. Langevin and F. Soumis, “Design of multiple-vehicle delivery tours satisfying time constraints,” Transportation Research Part B, vol. 23, no. 2, pp. 123–138, 1989. View at Publisher · View at Google Scholar · View at Scopus
  16. T. J. Cova and R. L. Church, “Contiguity constraints for single-region site search problems,” Geographical Analysis, vol. 32, no. 4, pp. 306–329, 2000. View at Google Scholar · View at Scopus
  17. J. C. J. H. Aerts and G. B. M. Heuvelink, “Using simulated annealing for resource allocation,” International Journal of Geographical Information Science, vol. 16, no. 6, pp. 571–587, 2002. View at Publisher · View at Google Scholar · View at Scopus
  18. J. C. Williams, “A zero-one programming model for contiguous land acquisition,” Geographical Analysis, vol. 34, no. 4, pp. 330–349, 2002. View at Publisher · View at Google Scholar
  19. A. T. Murray and D. Q. Tong, “Coverage optimization in continuous space facility siting,” International Journal of Geographical Information Science, vol. 21, no. 7, pp. 757–776, 2007. View at Publisher · View at Google Scholar · View at Scopus
  20. L. Yuan, Z. Yu, W. Luo, L. Yi, and Y. Hu, “Pattern forced geophysical vector field segmentation based on Clifford FFT,” Computers & Geosciences, vol. 60, pp. 63–69, 2013. View at Publisher · View at Google Scholar · View at Scopus
  21. P. Moreno-Regidor, J. García López de Lacalle, and M.-Á. Manso-Callejo, “Zone design of specific sizes using adaptive additively weighted Voronoi diagrams,” International Journal of Geographical Information Science, vol. 26, no. 10, pp. 1811–1829, 2012. View at Publisher · View at Google Scholar · View at Scopus
  22. A. G. N. Novaes, J. E. Souza de Cursi, A. C. L. da Silva, and J. C. Souza, “Solving continuous location-districting problems with Voronoi diagrams,” Computers and Operations Research, vol. 36, no. 1, pp. 40–59, 2009. View at Publisher · View at Google Scholar · View at Scopus
  23. L. Svec, S. Burden, and A. Dilley, “Applying Voronoi diagrams to the redistricting problem,” The UMAP Journal, vol. 28, no. 3, pp. 313–329, 2007. View at Google Scholar
  24. T. Shirabe, “A model of contiguity for spatial unit allocation,” Geographical Analysis, vol. 37, no. 1, pp. 2–16, 2005. View at Publisher · View at Google Scholar · View at Scopus
  25. P. K. Bergey, C. T. Ragsdale, and M. Hoskote, “A decision support system for the electrical power districting problem,” Decision Support Systems, vol. 36, no. 1, pp. 1–17, 2003. View at Publisher · View at Google Scholar · View at Scopus
  26. J. Kalcsics, S. Nickel, and M. Schröder, “Towards a unified territorial design approach—applications, algorithms and GIS integration,” Top, vol. 13, no. 1, pp. 1–74, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  27. R. Z. Ríos-Mercado and E. Fernández, “A reactive GRASP for a commercial territory design problem with multiple balancing requirements,” Computers and Operations Research, vol. 36, no. 3, pp. 755–776, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  28. C.-I. Chou and S. P. Li, “Taming the gerrymander—statistical physics approach to political districting problem,” Physica A: Statistical Mechanics and Its Applications, vol. 369, no. 2, pp. 799–808, 2006. View at Publisher · View at Google Scholar · View at Scopus
  29. C.-I. Chou and S.-P. Li, “Spin systems and political districting problem,” Journal of Magnetism and Magnetic Materials, vol. 310, no. 2, pp. 2889–2891, 2007. View at Publisher · View at Google Scholar · View at Scopus
  30. M. S. Heschel, “Effective sales territory development,” Journal of Marketing, vol. 41, no. 2, pp. 39–43, 1977. View at Publisher · View at Google Scholar
  31. L. M. Lodish, “‘Vaguely right’ approach to sales force allocations,” Harvard Business Review, vol. 51, pp. 119–124, 1974. View at Google Scholar
  32. L. D. Bodin, “A districting experiment with a clustering algorithm,” Annals of the New York Academy of Sciences, vol. 219, pp. 209–214, 1973. View at Publisher · View at Google Scholar
  33. M. Blais, S. D. Lapierre, and G. Laporte, “Solving a home-care districting problem in an urban setting,” Journal of the Operational Research Society, vol. 54, no. 11, pp. 1141–1147, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  34. W. Macmillan, “Redistricting in a GIS environment: an optimisation algorithm using switching-points,” Journal of Geographical Systems, vol. 3, no. 2, pp. 167–180, 2001. View at Publisher · View at Google Scholar · View at Scopus
  35. S. J. D'Amico, S.-J. Wang, R. Batta, and C. M. Rump, “A simulated annealing approach to police district design,” Computers and Operations Research, vol. 29, no. 6, pp. 667–684, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus