We consider a single-facility location problem, where agents are positioned on the real line and partitioned into multiple disjoint districts. The goal is to choose (where public facility be built) so as minimize total distance of from it. This process distributed: positions in each district first aggregated representative for district, then one representatives chosen location. indirect access ...

In this study, we propose an integrated approach that combines Bayesian Networks and Total Cost of Ownership (TCO) to address complexities involved in selecting an international facility for a manufacturing plant. Our goal is to efficiently represent uncertain data and ambiguous information, and to unite them to improve the quality of the decisions. Bayesian Networks provide a framework to elic...

In facility location games, one aims at designing a mechanism to decide the facility location based on the addresses reported by all agents. In the standard facility location game, each agent wants to minimize the distance from the facility, while in the obnoxious facility game, each agent prefers to be as far away from the facility as possible. In this paper we revisit the two games on a line ...

In this paper, dynamic facility location and supply chain planning are studied through minimizing the costs of facility location, path selection and transportation of coal under demand uncertainty. The proposed model dynamically incorporates possible changes in transportation network, facility investment costs, operating cost and changes in facility location. In addition, the time variation and...

Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity. Minimizing the total sum of distances between each demand point and its nearest facility point is the objective of the problem. Developing an effic...

We propose algorithms for a special type of geometric facility location problem in which customers may choose not to use the facility. We minimize the maximum cost incurred by a customer, where the cost itself is a minimum between two costs, according to whether the facility is used or not. We therefore call this type of location problem a min-max-min geometric facility location problem. As a f...