设施选址博弈问题的无支付机制设计研究

选址博弈是目前国际相关学术领域的重要前沿课题之一. 在选址博弈问题中, 存在n个相互影响的``理性"居民, 他们的住址等信息是其私有信息;设计者需要设计选址机制, 以居民汇报的住址信息为输入, 输出设施位置. 在进行机制设计的过程中, 如何在没有金钱的刺激下, 保证所有居民``说真话", 设计出防策略性无支付机制是其中的重要研究内容. 设施选址博弈问题的无支付机制设计是组合优化和理论计算机科学的交叉学科课题, 在管理科学、信息科学以及社会经济学等领域有着重要的应用, 具有重要的理论意义和实际的应用价值. 现根据不同设施类型及个数、不同个人偏好、不同度量空间以及不同社会总体目标等条件, 介绍各种类型的设施选址博弈模型, 罗列相关的研究成果, 并总结其中尚待解决的问题.     

基于敌意风险分析方法的多阶段反恐设备选址模型

恐怖袭击一直是人类安全的重要威胁之一。随着当前恐怖袭击在全球的频发,对反恐问题的研究更加急迫。针对反恐设施选址问题,考虑资源分配的多阶段性以及动态性,根据贝叶斯决策理论和序贯博弈思想,构建了多阶段反恐设施的敌意风险分析决策模型。讨论在城市多个设施点离散选址的不同情况下,通过预防性和修复性的资源分配将恐怖袭击的损失降低到最小。以上海市区县网络为例进行编程仿真测试,结果表明,模型可给出不同给定资源设定下的最优选址方案,是一种有效并切实可行的分析方法。     

离散设施选址问题研究综述

本文首先回顾了设施选址问题百年发展历史,认为其研究经历了零散研究、系统研究、不确定性研究三个阶段.离散选址问题包括中值问题、覆盖问题、中心问题、多产品问题、动态问题、多目标问题、路径选址问题、网络中心选址问题8个子问题.最后作者讨论了选址问题研究中存在的问题以及今后发展的趋势.     

双层级医疗设施选址问题及禁忌搜索算法

分级诊疗有利于充分利用已有的医疗资源,是医疗卫生体制改革的重要内容,因而在医疗设施选址时需要考虑医疗机构的层级性。本文以两个层级的医疗设施作为选址研究对象,建立了双层级多样流的混合整数规划模型。针对该模型的特点,设计了一种基于禁忌搜索的算法确定最优选址策略。最后,以上海市某区社区卫生服务中心以及区域医疗中心为研究对象,给出相应两个层级医疗设施的选址方案,并对相关参数对选址结果的影响进行了分析。算法求解结果为有就医需求的居民提供指派,使该区域的医疗资源利用率得到了提高,医疗设施配置也更加合理均衡。     

Integer linear programming models for grid-based light post location problem

Selecting optimal location is a key decision problem in business and engineering. This research focuses to develop mathematical models for a special type of location problems called grid-based location problems. It uses a real-world problem of placing lights in a park to minimize the amount of darkness and excess supply. The non-linear nature of the supply function (arising from the light physics) and heterogeneous demand distribution make this decision problem truly intractable to solve. We develop ILP models that are designed to provide the optimal solution for the light post problem: the total number of light posts, the location of each light post, and their capacities (i.e., brightness). Finally, the ILP models are implemented within a standard modeling language and solved with the CPLEX solver. Results show that the ILP models are quite efficient in solving moderately sized problems with a very small optimality gap.     

A 1-center problem on the plane with uniformly distributed demand points

Center problems or minimax facility location problems are among the most active research areas in location theory. In this paper, we find the best unique location for a facility in the plane such that the maximum expected weighted distance to all random demand points is minimized.     

Facility location and supply chain management – A review

Facility location decisions play a critical role in the strategic design of supply chain networks. In this paper, a literature review of facility location models in the context of supply chain management is given. We identify basic features that such models must capture to support decision-making involved in strategic supply chain planning. In particular, the integration of location decisions with other decisions relevant to the design of a supply chain network is discussed. Furthermore, aspects related to the structure of the supply chain network, including those specific to reverse logistics, are also addressed. Significant contributions to the current state-of-the-art are surveyed taking into account numerous factors. Supply chain performance measures and optimization techniques are also reviewed. Applications of facility location models to supply chain network design ranging across various industries are presented. Finally, a list of issues requiring further research are highlighted.     

Network hub location problems: The state of the art

