Most companies operate to maximize profits and increase their market shares in competitive environments. Since the proper location of facilities conditions profits, facility problem (CFLP) has been extensively applied literature. This generally falls within class NP-hard problems, which are difficult solve. Therefore, choosing a solution method optimize is key factor. Even though CFLPs have con...

In this article, a new genetic algorithm (GA), called the Nash equilibrium sorting (NESGA,) is introduced to identify equilibria for competitive maximal covering location problem with two and three competitors, which combinatorial game theory where it computationally intractable enumerate all decision options of competitors. Although GAs are widely used in optimization, their applications non-c...

— Location systems are core technologies for enabling pervasive computing smart spaces. Signal Strength based location estimation offers economical viability and suf cient accuracy for numerous location based services. Despite extensive research being carried out in this positioning method, tedious and lengthy development life cycle prohibits wide scale deployment of these systems. We present a...

We study the problem of leasing facilities over time, following the general infrastructure leasing problem framework introduced by Anthony and Gupta [1]. If there are K different lease types, Anthony and Gupta give an O(K)-approximation algorithm for the problem. We are able to improve this to a 3-approximation algorithm by using a variant of the primal-dual facility location algorithm of Jain ...

We study the incremental facility location problem, wherein we are given an instance of the uncapacitated facility location problem and seek an incremental sequence of opening facilities and an incremental sequence of serving customers along with their fixed assignments to facilities open in the partial sequence. We say that a sequence has a competitive ratio of k, if the cost of serving the fi...

We consider the problem where p searchers explore m > p half-lines, all joined at a common origin. The searchers travel at unit speed and the goal is to find a single object, or “exit” whose location is bounded away from the origin. We consider two minmax measures of effectiveness for a search strategy. The first is the worst case distancecompetitive ratio. This is the smallest value that excee...

We develop a new framework for location of competitive facilities by introducing non-constant expenditure functions into spatial interaction location models. This framework allows us to capture two key effects – market expansion and cannibalization – within the same model. We develop algorithmic approaches for finding optimal or near-optimal solutions for several models that arise from choosing...