Joy Bhadury

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)
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)
(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)
The design approximation problem is a well known problem in stock cutting, where, in order to facilitate the optimization techniques used in the cutting process, it is required to approximate complex designs by simpler ones. Although there are algorithms available to solve this problem, they all suffer from an undesirable feature that they only produce one(More)