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

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

Optimal Positioning of a Mobile Service Unit on a Line

In this paper we address the problem of locating a mobile response unit when demand is distributed according to a random variable on a line. Properties are proven which reduce the problem to locating a non-mobile facility, transforming the original optimization problem into an one-dimensional convex program.In the special case of a discrete demand (a simple probability measure), an algorithm which runs in expected linear time is proposed.     

泄洪设施修建计划的数学模型

某乡政府计划解决防汛水利设施建设问题,即通过开挖小型排洪沟与修建新的泄洪河道来满足防汛需要.针对该乡的泄洪设施修建计划,主要研究以下三个问题:(1)给出同时开挖给定的8条小型排洪沟和新建一条给定的泄洪河道的最优修建方案;(2)已知该乡各村之间新建泄洪河道的长度,给出一个在各村之间互通的另一新泄洪河道的网络修建计划,使之达到可泄洪量100万立方米/小时;(3)当新泄洪河道网络修建完后,安排人员进行维护工作,研究维护人员在各村留宿的概率分布.在费用最省的目标下,建立了问题(1)和问题(2)的数学规划模型,并得到泄洪设施的最优修建方案.应用Markov链及转移概率矩阵等知识,建立了问题(3)的等概率和非等概率的两种数学模型,并得知维护人员在各村留宿的概率分布是稳定的.     

目的地充电站电动汽车充电设施优化配置

为了研究城市商业区目的地充电站的设施优化问题,本文在充分考虑快、慢充电设施充电时间的差异性和顾客在目的地接受充电时间异质性的基础上,构建了针对两类服务设施的排队论模型,同时以将同类型服务设施并联视为一台大型服务设施为出发点,这一出发点的可行性通过对M/M/1和M/M/n模型的相关指标值比对进行了验证;然后,在窗口能力不等的多服务窗排队系统中纳入已并联的快充与慢充充电设施,在获得模型基本参数基础上,再运算得到稳态方程及相关指标值,在此基础上构建了使用方与建设方综合服务费用最小的目标函数。本文末对所提出方法可行性与优越性由算例与对比分析进行了证实。     

A language-driven generalized numerical database translator

Numerical databases arise in many scientific applications to keep track of large dense and sparse matrices, residing on secondary devices in matrix compact data representation. This paper describes a language-driven generalized data translator for translating any numerical database from one matrix compact data representation to another. Our approach is to describe any matrix compact data representation by a physical schema and any numerical database and its mapping to storage by data language facilities. The languages are processed by a Generalized Syntax-Directed Translation Scheme (GSDTS) to automatically generate FORTRAN conversion programs which become the major modules of the translator.     

On characterizing supremum andl p -efficient facility designs

Define a design to be any planar setD of known areaa, but of unknown shape and location; more generally, a design can be any set inR ^d of measurea. For example, a design might be one floor of a warehouse, or a sports arena of known seating capacity. Suppose that the design has, say,m users, or evaluators, with user/evaluatori having a design disutility functionu _i , 1im, which can be defined for all points in the plane independently of the designs of interest. Given any designD, denote byG _i (D) the disutility ofD to user/evaluatori where, by definition,G _i (D) is the supremum ofu _i over the setD, 1im. LetG(D) be the vector with entriesG _i (D), 1im, and define a design to be efficient if it solves the vector minimization problem obtained using the set of vectors {G(D):D a design}. Given mild assumptions about the disutility functions, and a slight refinement of the design definition to rule out certain pathologies, we present necessary and sufficient conditions for a design to be efficient, and study properties of efficient designs. In the final section, we extend the analysis to more generall _p -measures of design disutility.This research was supported in part by the Interuniversity College for PhD studies in Management Sciences, Brussels, Belgium; by the Army Research Office, Triangle Park, North Carolina; by a National Academy of Sciences-National Research Council Postdoctorate Associateship; and by the Operations Research Division, National Bureau of Standards, Washington, DC. The authors would like to thank Dr. A. J. Goldman for his many constructive suggestions, and Dr. A. Veinott for suggesting the problems considered in Section 3.     

Optimal patient and personnel scheduling policies for care-at-home service facilities

In this paper we study the problem of personnel planning in care-at-home facilities. We model the system as a Markov decision process, which leads to a high-dimensional control problem. We study monotonicity properties of the system and derive structural results for the optimal policy. Based on these insights, we propose a trunk reservation heuristic to control the system. We provide numerical evidence that the heuristic yields close to optimal performance, and scales well for large problem instances.     

Reliable design of a logistics network under uncertainty: A fuzzy possibilistic-queuing model

This paper proposes a bi-objective model for designing a reliable network of bi-directional facilities in logistics network under uncertainties. For this purpose, the model utilizes an effective reliability approach to find a robust logistics network design. The objectives of the model are to minimize the total costs and the expected transportation costs after failures of bi-directional facilities of the logistics network. To solve the model, a new solution approach is proposed by combining queuing theory, fuzzy possibilistic programming and fuzzy multi-objective programming. Finally, the computational experiments are provided to illustrate the effectiveness of the proposed model and solution approach.     

半讨厌型设施选址问题的模型与算法

研究了结合网络和平面模型的半讨厌型设施的选址问题.半讨厌型设施结合了讨厌型设施与喜爱型设施的性质,一方面由于这些设施对人们带来很多副作用,人们想要远离他们以避免遭到污染,但同时人们又希望距离设施不要过远,因此建立0-1整数模型,在保证所有人使用该设施的距离不超过既定距离的基础上,使污染范围最小.由于该问题是NP困难问题,本为给出了启发式算法,通过算例进行了比较分析,证明了算法的有效性.