Hubs are special facilities that serve as switching, transshipment and sorting points in many-to-many distribution systems. The hub location problem is concerned with locating hub facilities and allocating demand nodes to hubs in order to route the traffic between origin–destination pairs. In this paper we classify and survey network hub location models. We also include some recent trends on hub location and provide a synthesis of the literature.     

连续设施选址:模型、方法与应用

给定度量空间和该空间中的若干顾客,设施选址为在该度量空间中确定新设施的位置使得某种目标达到最优。连续设施选址是设施选址中的一类重要问题,其中的设施可在度量空间的某连续区域上进行选址。本文对连续设施选址的模型、算法和应用方面的工作进行了综述。文章首先讨论了连续设施选址中几个重要元素,包括新设施个数、距离度量函数、目标函数;然后介绍了连续选址中的几种经典模型和拓展模型;接着概述了求解连续选址问题的常用优化方法和技术,包括共轭对偶、全局优化、不确定优化、变分不等式方法、维诺图;最后介绍了连续设施选址的重要应用并给出了研究展望。     

全要素生产率如何影响我国制造业企业的区位选址决策

新经济地理理论以及新近发展的“‘新’新经济地理理论”认为,高生产率企业通过集聚效应和选择效应存在于规模较大的市场,本文在后者理论框架下考察中国企业区位选址这一被忽视的问题。运用中国1999~2007年297个地级及以上城市100多万家企业的微观数据,采用倾向得分匹配方法克服样本选择性偏误,本文发现:相比低生产率企业组,高生产率企业选址于更大规模的城市。而且,这种选址倾向在不同区域和企业所有制上具有差异表现:相比传统中、西部地区,东部地区高生产率企业选址于大城市的倾向更为明显;相比集体企业,港澳台、外商及私营企业的这种倾向性更为显著,且估计结果显示国有企业选址不受全要素生产率水平的影响。以上发现为我国制造业企业区位选址决策的制定提供了新的思路。     

Reliability problems in multiple path-shaped facility location on networks

In this paper we study a location problem on networks that combines three important issues: (1) it considers that facilities are extensive, (2) it handles simultaneously the location of more than one facility, and (3) it incorporates reliability aspects related to the fact that facilities may fail. The problem consists of locating two path-shaped facilities minimizing the expected service cost in the long run, assuming that paths may become unavailable and their failure probabilities are known in advance. We discuss several aspects of the computational complexity of problems of locating two or more reliable paths on graphs, showing that multifacility path location–with and without reliability issues–is a difficult problem even for 2 facilities and on very special classes of graphs. In view of this, we focus on trees and provide a polynomial time algorithm that solves the 2 unreliable path location problem on tree networks in $O\left(n^2\right)$ time, where $n$ is the number of vertices.     

Relaxed voting and competitive location under monotonous gain functions on trees

We examine competitive location problems where two competitors serve a good to users located in a network. Users decide for one of the competitors based on the distance induced by an underlying tree graph. The competitors place their server sequentially into the network. The goal of each competitor is to maximize his benefit which depends on the total user demand served. Typical competitive location problems include the (1,X₁)-medianoid, the (1,1)-centroid, and the Stackelberg location problem.An additional relaxation parameter introduces a robustness of the model against small changes in distance. We introduce monotonous gain functions as a general framework to describe the above competitive location problems as well as several problems from the area of voting location such as Simpson, Condorcet, security, and plurality.In this paper we provide a linear running time algorithm for determining an absolute solution in a tree where competitors are allowed to place on nodes or on inner points. Furthermore we discuss the application of our approach to the discrete case.     

On the convergence of a modified algorithm for the spherical facility location problem

We study the spherical facility location problem which is a more realistic model than the Euclidean facilities location. We present a modified algorithm for this problem, which has the following good properties: (a) It is very easy to initialize the algorithm with an arbitrary point as its starting point; (b) Under suitable assumptions, it is proved that the algorithm globally converges to a global minimizer of the problem.     

Reforming and Assessing Undergraduate Science Instruction Using Collaborative Action‐Based Research Teams

