Solving a large scale districting problem: A case report (Q1112735)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving a large scale districting problem: A case report |
scientific article; zbMATH DE number 4079188
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving a large scale districting problem: A case report |
scientific article; zbMATH DE number 4079188 |
Statements
Solving a large scale districting problem: A case report (English)
0 references
1988
0 references
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.
0 references
large scale districting
0 references
location-allocation approach
0 references
primal network algorithm
0 references
heuristic
0 references
