Third party service providers are locating logistic hub for operating their tasks. Finding a proper location helps them to have better performance in competitive environment. Multiple characteristics of proper location selection faces the decision maker to have a multi criteria decision making problem. Since the location decision is a long term planning, the robustness of the decision is gettin...

We consider the following location problem. New 5G networks are deployed by two competitive operators (called resp. O1 and O2), which we refer to as a leader and a follower due to their sequential entering the market. They compete to serve clients by installing and configuring base stations (BS). We assume that the leader had already made a decision and operating a 5G network. Follower arrives ...

This paper proposes a new location problem of competitive facilities, e.g. shops and stores, with uncertain demands in the plane. By representing the demands for facilities as random variables, the location problem is formulated to a stochastic programming problem, and for finding its solution, three deterministic programming problems: expectation maximizing problem, probability maximizing prob...

A new heuristic algorithm for solution of bi-objective discrete competitive facility location problems is developed and experimentally investigated by solving different instances of a facility location problem for firm expansion. The proposed algorithm is based on ranking of candidate locations for the new facilities, where rank values are dynamically adjusted with respect to behaviour of the a...

A new direction of research in Competitive Location theory incorporates theories of Consumer Choice Behavior in its models. Following this direction, this paper studies the importance of consumer behavior with respect to distance or transportation costs in the optimality of locations obtained by traditional Competitive Location models. To do this, it considers different ways of defining a key p...

This paper presents a deterministic and efficient algorithm for online facility location. The algorithm is based on a simple hierarchical partitioning and is extremely simple to implement. It also applies to a variety of models, i.e., models where the facilities can be placed anywhere in the region, or only at customer sites, or only at fixed locations. The paper shows that the algorithm is O(l...

We consider the (r|Xp)−medianoid problem in networks. Goods are assumed to be essential and the only decision criterion is the travel distance. The portion of demand captured by the competitors is modelled by a general capture function which includes the binary, partially binary and proportional customer choice rules as specific cases. We prove that, under certain conditions of the capture func...

A single facility has to be located in competition with fixed existing facilities of similar type. Demand is supposed to be concentrated at a finite number of points, and consumers patronise the facility to which they are attracted most. Attraction is expressed by some function of the quality of the facility and its distance to demand. For existing facilities quality is fixed, while quality of ...

This paper proposes a new location problem of competitive facilities, e.g. shops and stores, with uncertainty and vagueness including demands for the facilities in a plain. By representing the demands for facilities as fuzzy random variables, the location problem can be formulated as a fuzzy random programming problem. For solving the fuzzy random programming problem, first the α-level sets for...

Minimization of arrival time at scenes plays an essential role to help injured people in emergency events. This can be undertaken through mathematical programming models, called emergency medical services location problem, and solved by conventional exact algorithms or by recent meta-heuristic methods as well. Meta-heuristic algorithms have recently been realized to be more efficient in the sen...