The combined simulated annealing (CSA) algorithm was developed for the discrete facility location problem (DFLP) in the paper. The method is a two-layer algorithm, in which the external subalgorithm optimizes the decision of the facility location decision while the internal subalgorithm optimizes the decision of the allocation of customer's demand under the determined location decision. The per...

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 consider the inverse and reverse network facility location problems with considering the equity on servers. The inverse facility location with equality measure deals with modifying the weights of vertices with minimum cost, such that the difference between the maximum and minimum weights of clients allocated to the given facilities is minimized. On the other hand, the reverse c...

the dynamic facility layout problem (dflp) is the problem of finding positions of departments onthe plant floor for multiple periods (material flows between departments change during the planning horizon)such that departments do not overlap, and the sum of the material handling and rearrangement costs isminimized. in this paper a new optimization algorithm inspired from colonizing weeds, invasi...

in this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. let $t=(v,e)$ be a tree. the $(k,l)$-core of $t$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. we show that, when the sum of the weights of vertices is negative, t...

This paper proposes a continuum approximation model framework to solve a dynamic facility location problem for a large-scale growing market. The objective is to determine the optimal facility location and deployment time that minimize the costs for facility construction and customer service. To overcome computational challenge, a continuous approximation model is developed to find the optimal f...

We study problems that integrate buy-at-bulk network design into the classical (connected) facility location problem. In such problems, we need to open facilities, build a routing network, and route every client demand to an open facility. Furthermore, capacities of the edges can be purchased in discrete units from K different cable types with costs that satisfy economies of scale. We extend th...