نتایج جستجو برای: facility location spatial clustering

تعداد نتایج: 709800  

2009
Yi Deng Gabriel Picone

We develop and estimate a spatial game-theoretic model of entry and location choices to examine firms’ strategic clustering decisions. The model identifies two contradictory effects that determine firms’ geographical location choices: a competition effect and a clustering effect. We also separate firm’s strategic clustering incentives from the observed clustering behavior due to exogenous facto...

2012
Yi Deng Gabriel Picone

We develop and estimate a spatial game-theoretic model of entry and location choices to examine firms’ strategic clustering decisions. The model identifies two contradictory effects that determine firms’ geographical location choices: a competition effect and a clustering effect. We also separate firms’ strategic clustering incentives from the observed clustering behavior due to exogenous facto...

2016
Luohao Tang Cheng Zhu Zaili Lin Jianmai Shi Weiming Zhang

This paper studies a reliable facility location problem with facility protection that aims to hedge against random facility disruptions by both strategically protecting some facilities and using backup facilities for the demands. An Integer Programming model is proposed for this problem, in which the failure probabilities of facilities are site-specific. A solution approach combining Lagrangian...

2011

— We treat a discrete uncapacitated facility location problem where the installation cost per facility is a gênerai nonlinear function of the number of established facilities. Assuming a convexity proper ty, Mirchandani and Jagannathan developed a heur is tic solution procedure for this problem. Hère, we show how to modify their algorithm in order to get and prove exact solutions and, at the sa...

In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...

Journal: :Applied sciences 2021

The continuous-space single- and multi-facility location problem has attracted much attention in previous studies. This study focuses on determining the globally optimal facility locations for two- higher-dimensional problems when Manhattan distance is considered. Before we propose exact method, start with single-facility obtain global minimizer using a statistical approach. Then, an method dev...

Journal: :journal of optimization in industrial engineering 2012
ragheb rahmaniani abdosalam ghaderi mohammad saidi mehrabad

in this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. in this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. to tackle the problem efficiently and effectively, an effici...

2016
Naveen Kumar

The importance of spatial data mining is growing with the increasing incidence and importance of large spatial datasets repositories of remote-sensing images, location based mobile app data, satellite imagery, medical data and crime data with location information, three dimensional maps, traffic data and many more. However, as classical data mining techniques are often inadequate for spatial da...

2005
Sergio Cabello José Miguel Díaz-Báñez Stefan Langerman Carlos Seara Inmaculada Ventura

In the Nearest Neighbor problem (NN), the objects in the database that are nearer to a given query object than any other objects in the database have to be found. In the conceptually inverse problem, Reverse Nearest Neighbor problem (RNN), objects that have the query object as their nearest neighbor have to be found. Reverse Nearest Neighbors queries have emerged as an important class of querie...

2001
Adam Meyerson

We consider the online variant of facility location, in which demand points arrive one at a time and we must maintain a set of facilities to service these points. We provide a randomized onlineO(1)-competitive algorithm in the case where points arrive in random order. If points are ordered adversarially, we show that no algorithm can be constant-competitive, and provide an O(logn)-competitive a...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید