Bicriteria single facility rectilinear location problems in the presence of a single forbidden region (Q2265940)
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 3892905
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bicriteria single facility rectilinear location problems in the presence of a single forbidden region |
scientific article; zbMATH DE number 3892905 |
Statements
Bicriteria single facility rectilinear location problems in the presence of a single forbidden region (English)
0 references
1985
0 references
This paper presents a solution procedure based on \textit{R. Hooke} and \textit{T. A. Jeeves} [J. Assoc. Comput. Mach. 8, 212-229 (1961; Zbl 0111.125)] direct search technique for a single source rectilinear location problem in the presence of one forbidden barrier of rectangular or circular configuration. No path is allowed through the barrier nor is a location permitted within it. A bicriteria objective function giving simultaneous consideration to minisum as well as minimax criteria is used. Computational experience is presented.
0 references
solution procedure
0 references
direct search
0 references
single source rectilinear location
0 references
forbidden barrier
0 references
bicriteria objective function
0 references
minisum
0 references
minimax
0 references
Computational experience
0 references
0.8158528804779053
0 references
0.814414918422699
0 references
0.8080446124076843
0 references
0.807544469833374
0 references
