共查询到20条相似文献,搜索用时 93 毫秒
1.
给定度量空间和该空间中的若干顾客,设施选址为在该度量空间中确定新设施的位置使得某种目标达到最优。连续设施选址是设施选址中的一类重要问题,其中的设施可在度量空间的某连续区域上进行选址。本文对连续设施选址的模型、算法和应用方面的工作进行了综述。文章首先讨论了连续设施选址中几个重要元素,包括新设施个数、距离度量函数、目标函数;然后介绍了连续选址中的几种经典模型和拓展模型;接着概述了求解连续选址问题的常用优化方法和技术,包括共轭对偶、全局优化、不确定优化、变分不等式方法、维诺图;最后介绍了连续设施选址的重要应用并给出了研究展望。 相似文献
2.
P.M Dearing 《Operations Research Letters》1985,4(3):95-98
Recent developments for several location problems are surveyed. These include: graph theoretic and combinatorial formulations of the simple plant location problem, the NP-hardness of some p-center problems, worst-case bounds for several polynomial-time heuristics for some p-center problems, and a general solution to a class of one facility network problems with convex cost functions. 相似文献
3.
We consider the problem of locating a line with respect to some existing facilities in 3-dimensional space, such that the sum of weighted distances between the line and the facilities is minimized. Measuring distance using the l
p
norm is discussed, along with the special cases of Euclidean and rectangular norms. Heuristic solution procedures for finding a local minimum are outlined. 相似文献
4.
In this paper we present a robust optimization (RO) model for the Connected Facility Location (ConFL) problem within the framework introduced by Bertsimas and Sim [Bertsimas, D. and M. Sim, Robust discrete optimization and network flows, Mathematical Programming 98 (2003), pp. 49–71], and show how to use a heuristic in conjunction with a lower bounding mechanism to rapidly find high-quality solutions. The use of a heuristic and a lower bound mechanism within this RO approach decreases significantly its computational time and broadens its applicability to other NP-hard problems. Here we present some of our computational results that attest to the efficiency of the approach, particularly on the Robust ConFL problem. 相似文献
5.
The attractiveness of retail facilities is an essential component of models analyzing competition among retail facilities. In this paper we introduce an innovative method for inferring retail facility attractiveness. Readily available data from secondary sources about customers' buying power and sales volumes obtained by competing retail facilities are used. The gravity-based competitive facility location model is used to predict sales. The attractiveness of the retail facilities are inferred from these data.The procedure is used to confirm the gravity competitive facility location model. Inferred attractiveness results based on empirical data from Orange County, California, were compared with an independent survey with excellent match. 相似文献
6.
A Probabilistic Minimax Location Problem on the Plane 总被引:1,自引:0,他引:1
Oded Berman Jiamin Wang Zvi Drezner George O. Wesolowsky 《Annals of Operations Research》2003,122(1-4):59-70
In this paper we consider the weighted minimax (1-center) location problem in the plane when the weights are not given but rather drawn from independent uniform distributions. The problem is formulated and analyzed. For certain parameters of the uniform distributions the objective function is proven to be convex and thus can be easily solved by standard software such as the Solver in Excel. Computational experience is reported. 相似文献
7.
为提高应急设施运行的可靠性和抵御中断风险的能力, 研究中断情境下的应急设施选址-分配决策问题。扩展传统无容量限制的固定费用选址模型, 从抵御设施中断的视角和提高服务质量的视角建立选址布局网络的双目标优化模型, 以应急设施的建立成本和抵御设施中断的加固成本最小为目标, 以最大化覆盖服务质量水平为目标, 在加固预算有限及最大最小容量限制约束下, 构建中断情境下应急设施的可靠性选址决策优化模型。针对所构建模型的特性利用非支配排序多目标遗传算法(NSGA-Ⅱ)求解该模型, 得到多目标的Pareto前沿解集。以不同的算例分析和验证模型和算法的可行性。在获得Pareto前沿的同时对不同中断概率进行灵敏度分析, 给出Pareto最优解集的分布及应急设施选址布局网络的拓扑结构。 相似文献
8.
Location Science Research: A Review 总被引:11,自引:0,他引:11
This document presents a broad review of facility location and location science research. The goal of this report is not to provide an exhaustive list of location science topics (an undertaking far beyond the scope of a single journal article), but rather to provide the reader with a more general review of the location science research landscape. This document starts with a short introduction to some of the more germane aspects of all location science research. 相似文献
9.
10.
In this paper we deal with two stationary loss queuing network location models. We analyze the influence of filtering policies
on the locational aspect of the problems. We assume that requests for service are placed at nodes of a transportation network
and they arrive in time as independent homogeneous Poisson processes with different input rates. The considered policies only
cover a given proportion of requests even if there are idle service units. This proportion is stationary and fixed in advance
and only depends on the node where the request is originated. The objective is to find the location of the facilities together
with the filtering policy to be applied that minimize the expected total cost per unit time with respect to a given cost structure.
Properties and computational results are presented enabling the resolution of these problems efficiently and showing the good
performance of filtering policies in terms of both the overall operating costs, and the demand that is served. 相似文献
11.
带覆盖需求约束的设施选址问题(FLPWCDL)研究:客户必须在规定的响应半径内被服务,并要求服务站能够覆盖规定的需求数量,如何选择合适的服务站,使总成本(建站成本+路线成本)最小.FLPWCDL广泛应用于应急服务、物流、便利店等服务站的选址.建立了问题的混合整数规划模型,并构造了求解FLPWCDL的Benders分解算法,计算实验显示Benders分解算法具有非常高的求解效率与求解质量. 相似文献
12.
13.
有容量限制的可靠性固定费用选址问题 总被引:3,自引:0,他引:3
设施网络可能面临各种失灵风险,而设施选址属于战略决策问题,短期内难以改变,因而在选址设计时需要充分考虑设施的非完全可靠性。本文针对无容量限制的可靠性固定费用选址问题进行扩展,进一步考虑设施的容量约束,基于非线性混合整数规划方法建立了一个有容量限制的可靠性固定费用选址问题优化模型。针对该模型的特点,应用线性化技术进行模型转化,并设计了一种拉格朗日松弛算法予以求解。通过多组算例分析,验证了算法的性能。算例分析结果表明设施失灵风险和设施容量对于选址决策有显著影响,因而在实际的选址决策过程中有必要充分考虑设施的失灵风险及容量约束。 相似文献
14.
油田工作中,合理的仓库选址决策不仅能节约物流成本,而且能提高油田作业效率。现有研究通常基于当前的油井位置(简称井位),没有考虑未来井位变化对仓库选址的影响。同时井位受到地下储层条件及油气公司远景规划等因素影响,未来的井位具有很强的不确定性。此外,仓库选址决策属中长期决策,将长期影响油田的物流费用、管理工作甚至开发工作,而且油田生产要求仓库能持续供应物资,所以油田仓库选址应考虑井位的不确定性和仓库服务中断等因素。本文首先根据油田井位分布和钻井规划采用随机模拟方法模拟未来井位,建立并求解考虑设施中断的离散选址模型。然后以鄂南油区物资仓库选址问题为例,模拟井位并求解仓库选址问题,从8个候选点中选出3个建库/租库。最后,分析井位和需求量变化对仓库选址结果的影响。井位不确定环境下油田物资仓库选址问题的研究,不仅对油田物流系统管理的研究具有一定的理论意义,也对油田的物流决策有重要的现实意义。 相似文献
15.
重大突发事件应急设施多重覆盖选址模型及算法 总被引:12,自引:1,他引:12
为了解决应对重大突发事件过程中应急需求的多点同时需求和多次需求问题,本文研究了应对重大突发事件的应急服务设施布局中的覆盖问题:针对重大突发事件应急响应的特点,引入最大临界距离和最小临界距离的概念,在阶梯型覆盖质量水平的基础上,建立了多重数量和质量覆盖模型。模型的优化目标是满足需求点的多次覆盖需求和多需求点同时需求的要求条件下,覆盖的人口期望最大,并用改进的遗传算法进行求解;最后给出的算例证明了模型和算法的有效性,从而应急设施的多重覆盖选址模型能够为有效应对重大突发事件的应急设施选址决策提供参考依据。 相似文献
16.
This paper is focused on the problem of locating preventive health care facilities. The aim is to maximize participation to prevention programs. We assume that distance is a major determinant of participation and people would go to the closest facility for preventive health care. Each facility is required to have more than a predetermined number of clients because of the direct relationship between volume and quality of preventive services. We provide a mathematical formulation and present alternative solution approaches for this new location problem. We report on computational performance of the proposed methods in locating public health centers in Fulton County, Georgia and mammography screening centers in Montreal, Quebec. 相似文献
17.
本文研究带惩罚的动态设施选址问题,在该问题中假设不同时段内设施的开放费用、用户的需求及连接费用可以不相同,而且允许用户的需求不被满足,但是要有惩罚.对此问题我们给出了第-个近似比为1.8526的原始对偶(组合)算法. 相似文献
18.
Bi-Objective Median Subtree Location Problems 总被引:1,自引:0,他引:1
A number of network design problems can be built on the following premise: given an undirected tree network, T, with node set, V, identify a single subtree, t, containing nodes, v, so that the subtree is located optimally with respect to the remaining, subset of unconnected nodes {V–v}. Distances between unconnected nodes and nodes in the subtree t can be defined on paths that are restricted to lie in the larger tree T (the restricted case), or can be defined on paths in an auxiliary complete graph G (the unrestricted case). The unrestricted case represents a class of problems that is not explicitly recognized in the literature, which is of intermediate complexity relative to the widely studied restricted case, and the general problem in which the underlying graph is general. This paper presents the Median Subtree Location Problem (MSLP), formulated as a bicriterion problem that trades off the cost of a subtree, t, against the population-weighted travel distance from the unconnected nodes to nodes on the subtree where both objectives are to be minimized. Integer programs were formulated for the travel restricted and travel unrestricted cases and were tested using linear programming and branch and bound to resolve fractions. Tradeoff curves between cost and travel burden were developed for sample networks. 相似文献
19.
20.
需求不确定下应急医疗服务站鲁棒配置模型与算法 总被引:2,自引:0,他引:2
大型突发事件发生后需要快速启动应急救灾网络,合理配置应急医疗服务站。本文考虑各应急医疗服务站选址节点需求的不确定性,引入三个不确定水平参数,构建四类不确定需求集合(box, ellipsoid, polyhedron和interval-polyhedron)对应的应急医疗服务站鲁棒配置模型,运用分支-切割算法求解,最后,进行需求扰动比例的灵敏度分析。算例结果表明,四类不确定需求集下的鲁棒配置模型中,ellipsoid不确定需求集合配置模型开放设施较少,总成本最小,鲁棒性较好。决策者还可以根据风险偏好选择不确定水平和需求扰动比例的组合,以使得总成本最小。 相似文献