Districting for Arc Routing

References

• Bergey PK, Ragsdale CT, Hoskote M (2003) A simulated annealing genetic algortihm for the electrical power districting problem. Ann. Oper. Res. 121:33–55.Crossref, Google Scholar
• Blais M, Lapierre SD, Laporte G (2003) Solving a home-care districting problem in an urban setting. J. Oper. Res. Soc. 54:1141–1147.Crossref, Google Scholar
• Bodin LD, Levy L (1988) Scheduling the postal carriers for the United States Postal Service: An application of arc partitioning and routing. Golden BL, Assad AA, eds. Vehicle Routing: Methods and Studies (North-Holland, Amsterdam), 359–394.Google Scholar
• Bodin LD, Levy L (1989) The arc oriented location routing problem. INFOR 27:74–94.Google Scholar
• Bodin LD, Levy L (1991) The arc partitioning problem. Eur. J. Oper. Res. 53:393–401.Crossref, Google Scholar
• Bozkaya B, Erkut E, Laporte G (2003) A tabu search heuristic and adaptive memory procedure for political districting. Eur. J. Oper. Res. 144:12–26.Crossref, Google Scholar
• Bozkaya B, Erkut E, Haight D, Laporte G (2011) Designing new electoral districts for the city of Edmonton. Interfaces 41:534–547.Link, Google Scholar
• Chapleau L, Ferland JA, Rousseau J-M (1985) Clustering for routing in densely populated areas. Eur. J. Oper. Res. 20:48–57.Crossref, Google Scholar
• D'Amico SJ, Wang SJ, Batta R, Rump CM (2002) A simulated annealing approach to police district design. Comput. Oper. Res. 29:667–684.Crossref, Google Scholar
• Drexl A, Haase K (1999) Fast approximation methods for sales force deployment. Management Sci. 45:1307–1323.Link, Google Scholar
• Ferland JA, Guénette G (1990) Decision support system for the school districting problem. Oper. Res. 38:15–21.Link, Google Scholar
• Fleischmann B, Paraschis JN (1988) Solving a large scale districting problem: A case report. Comput. Oper. Res. 15:521–533.Crossref, Google Scholar
• Forman SL, Yue Y (2003) Congressional districting using a TSP-based genetic algorithm. Cantú-Paz Eet al., eds. Proc. 2003 Internat. Conf. Genetic and Evolutionary Comput.: Part II, GECCO'03, 2072–2083.Crossref, Google Scholar
• George JA, Lamar BW, Wallace CA (1997) Political district determination using large-scale network optimization. Socio-Economic Planning Sci. 31:11–28.Crossref, Google Scholar
• Glover F (1977) Heuristic for integer programming using surrogate constraints. Decision Sci. 8:156–166.Crossref, Google Scholar
• Gross JL, Yellen J (2003) Handbook of Graph Theory (CRC Press, Boca Raton, FL).Crossref, Google Scholar
• Guan MK (1962) Graphic programming using odd or even points. Chinese Math. 1:273–277.Google Scholar
• Hanafi S, Fréville A, Vaca P (1999) Municipal solid waste collection: An effective data structure for solving the sectorization problem with local search methods. INFOR 37:236–254.Google Scholar
• Hess SW, Samuels SA (1971) Experiences with a sales districting model: Criteria and implementation. Management Sci. 18:P-41–P-54.Link, Google Scholar
• Hess SW, Weaver JB, Siegfeldt HJ, Whelan JN, Zitlau PA (1965) Nonpartisan political redistricting by computer. Oper. Res. 13:998–1008.Link, Google Scholar
• Horn DL, Hampton CR, Vandenberg AJ (1993) Practical application of district compactness. Political Geography 12:103–120.Crossref, Google Scholar
• Jarrah AI, Bard JF (2012) Large-scale pickup and delivery work area design. Comput. Oper. Res. 39:3102–3118.Crossref, Google Scholar
• Kalcsics J, Nickel S, Schröder M (2005) Towards a unified territorial design approach—Applications, algorithms and GIS integration. TOP 13:1–74.Crossref, Google Scholar
• Kolmogorov V (2009) Blossom V: A new implementation of a minimum cost perfect matching algorithm. Math. Programming Comput. 1:43–67.Crossref, Google Scholar
• Macmillan W, Pierce T (1992) Optimization modelling in a GIS framework: The problem of political districting. Specialist Meeting, National Center for Geographic Information and Analysis, Santa Barbara, CA.Google Scholar
• Mehrotra A, Johnson EL, Nemhauser GL (1998) An optimization based heuristic for political districting. Management Sci. 44:1100–1114.Link, Google Scholar
• Mourão MC, Nunes AC, Prins C (2009) Heuristic methods for the sectoring arc routing problem. Eur. J. Oper. Res. 196:856–868.Crossref, Google Scholar
• Muyldermans L, Cattrysse D, Van Oudheusden D (2003) District design for arc-routing applications. J. Oper. Res. Soc. 54:1209–1221.Crossref, Google Scholar
• Muyldermans L, Cattrysse D, Van Oudheusden D, Lotan T (2002) Districting for salt spreading operations. Eur. J. Oper. Res. 139:521–532.Crossref, Google Scholar
• Niemi RG, Grofman B, Carlucci C, Hofeller T (1990) Measuring compactness and the role of a compactness standard in a test for partisan and racial gerrymandering. J. Politics 52:1155–1181.Crossref, Google Scholar
• Paquette J, Cordeau J-F, Laporte G, Pascoal MMB (2013) Combining multicriteria analysis and tabu search for dial-a-ride problems. Transportation Res. Part B 52:1–16.Crossref, Google Scholar
• Perrier N, Langevin A, Campbell JF (2006a) A survey of models and algorithms for winter road maintainance. Part I: System design for spreading and plowing. Comput. Oper. Res. 33:209–238.Crossref, Google Scholar
• Perrier N, Langevin A, Campbell JF (2006b) A survey of models and algorithms for winter road maintainance. Part II: System design for snow disposal. Comput. Oper. Res. 33:239–262.Crossref, Google Scholar
• Ricca F, Scozzari A, Simeone B (2008) Weighted Voronoi region algorithms for political districting. Math. Comput. Model. 48:1468–1477.Crossref, Google Scholar
• Ríos-Mercado RZ, Fernández E (2009) A reactive GRASP for a commercial territory design problem with multiple balancing requirements. Comput. Oper. Res. 36:755–776.Crossref, Google Scholar
• Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40:455–472.Link, Google Scholar
• Salazar-Aguilar MA, Ríos-Mercado RZ, Cabrera-Ríos M (2011) New models for commercial territory design. Networks Spatial Econom. 11:487–507.Crossref, Google Scholar
• Schoepfle OB, Church RL (1991) A new network representation of a “classic” school districting problem. Socio-Econom. Planning Sci. 25:189–197.Crossref, Google Scholar
• Schröder M (2001) Gebiete optimal aufteilen. Ph.D. thesis, Universität Karlsruhe, Karlsruhe, Germany.Google Scholar
• Silva de Assis L, Morelato Franca P, Luiz Usberti F (2014) A redistricting problem applied to meter reading in power distribution networks. Comput. Oper. Res. 41:65–75.Crossref, Google Scholar
• Williams JC Jr (1995) Political redistricting: A review. Papers in Regional Sci. 74:13–40.Crossref, Google Scholar
• Young HP (1988) Measuring the compactness of legislative districts. Legislative Stud. Quart. 13:105–115.Crossref, Google Scholar