نتایج جستجو برای: facility location allocation
تعداد نتایج: 356715 فیلتر نتایج به سال:
The hub location problems (HLP) constitute an important class of facility location problems that have been addressed by numerous operations researchers in recent years. HLP is a strategic problem frequently encountered in designing logistics and transportation networks. Here, we address the competitive multiple allocation HLP in a duopoly market. It is assumed that an incumbent firm (the leader...
Distribution network design as a strategic decision has long-term effect on tactical and operational supply chain management. In this research, a supply chain design problem based on a two level capacity location allocation problem (TLCLAP) is presented. A product must be transported from a set of seaport to meet stores demands, passing out by intermediate warehouses. The objective is to locate...
In this paper we consider the inverse and reverse network facility location problems with considering the equity on servers. The inverse facility location with equality measure deals with modifying the weights of vertices with minimum cost, such that the difference between the maximum and minimum weights of clients allocated to the given facilities is minimized. On the other hand, the reverse c...
In this work, we consider a public facility allocation problem decided through a voting process under the majority rule. A location of the public facility is a majority rule winner if there is no other location in the network where more than half of the voters would have been closer to than the majority rule winner. We develop fast algorithms for interesting cases with nice combinatorial struct...
DISCLAIMER This document describes work undertaken as part of a programme of study at the Faculty of Geo-Information Science and Earth Observation of the University of Twente. All views and opinions expressed therein remain the sole responsibility of the author, and do not necessarily represent those of the Faculty. i ABSTRACT Location allocation is a combinatorial optimization problem. Traditi...
in this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. let $t=(v,e)$ be a tree. the $(k,l)$-core of $t$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. we show that, when the sum of the weights of vertices is negative, t...
Network location models comprise one of the main categories of location models. These models have various applications in regional and urban planning as well as in transportation, distribution, and energy management. In a network location problem, nodes represent demand points and candidate locations to locate the facilities. If the links network is unchangeably determined, the problem will be ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید