规范外训教学 提高培训质量

根据多年外训教学实践的体会,探讨了外训教学当前存在的主要问题,提出了改进意见,并对外训教学的规范化问题提出了自己的看法。     

野战指控系统机动时间路线优化研究*

以战时指控系统的机动路线优化问题为研究对象,建立了野战指控系统机动时间路线模型,在此模型的基础上提出用遗传算法来解决时间路线优化问题.初步处理了作战过程机动路线的必经点问题.在此基础上总结提出了机动路线优化的算法,将此算法在机步师野战指控系统遂行作战进行了验证.此算法可用来解决当前指控系统机动时间路线优化的问题.最后提出需要进一步解决的问题.     

中国国防经济学研究需关注的十八个重大问题

研究问题、分析问题、解决问题都是以提出问题为前提的。文章从国防经济外部环境的变化和国防经济自身矛盾运行发展的视角,对当前国防经济领域需要研究的重大问题进行了归纳和梳理,提出了需要引起国防经济理论界特别关注的十八个重大问题。     

网络抗干扰技术探讨

本文从管理使用和提高无线抗干扰通信设备战斗力的角度,提出了网络抗干扰问题,阐述了探讨网络抗干扰的意义,目的及其含义,重点提出了跳频电台网需要研究和解决的问题。     

防火门生产应用中的突出问题与改进对策

防火门关键材料、安装、使用中存在的问题,会对防火门的使用功能、人员疏散等产生诸多不利影响。就防火门关键材料中填充材料的性能、木质板材的阻燃、五金和防火玻璃的使用不当等问题进行了综述,并提出了相应改进对策;对安装过程中的校验、规范、细节、辅料的使用等问题提出了具体改进措施;指出了用户在使用中存在的突出问题,并提出解决方案。     

探异求新教育与中学语文教学

<普通高中语文新课程标准>中提到,要让学生对未来世界始终怀有强烈的兴趣和激情,敢于探异求新,走进新的学习领域,尝试新的方法,追求思维的创新、表达的创新……对优秀作品能够常读常新,获得新的体验和发现.长时期以来,我们的教育培养了学生解答问题的能力,而忽视了培养学生提出问题的意识.其实很多时候,提出问题比解答问题更重要,而要学会提出问题,就必须具有强烈的探异求新的敏感性.     

我军现行财务软件改进方案的探讨

本文从我军财务软件系统及软件研发管理过程两个方面详细地分析了现行财务软件存在的主要问题,针对财务软件系统存在的问题提出了“休克疗法”和“半休克疗法”两种解决方案,并针对软件研发管理过程存在的问题提出了建立军队软件公司的设想。     

试探同级审计军区综合预算

文章首先提出了应如何理解对同级审计军区综合预算本质这一问题,然后根据工作实践提出了对同级审计军区综合预算应采取的基本程序,最后指出了在进行审计时应注意的问题。     

用EA求解非固定时间轨道转移和拦截问题

随着航天任务需求的多样化 ,对航天器拦截和轨道转移问题不但提出了最省燃料的要求 ,而且提出了最小时间的要求。文中用EA算法解决了这一组合优化问题 ,仿真结果证明了算法的有效性     

关于军品质量管理某些概念问题的探析

文章给出了军品质量问题的定义,提出了做好军品质量问题管理的措施建议.     

What you should know about location modeling

Facility location models have been applied to problems in the public and private sectors for years. In this article, the author first presents a taxonomy of location problems based on the underlying space in which the problem is embedded. The article illustrates problems from each part of the taxonomy with an emphasis on discrete location problems. Selected recent research in the area is also discussed. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Restricted planar location problems and applications

Facility location problems in the plane are among the most widely used tools of Mathematical Programming in modeling real-world problems. In many of these problems restrictions have to be considered which correspond to regions in which a placement of new locations is forbidden. We consider center and median problems where the forbidden set is a union of pairwise disjoint convex sets. As applications we discuss the assembly of printed circuit boards, obnoxious facility location and the location of emergency facilities. © 1995 John Wiley & Sons, Inc.     

An integer decomposition algorithm for solving a two‐stage facility location problem with second‐stage activation costs

We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Optimal location of public facilities

Location of both public and private facilities has become an important consideration in today's society. Progress in solution of location problems has been impeded by difficulty of the fixed charge problem and the lack of an efficient algorithm for large problems. In this paper a method is developed for solving large-scale public location problems. An implicit enumeration scheme with an imbedded transportation algorithm forms the basis of the solution technique.     

Facility location when demand is time dependent

In this article we investigate the problem of locating a facility among a given set of demand points when the weights associated with each demand point change in time in a known way. It is assumed that the location of the facility can be changed one or more times during the time horizon. We need to find the time “breaks” when the location of the facility is to be changed, and the location of the facility during each time segment between breaks. We investigate the minisum Weber problem and also minimax facility location. For the former we show how to calculate the objective function for given time breaks and optimally solve the rectilinear distance problem with one time break and linear change of weights over time. Location of multiple time breaks is also discussed. For minimax location problems we devise two algorithms that solve the problem optimally for any number of time breaks and any distance metric. These algorithms are also applicable to network location problems.     

Dominating sets for rectilinear center location problems with polyhedral barriers

In planar location problems with barriers one considers regions which are forbidden for the siting of new facilities as well as for trespassing. These problems are important since they model various actual applications. The resulting mathematical models have a nonconvex objective function and are therefore difficult to tackle using standard methods of location theory even in the case of simple barrier shapes and distance functions. For the case of center objectives with barrier distances obtained from the rectilinear or Manhattan metric, it is shown that the problem can be solved in polynomial time by identifying a dominating set. The resulting genuinely polynomial algorithm can be combined with bound computations which are derived from solving closely connected restricted location and network location problems. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 647–665, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10038     

An algorithm for the solution of a location problem with metric constraints

In many location problems, the solution is constrained to lie within a closed set. In this paper, optimal solutions to a special type of constrained location problem are characterized. In particular, the location problem with the solution constrained to be within a maximum distance of each demand point is considered, and an algorithm for its solution is developed and discussed.     

移动式C3I系统导航定位问题的建模和仿真

未来战争是高新技术的对抗,我们要立于不败,就必须积极主动,知己知彼,避免被动挨打。为此,发展移动式Ｃ３Ｉ系统势在必行。移动式Ｃ３Ｉ系统的一个关键问题就是系统的导航定位问题的处理。作者立足实际,为移动式Ｃ３Ｉ系统建立了系统的导航定位问题的模型。针对引起系统导航定位的各种误差原因予以分析,建立了误差模型并进行了仿真,最后给出仿真结果     

Production-location problems

The joint problems of determining the optimal plant location and optimal input mix and plant size are addressed. The interrelationship between input substitutability and plant location is stressed. Conditions under which the location problem can be separated from the determination of the optimal input mix are developed for a number of problem variations. The stability of the optimal location in the face of changes in problem parameters is also discussed. It is demonstrated that consideration of input substitutability often makes the resulting problem no more difficult to solve than problem formulations in which the inherent input substitutability is ignored.     

Facility location and capacity acquisition: An integrated approach

The facility location and capacity acquisition decisions are intertwined, especially within the international context where capacity acquisition costs are location dependent. A review of the relevant literature however, reveals that the facility location and the capacity acquisition problems have been dealt with separately. Thus, an integrated approach for simultaneous optimization of these strategic decisions is presented. Analytical properties of the arising model are investigated and an algorithm for solving the problem is devised. Encouraging computational results are reported. © 1995 John Wiley & Sons, Inc.