Solving generalized transportation problems via pure transportation problems

This paper investigates certain issues of coefficient sensitivity in generalized network problems when such problems have small gains or losses. In these instances, it might be computationally advantageous to temporarily ignore these gains or losses and solve the resultant “pure” network problem. Subsequently, the optimal solution to the pure problem could be used to derive the optimal solution to the original generalized network problem. In this paper we focus on generalized transportation problems and consider the following question: Given an optimal solution to the pure transportation problem, under what conditions will the optimal solution to the original generalized transportation problem have the same basic variables? We study special cases of the generalized transportation problem in terms of convexity with respect to a basis. For the special case when all gains or losses are identical, we show that convexity holds. We use this result to determine conditions on the magnitude of the gains or losses such that the optimal solutions to both the generalized transportation problem and the associated pure transportation problem have the same basic variables. For more general cases, we establish sufficient conditions for convexity and feasibility. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 666–685, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10034     

A strategic model for state compliance verification

The theory of directed graphs and noncooperative games is applied to the problem of verification of State compliance to international treaties on arms control, disarmament and nonproliferation of weapons of mass destruction. Hypothetical treaty violations are formulated in terms of illegal acquisition paths for the accumulation of clandestine weapons, weapons‐grade materials or some other military capability. The paths constitute the illegal strategies of a sovereign State in a two‐person inspection game played against a multi‐ or international Inspectorate charged with compliance verification. The effectiveness of existing or postulated verification measures is quantified in terms of the Inspectorate's expected utility at Nash equilibrium. A prototype software implementation of the methodology and a case study are presented. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 260–271, 2016     

蚁群算法及其在火力分配问题中的应用

火力分配问题是指用一定数量的武器对一定数量的目标进行打击,如何根据武器性能和目标特性等一系列的因素,制定打击计划,使打击效果最好,满足打击需求,是我二炮部队火力运用专业的研究课题之一.火力分配问题是NP难题,经典的求解算法存在指数级的时间复杂度.采用蚁群优化算法,对该问题进行了研究.     

基于支持向量机的战套器材组配决策研究

通过交叉验证找出影响战套组配的3个重要参数的取值,并构建飞机的战套器材组配决策模型,最后利用libsvm工具包对某型军用飞机的战套组配的可行性进行了分析。结果表明：基于支持向量机的战套器材组配决策是可行的。     

转型期再分配中存在的问题及其治理对策

转型期再分配中存在的问题既有认识上的 ,也有操作上的 ,既包括理论研究层面 ,也涵盖政策设计领域。具体问题包括对再分配原因的认识、目标的选择、问题的认定、地位的判断、功能的界定与作用的发挥、主体的确定与手段的运用等。要治理这些问题 ,就必须强化原因认识、规范目标选择、准确认定问题、科学判断地位、合理界定功能、有效发挥作用、完善主体、健全手段     

关于教师继续教育培训模式的思考

继续教育作为终身教育的重要组成部分和基本形式,对教师的发展成长意义重大。继续教育工作开展十多年来,取得了一定的成绩,但还存在不少问题,如学习动机较为被动,管理认识不到位,教学内容陈旧空泛,教学方法呆板机械等。随着课程改革的不断深入,继续教育必须采取相应的改进措施,树立以人为本,服务至上的观点,教学内容的前瞻性与实用性并重,教学人员进行整合,教学方法灵活多样,评价考核规范科学等,以此激活受训教师内在的学习动机,更大程度地提高继续教育培训的实际效果。     

一类带容量限制的运输问题

考虑一类带容量限制的运输问题.采用构造辅助网络的方法,将运输网络中的每个配送中心均拆分成两个节点,构造出新弧,形成新的网络,把此类运输问题转换为最小费用流问题来解决.并在此基础上,考虑运输网络中配送中心的容量扩张问题.     

Reformulating linear programs with transportation constraints—With applications to workforce scheduling

We study linear programming models that contain transportation constraints in their formulation. Typically, these models have a multistage nature and the transportation constraints together with the associated flow variables are used to achieve consistency between consecutive stages. We describe how to reformulate these models by projecting out the flow variables. The reformulation can be more desirable since it has fewer variables and can be solved faster. We apply these ideas to reformulate two well‐known workforce staffing and scheduling problems: the shift scheduling problem and the tour scheduling problem. We also present computational results. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

数学解题教学中寻求隐含条件的规律探索

中学数学教学中,解数学难题的过程就是从题设中不断地挖掘并利用隐含条件进行推理和变形的过程。数学题中的隐含条件形形色色,花样繁多,但从对解题过程的影响看,又可以分为制约解题方向的隐含条件、制约解题思路的隐含条件、制约解题准确性的隐含条件等三类隐含条件。只要我们把握了难题中隐含条件的规律特征,运用我们获得的数学知识,结合适当的数学思想和数学方法,就可以轻松解决难题了。     

UCAV空面多目标攻击三维轨迹规划技术

研究了单架无人作战飞机(UCAV)攻击多个地面目标的三维轨迹规划问题。首先,将问题形式化为一类特殊的旅行商问题(TSP),即带动力学约束的邻域访问TSP问题(DCTSPN)。其次,针对规划空间维度过高、搜索代价过大的问题,提出了一种基于概率路标图(PRM)的方法。该方法借鉴了基于采样的运动规划方法的思想,并结合多种组合优化技术,将原本连续状态空间中的轨迹规划问题转化为离散拓扑图上的路由问题。求解过程分为离线预处理和在线查询两个阶段。离线阶段采用Halton拟随机采样算法及Noon-Bean转换方法,将原问题转化为经典的非对称旅行商问题(ATSP);在线阶段根据战场态势的实时变化,快速更新路标图,然后采用LKH算法在线求解问题的近似最优解。为了保证生成的飞行轨迹满足平台的运动学/动力学约束,算法基于Gauss伪谱法构建了局部轨迹规划器。最后,以攻击时间最短为优化指标对算法进行了仿真实验。结果表明,本文提出的方法能够以较高的精度和在线收敛速度生成真实可行的、较优的多目标攻击轨迹。