increasing of the distribution efficiency is one of the most objectives of an integrated logistic system developed as a new management philosophy in the past few decades. the problem is examind in two parts: facilities location problem (flp) for long policies and vehicle routing problem (vrp) to meet the customer demand. these two components can be solved separately; however, this solution may ...

We consider the competitive facility location problem in which two competing sides (the Leader and the Follower) open in succession their facilities, and each consumer chooses one of the open facilities basing on its own preferences. The problem amounts to choosing the Leader’s facility locations so that to obtain maximal profit taking into account the subsequent facility location by the Follow...

We study a mathematical model generalizing the well-known facility location problem. In this model we consider two competing sides successively placing their facilities and aiming to ‘‘capture’’ consumers, in order to make maximal profit. We state the problem as a bilevel integer programming problem, regarding optimal noncooperative solutions as optimal solutions. We propose a branch-andbound a...

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 ...

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...

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...

In this paper, there are two competitors in a planar market. The first competitor, called, the leader, opens p new facilities. After that, the second competitor, the follower, reacts to the leader’s action and opens r new facilities. The leader and the follower have got some facilities in advance in this market. The optimal locations for leader and follower are chosen among predefined candidate...

In this paper, we deal with competitive facility location problems in which the demand of each customer depends on the facilities. In our models two competitive companies intend to locate their facilities on the market in order to maximize the total demand acquired from the market. The distances between the facilities and the demand points are measured by rectangular distance. At first we consi...