The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems

In this paper we propose to modify the big square small square global optimization search in the plane with a big triangle small triangle approach. The triangulation of the feasible region is obtained by using Voronoi diagrams. The resulting algorithm was tested on the obnoxious facility location an...

Full description

Saved in:
Bibliographic Details
Published inOperations research Vol. 52; no. 1; pp. 128 - 135
Main Authors Drezner, Zvi, Suzuki, Atsuo
Format Journal Article
LanguageEnglish
Published Linthicum INFORMS 01.01.2004
Institute for Operations Research and the Management Sciences
Subjects
Algorithms
Analysis
Earthquakes
Facilities planning
Facilities/equipment planning: location, continuous
Generators
Geometric planes
Mathematical optimization
Nonlinear programming
Objective functions
Operations research
Optimal solutions
Optimization
Polygons
Programming: nonlinear, algorithms
Run time
Studies
Triangles
Triangulation
Vertices
Voronoi diagrams
United States
Online AccessGet full text
ISSN0030-364X
1526-5463
DOI10.1287/opre.1030.0077

Cover

More Information
Summary:In this paper we propose to modify the big square small square global optimization search in the plane with a big triangle small triangle approach. The triangulation of the feasible region is obtained by using Voronoi diagrams. The resulting algorithm was tested on the obnoxious facility location and the attraction-repulsion Weber problems with excellent results.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0030-364X
1526-5463
DOI:10.1287/opre.1030.0077