دانلود رایگان مقاله لاتین شبکه تقاضای منطقه ای از سایت الزویر
عنوان فارسی مقاله:
مساله مکان پوشش حداکثر در شبکه هایی با تقاضای منطقه ای
عنوان انگلیسی مقاله:
Maximal Covering Location Problems on networks with regional demand
سال انتشار : 2016
برای دانلود رایگان مقاله شبکه تقاضای منطقه ای اینجا کلیک نمایید.
بخشی از مقاله انگلیسی:
3 A global optimization approach
A branch-and-bound algorithm is proposed to cope with this MINLP. As in any branch-and-bound procedure, the two key elements are the branching and the bounding strategies, which are discussed in Sections 3.1 and 3.2, respectively. Firstly, we define the splitting rules, which take advantage of the structure of the problem, by taking into account that the variables indicating the number of facilities per edge should be strongly correlated: if facilities are located at a given edge, it is unlikely that more facilities are located in neighboring edges, leaving big clusters of edges uncovered. Bounding strategies for such subdivision elements will then be built. Other important algorithmic issues of our proposal, such as the selection, elimination and termination rules, are outlined in Section 3.3. 3.1 Division rule One first and naive approach is to decide first how many facilities are located within each edge, and then, once these variables are fixed, one solves, by means of a standard branch-and-bound algorithm on networks, e.g. [6, 7], the nonlinear optimization problem of deciding where to locate them. However, full inspection of all p-tuples of edges will be doable only for very small networks. For this reason, our approach is to facilitate branching on the combinatorial and the continuous part at the same time. In order to avoid the enumeration of every possible combination of p edges, we propose to construct clusters of (sub)edges. Instead of associating with each edge an integer variable indicating the number of facilities to be located 8 in such edge, the integer variables will be associated with the clusters of (sub)edges, called hereafter edgesets, and the tuple of edgesets will be called superset.
برای دانلود رایگان مقاله شبکه تقاضای منطقه ای اینجا کلیک نمایید.
کلمات کلیدی:
Weber problems with mixed distances and regional demand ... link.springer.com/article/10.1007/s00186-007-0165-x We consider a location problem where the distribution of the existing ... by a combination of transportation cost in a network and continuous distance. ... Facility planning Weber problem Mixed distance Regional demand Stochastic optimization ... Weber problems with mixed distances and regional demand link.springer.com/content/pdf/10.1007/s00186-007-0165-x.pdf Jun 22, 2007 - In the area Ω, a transportation network is given with. 123 ..... A Weber problem with regional demand has the form min x∈X. ∫. Ω d(x, a) dµ(a). A minisum location problem with regional demand considering farthest ... dl.acm.org/citation.cfm?id=2938069 by D Dinler - 2016 - Related articles May 1, 2016 - A minisum location problem with regional demand considering farthest .... for time-evolving multi-item production–distribution networks. [PDF]Network Optimization mat.gsia.cmu.edu/classes/QUANT/NOTES/chap11.pdf Network models provide a language for talking about problems that is .... We assume that the total supply equals the total demand possibly .... consequence, the feasible region defined by the constraints would remain the same if we only kept. Serving regional demand in facility location - Yao - 2013 - Papers in ... onlinelibrary.wiley.com/doi/10.1111/pirs.12013/abstract by J Yao - 2014 - Cited by 3 - Related articles Apr 4, 2013 - Abstract. Location modelling is employed in urban and regional planning to site facilities that provide services of some sort. Issues to be ... Rafael Blanquero - Google Scholar Citations https://scholar.google.com/citations?user=FRcibEIAAAAJ Senior Lecturer in Statistics and Operations Research, University of Seville - us.es Continuous location problems and big triangle small triangle: constructing better ... Maximal covering location problems on networks with regional demand. Encyclopedia of Optimization - Page 4474 - Google Books Result https://books.google.com/books?isbn=0387747583 Christodoulos A. Floudas, Panos M. Pardalos - 2008 - Mathematics ... region model see: trust — region network see: large — region problem see: ... trust — region technique see: trust — regional demand [90B85] (see: Single ...
