Solving a large scale districting problem: A case report

DOI10.1016/0305-0548(88)90048-2MaRDI QIDQ1112735zbMATH OpenOpenAlexFDO

Authors Bernhard Fleischmann, Jannis N. Paraschis

Publication date 1988

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0305-0548(88)90048-2

zbMATH Keywords

heuristiclarge scale districtinglocation-allocation approachprimal network algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Review text

The paper deals with the problem of defining the territories for 168 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 primal network algorithm as well as a new heuristic for resolving split areas. Numerical results and the implementation of the procedure as a planning tool are presented.

Recommendations

• Dynamic design of sales territories
• Optimal political districting
• Optimal districting and territory design
• Districting for salt spreading operations
• Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)

Cites work

• Integer Programming Models for Sales Resource Allocation
• Optimal Political Districting by Implicit Enumeration Techniques
• Primal transportation and transshipment algorithms
• Sales Territory Alignment: A Review and Model
• The Transportation-Location Problem
• Turfing

Cited in

(28)

• Optimal political districting
• Districting for salt spreading operations
• A tabu search heuristic and adaptive memory procedure for political districting
• Multi-period service territory design
• A multi-objective districting problem applied to agricultural machinery maintenance service network
• A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization
• An overview of graph covering and partitioning
• A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution
• A dual bounding scheme for a territory design problem
• Multiple criteria districting problemsthe public transportation network pricing system of the Paris region
• Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder)
• A candidate set construction method in distribution center location based on a multi-scale gridding model
• Districting for arc routing
• A redistricting problem applied to meter reading in power distribution networks
• Dynamic design of sales territories
• The coastal seaspace patrol sector design and allocation problem
• New models for commercial territory design
• School redistricting: embedding GIS tools with integer programming
• Solving a home-care districting problem in an urban setting
• The Capacitated and Economic Districting Problem
• To the solution of ``territory cutting problem
• A simulated annealing approach to police district design
• A sample approximation solution procedure for chance-constrained districting problems
• scientific article; zbMATH DE number 7683726 (Why is no real title available?)
• Vertex covering with capacitated trees
• Towards a stochastic programming modeling framework for districting
• Designing delivery districts for the vehicle routing problem with stochastic demands
• A reactive GRASP for a commercial territory design problem with multiple balancing requirements

This page was built for publication: Solving a large scale districting problem: A case report

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1112735)