Privatization of municipal solid waste (MSW) collection can improve service quality and reduce cost. To reduce the risk of an incapable company serving an entire collection area and to establish a competitive market, a large collection area should be divided into two or more subregions, with each subregion served by a different company. The MSW subregion districting is generally done manually, ...

In a framework with two parties, deterministic voter preferences and geographical constraints, we propose a set of simple axioms and show that they jointly characterize the districting rule that maximizes the number of districts a party can win, given an electoral outcome (the " optimal gerrymandering rule "). As a corollary, we obtain that no districting rule can satisfy our axioms and treat p...

This paper provides a welfare economic analysis of the problem of districting. In the context of a simple micro-founded model intended to capture the salient features of U.S. politics, it studies how a social planner should allocate citizens of different ideologies across districts to maximize aggregate utility. In the model, districting determines the equilibrium seat-vote curve which is the r...

The paper deals with the problem of defining the territories for I68 sales agents of a German manufacturer of consumer goods. About 1400 postal areas constitute the basic geographical units. The problem is solved by means of a location-allocation approach involving a standard code of a primal network algorithm as well as a new heuristic for resolving split areas. Numerical results and the imple...

This paper considers the problem of redistricting or redrawing police command boundaries. We model this problem as a constrained graph-partitioning problem involving the partitioning of a police jurisdiction into command districts subject to constraints of contiguity, compactness, convexity and size. Since the districting a4ects urban emergency services, there also exist quality-of-service cons...

In this study, a simulated annealing approach is developed to find optimal police patrol district design using a discreteevent simulation to evaluate the performances of districting plans, such as average response time and workload variation among districts. Similar to the solution neighborhood definition in an existing simulated annealing approach, the new solution (districting plan) in each i...

The transporting sugarcane from cane fields to a mill factory is a potential cost in sugarcane logistics. The poorly operating vehicle (six-wheel truck) services and transportation lot size results in lost or excess of cane supplied. In this paper, we consider the integrated districting problem of whole cane field region and transportation lot size of each cane field. We formulate the combining...

A matheuristic approach that combines a reduced variable neighbourhood search (rVNS) algorithm and mathematical programming (MP) solver to solve novel model for the districting problem in public bicycle-sharing system is presented. The modelled as an integer problem. While rVNS aims find high-quality set of centres repositioning zones, MP computes optimal allocation network stations zones. We u...

Abstract Reasonable districting plays an important role in the patrolling process. In this paper, workload attributes are considered, and a mixed integer programming model is developed to solve street patrol problem (SPDP). The improved spectral clustering algorithm named based on road network (SCRn) simulated annealing (SA) combined. This results hybrid called SCRn-SA. SCRn-SA tested small exa...