排序方式: 共有15条查询结果,搜索用时 15 毫秒
1.
传统的最大覆盖选址模型没有考虑对服务半径外的需求点的满足和服务时间的响应,而在舰船维修器材保障中,不论需求点到保障点的距离是否大于服务半径,都应对其进行保障服务,且在保障过程中要满足保障时间控制在不影响舰船正常维修任务时间内。针对此问题,运用广义最大覆盖选址模型和时间满意度函数,构建基于时间满意的广义最大覆盖选址模型,并运用一种混合算法———基于遗传模拟退火算法的BP算法对模型进行求解。最后,运用该算法对实例进行了分析计算,计算结果验证了该算法的有效性。 相似文献
2.
This article proposes new location models for emergency medical service stations. The models are generated by incorporating a survival function into existing covering models. A survival function is a monotonically decreasing function of the response time of an emergency medical service (EMS) vehicle to a patient that returns the probability of survival for the patient. The survival function allows for the calculation of tangible outcome measures—the expected number of survivors in case of cardiac arrests. The survival‐maximizing location models are better suited for EMS location than the covering models which do not adequately differentiate between consequences of different response times. We demonstrate empirically the superiority of the survival‐maximizing models using data from the Edmonton EMS system. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
3.
4.
5.
Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear‐time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial‐time, dynamic programming algorithm to find the optimal solution. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
6.
7.
针对假目标掩护下飞行器突防概率问题,在分析交战双方作战过程基础上,建立假目标掩护下飞行器突防效果模型,然后运用探索性分析方法和工具,结合一个作战示例,对影响突防效果人的训练因子、不同的打击波次、假目标数量等因素进行分析.结果表明:当假目标1~4倍真目标进行掩护时,其突防增益明显,其平均增益可达到10%~35%. 相似文献
8.
In this paper, we consider a situation in which a group of facilities must be constructed in order to serve a given set of customers, where the facilities might not be able to guarantee an absolute coverage to the different customers. We examine the problem of maximizing the total service reliability of the system subject to a budgetary constraint. We propose a new reformulation of this problem that facilitates the generation of tight lower and upper bounds. These bounding mechanisms are embedded within the framework of a branch‐and‐bound procedure. Computational results on problem instances ranging in size up to 100 facilities and 200 customers reveal the efficacy of the proposed exact and heuristic approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
9.
从节能降耗角度探讨了对风幕机进行改进的必要性 ,通过计算分析确定了风速为系统改进所要考虑的主要环境因素 ,研究了利用热电式风速传感器和变频器实现系统智能化改进的可行性。 相似文献
10.
关于部分K值逻辑中正则可离函数集的极大封闭集之最小覆盖判定的一些结果 总被引:3,自引:0,他引:3
根据部分多值逻辑完备性理论,证明了当m=2时,若正则可离关系G2=G2({1,2})∪G2之关系图仅是一个回路,则T(G2)不是P k的最小覆盖成员. 相似文献