#### Filter Results:

#### Publication Year

1996

2013

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

This paper seeks to evaluate the performance of genetic algorithms (GA) as an alternative procedure for generating optimal or near-optimal solutions for location problems. The specific problems considered are the uncapacitated and capacitated fixed charge problems, the maximum covering problem, and competitive location models. We compare the performance of… (More)

(2003). An alternating heuristic for medianoid and centroid problems in the plane. 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… (More)

In this paper we consider a location-optimization problem where the classical unca-pacitated facility location model is recast in a stochastic environment with several risk factors that make demand at each customer site probabilistic and correlated with demands at the other customer sites. Our primary contribution is to introduce a new solution methodology… (More)

(2012). An optimization-based framework for modelling counter-terrorism strategies. Abstract: This article introduces the subject of terrorism and counter-terrorism by means of a two-person bimatrix game that provides some insight into the behaviour of the two players. We then examine three important areas in counter-terrorism tasks: the detection of… (More)

We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined. This problem is known to be NP-Complete for general graph. The problem remains NP-Complete even when the vertices of the network are required to lie on the boundary of a convex… (More)