Solving a large scale districting problem: A case report (Q1112735): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0305-0548(88)90048-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2021733698 / rank | |||
Normal rank | |||
Revision as of 21:05, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving a large scale districting problem: A case report |
scientific article |
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
