Solving a large scale districting problem: A case report
type: Item
instance of: scholarly article
title: Solving a large scale districting problem: A case report
zbMATH Open document ID: 0659.90088
DOI: 10.1016/0305-0548(88)90048-2
author: Bernhard Fleischmann
author: Jannis N. Paraschis
published in: Computers \& Operations Research
publication date: 1988-01-01T00:00:00Z
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.
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90B05
zbMATH DE Number: 4079188
zbMATH Keywords: large scale districting
zbMATH Keywords: location-allocation approach
zbMATH Keywords: primal network algorithm
zbMATH Keywords: heuristic
MaRDI profile type: Publication
full work available at URL: 0305-0548(88)90048-2
OpenAlex ID: W2021733698
cites work: Optimal Political Districting by Implicit Enumeration Techniques
cites work: Turfing
cites work: Sales Territory Alignment: A Review and Model
cites work: Integer Programming Models for Sales Resource Allocation
cites work: The Transportation-Location Problem
cites work: Primal transportation and transshipment algorithms
description: scientific article; zbMATH DE number 4079188