Faculty members at Purdue University in the departments of Earth and Atmospheric Sciences, Biological Sciences, and Chemistry conducted a reform effort for the undergraduate curriculum utilizing action‐based research teams. These action‐based research teams developed, implemented, and assessed constructivist approaches to teaching undergraduate science content in each department. This effort utilized a partnership of scientists, science educators, master teachers, graduate students, and undergraduate students. Results indicated that the project partners were able to (a) implement more inquiry‐based teaching that emphasized conceptual understanding, (b) provide opportunities for cooperative learning experiences, (c) use models as an ongoing theme, (d) link concepts and models to real‐world situations, e.g., field trips, (e) provide a more diverse range of assessment strategies, and (f) have students present their understandings in a variety of different forms. Further, we found that we were able to (a) involve graduate and undergraduate students, classroom teachers, scientists, and science educators together to work on the reform in a collaborative manner, (b) bring multiple perspectives for teaching and for science to support instruction and, (c) provide scientists and graduate science students (who will become university professors) with more effective teaching models. We also found that the collaborative action‐based research process was effective for contributing to the reform of undergraduate teaching.     

On an open problem in spherical facility location

In this paper we partially resolve an open problem in spherical facility location. The spherical facility location problem is a generalization of the planar Euclidean facility location problem. This problem was first studied by Katz and Cooper and by Drezner and Wesolowsky where a Weszfeld-like algorithm was proposed. This algorithm is very simple and does not require a line search. However, its convergence has been an open problem for more than ten years. In this paper, we prove that the sequence generated by the algorithm converges to the unique optimal solution under the condition that the oscillation of the sequence converges to zero. We conjecture that the algorithm is a descent algorithm and prove that the sequence generated by the algorithm converges to the optimal solution under this conjecture.     

基于离散与连续选址相结合的平面选址问题研究——以华北石油局大牛地气田污水处理厂选址为例

选址问题的研究中,大多考虑的是理论距离(例如欧式距离等);但在实际问题中,真实的公路运输距离和理论距离有较大差异,并且修建公路的成本较高.在尽量利用当前的公路交通网络同时,又能得到最优选址,在现实中具有重要意义.以华北石油局大牛地气田第一采气厂污水处理厂选址为例,分别采用重心法选址、最大值最小化选址、多目标选址等选址的方法得到污水处理厂的备选点,并结合实际距离模拟出了各个备选点的运输费用,再综合考虑当地政策和交通状况等因素,最终得到了使得运输费用最低的新的污水处理厂的位置坐标P(9.33,11.79),在该位置建立污水处理厂比之前的运输方案每年大约可节约511万元的运输费用.方法最大的优点是减小了在选址过程中理论距离与实际距离的误差,在现实中具有一定的指导意义.     

Asymptotic Behavior of Sample Mean Direction for Spheres

In this note we consider some asymptotic properties of empirical mean direction on spheres. We do not require any symmetry for the underlying density. Thus our results provide the framework for an asymptotic inference regarding mean direction under very weak model assumptions. Mean direction is a specialization of the more general concept of mean location applicable to arbitrary (compact) submanifolds of Euclidean space, to which the methods of this paper could be applied.     

A bibliography for some fundamental problem categories in discrete location science

Following a brief taxonomy of the broad field of facility location modeling, this paper provides an annotated bibliography of recent papers in two branches of discrete location theory and modeling. In particular, we review papers related to (1) the median and plant location models and (2) to center and covering models. We show how the contributions of the papers we review are embedded in the field. A summary and outlook conclude the paper.     

Characterizing Teachers' Verbal Scaffolds to Guide Elementary Students' Creation of Scientific Explanations

Scaffolding is a complicated construct that can take many forms, including both written and verbal forms. This research study focused on three elementary science classrooms where students were using a series of written scaffolds to guide explanation building. In each classroom, data were collected to document and study an additional type of scaffold, verbal scaffolds that the teachers provided to complement the written scaffolds. Findings suggested that some types of verbal scaffolds, such as navigational guidance, were universal and therefore cut across all three grade levels. On balance, other verbal scaffolds were more common with younger students in association with their first explanation‐building science unit, such as a verbal scaffold that turned an open‐ended question into a few multiple‐choice options. Through the characterization of the types and range of verbal scaffolds that teachers say, both in general and in response to audience, we can gain insights to inform both curricular design and professional development toward supported explanation building across target audience, time, and topic.     

Differential game models in management science

This paper reviews a number of differential games applications to management science and operations research problems, published—with a few exceptions—during the last decade. The purpose of the article is to provide the reader with an up-to-date account of the state-of-the-art within this field. After having stated in an introduction the general differential games framework as well as some conceptual problems, we proceed to review the models which have been divided into the following functional areas: Investment, consumption, and employment; Production, inventories, and maintenance; Marketing (Advertising, pricing and R&D); Bargaining; Natural resources and pollution. The survey concludes with some remarks on applicability, solvability, and directions for future research.