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)
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(More)
This paper studies the following problem in stock cutting: when it is required to cut out complicated designs from parent material, it is cumbersome to cut out the exact design or shape, especially if the cutting process involves optimization. In such cases, it is desired that, as a first step, the machine cut out a relatively simpler approximation of the(More)
In this paper we consider a location-optimization problem where the classical uncapacitated 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)
The problem of transportation in a disaster area can be seen broadly as having two aspects: (a) moving people and materials out of an area, and (b) moving people and materiel into the same area. The common thread here is the use of a limited set of surface and air transportation gateways into and out of the area. The distributed routing problem here is that(More)
This paper focuses on the well-known Diaz and O’Rourke [M. Diaz and J. O’Rourke, Algorithms for computing the center of area of a convex polygon, Visual Comput. 10 (1994), 432–442.] iterative search algorithm to find the Simpson Point of a market, described by a convex polygon. In their paper, they observed that their algorithm did not appear to converge(More)