Location of an Obnoxious Route (Q3033533)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4131915
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Location of an Obnoxious Route |
scientific article; zbMATH DE number 4131915 |
Statements
Location of an Obnoxious Route (English)
0 references
1989
0 references
location of a route
0 references
shortest weighted distance
0 references
network minimal-cost problems
0 references
0.8598770499229431
0 references
0.82975834608078
0 references
0.8027901649475098
0 references
This paper is concerned with the location of a route through a set of existing facilities in order to maximize the shortest weighted distance from the given installations to the route. The route is constrained to be within a polygonal region. The weights quantify the level of annoyance in the set of given points. The authors present an efficient algorithm based upon network minimal- cost problems. The method is illustrated with an example involving twelve facilities. Then, a second algorithm is described for finding the location of a linear route through the convex hull of the given facilities. This method includes two search procedures which are illustrated with an example involving four points. The case where the weights are equal is also considered.
0 references