军事设施建设项目环境影响评价有关问题分析及建议

根据《中国人民解放军环境保护条例》,军事设施建设项目应进行环境影响评价。由于军事项目建设内容高度机密、国防需要迫切、建设时间紧迫等,再加上一些从事军事设施项目建设的管理人员对环境影响评价的理解还存在某些偏差,使许多军事设施建设项目未进行环境影响评价,影响了我军的环境保护工作。简要介绍了军事设施的范围及军事设施建设项目的环境影响评价概况,结合军事设施建设项目环境影响评价中出现的一些问题,提出了进行军事设施建设项目环境影响评价工作的几点建议。     

Heuristics for the location of inspection stations on a network

This article considers the preventive flow interception problem (FIP) on a network. Given a directed network with known origin‐destination path flows, each generating a certain amount of risk, the preventive FIP consists of optimally locating m facilities on the network in order to maximize the total risk reduction. A greedy search heuristic as well as several variants of an ascent search heuristic and of a tabu search heuristic are presented for the FIP. Computational results indicate that the best versions of the latter heuristics consistently produce optimal or near optimal solutions on test problems. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 287–303, 2000     

A note on scheduling parallel machines subject to breakdown and repair

In this paper we consider n jobs and a number of machines in parallel. The machines are identical and subject to breakdown and repair. The number may therefore vary over time and is at time t equal to m(t). Preemptions are allowed. We consider three objectives, namely, the total completion time, ∑ C_j, the makespan C_max, and the maximum lateness L_max. We study the conditions on m(t) under which various rules minimize the objective functions under consideration. We analyze cases when the jobs have deadlines to meet and when the jobs are subject to precedence constraints. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

联合作战目标协同模型构建与求解方法?

在对联合作战目标协同研究内容分析的基础上,提出了多任务部队与多作战目标的协同目标分配模型,其融合了目标综合价值、目标打击有效性、目标威胁适配度、目标类型匹配、目标距离匹配等因素。通过对各因素量化并将协同目标分配模型转换为指派问题进行求解,验证了分析方法的可行性。     

消防部队基层干部心理问题分析与对策研究

消防部队基层干部面临个体需求与现实满足存在较大差距时出现的心理问题,受个体与周围环境因素的影响。面对心理问题,在重视部队传统教育的基础上,大胆借鉴现代企业管理经验和理念,充分利用压力的正效应,结合物质鼓励和精神激励,合理疏导,妥善处理。     

Single machine sequencing with linear models of release dates

The paper deals with a problem of scheduling a set of jobs on a single machine. Before a job is released for processing, it must undergo some preprocessing treatment that consumes resources. It is assumed that the release date of a job is a linear decreasing continuous function of the amount of a locally and globally constrained, continuously divisible resource (e.g., energy, catalyzer, financial outlay, gas). The problem is to find a sequence of jobs and a resource allocation that will minimize the maximum job completion time. Such a problem appears, for example, in the ingot preheating and hot-rolling process in steel mills. It is shown that the problem is strongly NP-hard. Some polynomially solvable cases of the problem and approximate algorithms with both experimental and worst-case analysis are presented. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 99–113, 1998     

A branch‐and‐cut algorithm for the nonpreemptive swapping problem

In the Swapping Problem (SP), we are given a complete graph, a set of object types, and a vehicle of unit capacity. An initial state specifies the object type currently located at each vertex (at most one type per vertex). A final state describes where these object types must be repositioned. In general, there exist several identical objects for a given object type, yielding multiple possible destinations for each object. The SP consists of finding a shortest vehicle route starting and ending at an arbitrary vertex, in such a way that each object is repositioned in its final state. This article exhibits some structural properties of optimal solutions and proposes a branch‐and‐cut algorithm based on a 0‐1 formulation of the problem. Computational results on random instances containing up to 200 vertices and eight object types are reported. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

基于小波变换模极大值的自适应阈值图像去噪算法

依据白噪声小波变换性态与信号奇异性相比具有显著不同的特点,在大尺度下设置阈值,去掉噪声信号而保留图像细节信号引起的模极大值点。在阈值设置问题上,采用自适应阈值的方法,克服单一阈值不能在每级尺度上将信号与噪声作最大分离的缺点。实验表明,与单一阈值去噪方法相比,该方法不仅可以保留图像边缘信息,而且能提高去噪后图像的峰值信噪比2~5 dB。     

公安派出所消防监督工作面临的困难及对策

公安派出所应在辖区内进行消防监督检查是法定职能之一,也是加强社会消防安全监督检查,提高社会防御火灾事故能力,全面实现消防工作社会化的一条有效途径,它对弥补消防监督警力不足有着重要意义。分析目前派出所消防监督管理工作面临的问题,提出了改进和加强派出所消防监督管理工作的措施。     

Two exact algorithms for the vehicle routing problem on trees

This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time‐constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The other uses column generation. The first algorithm performs better on problems containing small customer demands and in which all vehicles are identical. Otherwise, the second algorithm is more powerful and more versatile. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 75–89, 1999