While the traditional facility location problem considers exogenous demand, in some applications, locations of facilities could affect willingness customers to use certain types services, e.g., carsharing, and therefore they also realizations random demand. Moreover, a decision maker may not know exact distribution such endogenous demand how it is affected by choices. In this paper, we consider...

different decisions, including location decisions of companies which are operating in international dynamic environment are subject to significant uncertainty.so in this research an international facility location problem under uncertainty is considered and an integrated model for strategic and operational planning is presented. in strategic level countries are assessed according to internation...

Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm. ...

Location theory is an interstice field of optimization and operations research‎. ‎In the classic location models‎, ‎the goal is finding the location of one or more facilities such that some criteria such as transportation cost‎, ‎the sum of distances passed by clients‎, ‎total service time, and cost of servicing are minimized‎. ‎The goal Weber location problem is a special case of location mode...

In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...

nowadays, due to inherent complexity of real optimization problems, it has always been a challenging issue to develop a solution algorithm to these problems. single row facility layout problem (srflp) is a np-hard problem of arranging a number of rectangular facilities with varying length on one side of a straight line with aim of minimizing the weighted sum of the distance between all facility...

In this thesis, we develop approximation algorithms for facility location problems based on local search techniques. Facility location is an important problem in operations research. Heuristic approaches have been used to solve many variants of the problem since the 1960s. The study of approximation algorithms for facility location problems started with the work of Hochbaum. Although local sear...

In the incremental versions of Facility Location and k-Median, the demand points arrive one at a time and the algorithm must maintain a good solution by either adding each new demand to an existing cluster or placing it in a new singleton cluster. The algorithm can also merge some of the existing clusters at any point in time. We present the first incremental algorithm for Facility Location whi...