Multi-level facility locationHierarchicalReviewSupply chainWe conduct a comprehensive review on multi-level facility location problems which extend several classical facility location problems and can be regarded as a subclass within the well-established field of hierarchical facility location. We first ...
Ageev, A.: Improved approximation algorithms for multilevel facility location problems. Oper. Res. Letters 30, 327-332 来自 EBSCO 喜欢 0 阅读量: 23 作者: AA Ageev 摘要: Currently, approximation algorithms seem to be the most successful approach for solving hard optimization problems Immediately ...
The objectives include minimizing deviations from demand coverage level requirements, allocated budget, and facility capacities. The gradual coverage performance, variable facility costs and facility capacities are considered as non-linear functions. The location problem is first modeled as a multi-objective...
An algorithm for the capacitated, multi-commodity multi-period facility location problem There are substantial number of exact and heuristic solution methods proposed for solving the facilities location problems. This paper develops an algorith... C Canel,BM Khumawala,J Law,... - 《Computers & Ope...
In order to deal with the problem of differentiated demand of disaster service in the process of crossregional emergencies,a multi-level reserve coverage decision model of emergency reserve facilities is established,that is,a demand point is provided by different emergency facilities. In the process ...
Laporte G (1988) Location-routing problems. In: Golden B, Assad A (eds) Vehicle routing: methods and studies. North-Holland, Amsterdam, pp 163–198 Google Scholar Lee J-H, Moon I-K, Park J-H (2010) Multi-level supply chain network design with routing. Int J Prod Res 48(13):3957...
Several approaches have been reported in the literature for solving the facility location problems [5–8]. Agrawal [9] present a hybrid Taguchi-immune approach to optimize an integrated supply chain design problemwith multiple shipping. Sun et al. [10] present a bilevel programming model for ...
Traditionally, preferences in facility location problems are assumed to be single-peaked, i.e. each agent’s location is her most preferred point on the line and furthermore the cost is assumed to be linear, i.e. it increases linearly (at the same rate) to the left and the right of ...
We study mechanism design for nonexcludable and excludable binary public project problems. Our aim is to maximize the expected number of consumers and the
HLPs are called p-hub location problems when the number of hub facilities is predefined. There are two basic assumptions underlying most HLPs. The first is that flows have to be routed via a set of hubs that includes at least one hub facility. The second assumption is that the graph of...