An alternating heuristic for medianoid and centroid problems in the plane

Authors:
J. Bhadury;H. A. Eiselt;J. H. Jaramillo
Affiliations:
Department of Management and Finance, California State University-Hayward, Hayward, CA;Faculty of Administration, University of New Brunswick, Fredericton, NB E3B 5A3, Canada;Tampa Airlines, Carrera 76 No. 34A, 61 Medellin, Colombia
Venue:
Computers and Operations Research
Year:
2003

Citing 2
Cited 5

Convergence analysis and algorithmic implications of two dynamic processes toward an oligopoly-competitive fringe equilibrium solution

Computers and Operations Research
Computational Geometry in C

Computational Geometry in C

Heuristics for the facility location and design (1|1)-centroid problem on the plane

Computational Optimization and Applications
A hybrid tabu search heuristic for a bilevel competitive facility location model

HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
A leader-follower game in competitive facility location

Computers and Operations Research
Heuristic and exact methods for the discrete (r|p)-centroid problem

EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Particle swarm optimization with two swarms for the discrete (r|p)-centroid problem

EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper develops two heuristics for solving the centroid problem on a plane with discrete demand points. The methods are based on the alternating step well known in location methods. Extensive computational testing with the heuristics reveals that they converge rapidly, giving good solutions to problems that are up to twice as large as those reported in the literature. The testing also provides some managerial insight into the problem and its solution.