This paper investigates a multi-period rectilinear distance 1-center location problem considering a line-shaped barrier, in which the starting point of the barrier follows the uniform distribution function. In addition, the existing points are sensitive to demands and locations. The purpose of the presented model is to minimize the maximum barrier distance from the new facility to the existing ...

Recent facility location allocation problems are engaged with social, environmental and many other aspects, besides cost objectives.Obtaining a sustainable solution for such problems requires development of new mathematical modeling and optimization algorithms. In this paper, an uncapacitated dynamic facility location-network design problem with random budget constraints is considered. Social i...

We consider a competitive facility location problem with two players. Players alternate placing points, one at a time, into the playing arena, until each of them has placed n points. The arena is then subdivided according to the nearest-neighbor rule, and the player whose points control the larger area wins. We present a winning strategy for the second player, where the arena is a circle or a l...

This paper investigates how to optimize the facility location strategy such as to maximize the intercepted customer flow, while accounting for ‘‘flow-by’’ customers’ path choice behaviors and their travel cost limitation. A bi-level programming static model is constructed for this problem. An heuristic based on a greedy search is designed to solve it. Consequently, we proposed a chance constrai...

This paper proposes a new location problem of competitive facilities, e.g. shops. In the most studies of competitive facility location, the distance between the facilities and their customers is represented as the Euclid distance. The proposing location problem introduces the A-distance, proposed by Widmayer etc., for representing the situation that the directions which customers can move are g...

We consider a competitive facility location problem with two players. Players alternate placing points, one at a time, into the playing arena, until each of them has placed n points. The arena is then subdivided according to the nearest-neighbor rule, and the player whose points control the larger area wins. We present a winning strategy for the second player, where the arena is a circle or a l...

Network location models comprise one of the main categories of location models. These models have various applications in regional and urban planning as well as in transportation, distribution, and energy management. In a network location problem, nodes represent demand points and candidate locations to locate the facilities. If the links network is unchangeably determined, the problem will be ...