A company frequently decides on location and design for new facilities in a sequential way. However, for a fixed number of new facilities (in this study we restrict ourselves to the case of two new facilities), the company might improve its profit by taking its decisions for all the facilities simultaneously. In this paper a profit maximization problem is considered, where the market share capt...

We study Facility Location games, where a number of facilities are placed in a metric space based on locations reported by strategic agents. A mechanism maps the agents’ locations to a set of facilities. The agents seek to minimize their connection cost, namely the distance of their true location to the nearest facility, and may misreport their location. We are interested in mechanisms that are...

Facility Location Problems have always been studied with the assumption that the environment in the network is static and does not change over time. In practice, however, the environment is usually dynamic and we must consider the facility location in a global view. In this paper, we impose the following additional constraints on input facilities: the total number of facilities to be placed is ...

This study presents a capacitated multi-facility location-allocation problem with stochastic demands based on a well-known distribution function. In this discrete environment, besides the capacitated facilities, we can employee the capacitated sub-source of each facility for satisfying demands of customers. The objective function is to find the optimal locations of facilities among a finite num...

Two players sequentially locate a fixed number of facilities, competing to capture market share. Facilities face disruption risks, and each customer patronizes the nearest operational facility, regardless of who operates it. The problem therefore combines competitive location and location with disruptions. This combination has been absent from the literature. We model the problem as a Stackelbe...

This paper presents a flow capturing location problem which focuses on railway passenger flows. The flow capturing location problem (FCLP), originally proposed by Hodgson (1990), aims to locate a given number of facilities on a network to maximize the total flow that can obtain service at facilities along their pre-planned routes. For railway users, facilities located at the origin station and ...

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

Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...

Title of dissertation: ON THE ROUTING AND LOCATION OF MOBILE FACILITIES Russell David Halper Doctor of Philosophy, 2010 Dissertation directed by: Professor Subramanian Raghavan AMSC Program R.H. Smith School of Business Mobile facilities play important roles in many applications, including health care, public services, telecommunications, and humanitarian relief logistics. While mobile faciliti...

This research develops a clustering-based location-allocation method to the Capacitated Facility Location Problem (CFLP), which provides an approximate optimal solution to determine the location and coverage of a set of facilities to serve the demands of a large number of locations. The allocation is constrained by facility capacities – different facilities may have different capacities and the...