Exact algorithms for integrated facility location and production planning problems

We consider a class of facility location problems with a time dimension, which requires assigning every customer to a supply facility in each of a finite number of periods. Each facility must meet all assigned customer demand in every period at a minimum cost via its production and inventory decisions. We provide exact branch‐and‐price algorithms for this class of problems and several important variants. The corresponding pricing problem takes the form of an interesting class of production planning and order selection problems. This problem class requires selecting a set of orders that maximizes profit, defined as the revenue from selected orders minus production‐planning‐related costs incurred in fulfilling the selected orders. We provide polynomial‐time dynamic programming algorithms for this class of pricing problems, as well as for generalizations thereof. Computational testing indicates the advantage of our branch‐and‐price algorithm over various approaches that use commercial software packages. These tests also highlight the significant cost savings possible from integrating location with production and inventory decisions and demonstrate that the problem is rather insensitive to forecast errors associated with the demand streams. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

论报纸策划的具体措施

作为传统媒体之一的报纸媒体,一直承担着信息传播的重要任务,在社会生活中起着重要作用。面临新媒体高速崛起,多媒体的日渐融合这样的环境,也仍然不能忽视报纸媒体的影响力。但是,在高速发展的信息社会中,报纸媒体的创意与策划显得越来越重要。     

装备业务信息系统总体设计应把握的几个重点问题

实施综合统筹的一体化设计,是科学推进装备业务信息系统建设的必由之路。从理论和实践的结合上,阐述了系统总体设计应把握的原则、系统总体结构设计优化、信息中心建设以及对系统研制建设实行全程管理等重点问题,确立了系统总体设计的基本思路。     

Requirements planning for modular products

The focus of this paper is on determining the requirements of different component options of a modular end‐product in an uncertain environment. We explicitly model two distinct sources of uncertainty: stochastic end‐product demand and unknown market proportions for the different product options available. Our cost minimizing model focuses on determining the optimal requirements policies for component options that meet a pre‐set service level. We show that simple common‐sense requirements policies are not generally optimal; there is a non‐linear connection between service level and component requirements that is hard to characterize without a detailed analysis. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

试论六熟悉与灭火预案及指挥员素质的关系

“六熟悉”、灭火预案和指挥员的素质是取得灭火战斗胜利的三个关键因素,在分析三者之间关系的基础上,指出三者具有同样的作用,不可偏废。否则,将无法取得灭火战斗的胜利。     

进化计算在机器人轨迹规划中的应用研究

本文介绍了采用进化计算思想研制的机器人轨迹规划系统ＲＴＰ－１，提出多层次动态结构化编码方案，利用低中高三层进化算法分别优化距离、路径和关节角度偏差，基于多层综合优化策略解决多目标多约束工程优化问题，建立了次序相关问题求解的通用框架。在进化算法中，利用拉马克效应加快轨迹规划速度，在ＲＭ－５０１机械手上实现的任意空间直线和空间曲线轨迹规划具有良好的鲁棒性，规划轨迹的相邻臂构型间具有良好的柔顺性，规划轨迹的臂构型序列具有良好的平滑性。本文所采用的机器人轨迹规划方法具有通用性，可推广应用于各种动力学系统的研制。     

空间布置中的干涉性检查算法

本文提出一种新的干涉性检查算法:首先估计被测对象是否位于可能发生干涉的区域,若是,则再进一步检查它们之间是否接触或穿越等。算法简单明了,效率较高,适用面广,计算机运行结果证实了算法的正确性和可靠性。     

机器人PTP控制曲线研究

本文根据点位控制机器人运动特点和其加速——匀速——减速三段控制方式,以及实时计算量的大小和所定义的点位控制机器人控制曲线参数——最大加速度系数、最大跃动系数,对点位控制机器人用控制曲线进行了系统、深入的分析,给出了一种变形sin加速度控制曲线,并在点位控制机器人上对其性能进行了验证。     

英国车辆电子学研究防御倡议(VERDI)述评

车辆电子学（ＶＥＴＲＯＮＩＣＳ）是近年来装甲车辆研究领域内兴起的一项意义深远的尖端技术。目前,最有影响的３个典型系统是美国的“标准陆军车辆电子系统体系结构（ＳＡＶＡ）”、英国的“车辆电子学研究防御倡议（ＶＥＲＤＩ）”及法国的全电子化主战坦克“勒克莱尔”。简单介绍了ＶＥＲＤＩ的研究历史,系统阐述了其第二研究阶段（ＶＥＲＤＩ－２）的改进方针、改进后的系统组成、设备配置、功能度及系统特征等。     

Disruption management in production planning

We study the problem of recovering a production plan after a disruption, where the disruption may be caused by incidents such as power failure, market change, machine breakdown, supply shortage, worker no‐show, and others. The new recovery plan we seek after has to not only suit the changed environment brought about by the disruption, but also be close to the initial plan so as not to cause too much customer unsatisfaction or inconvenience for current‐stage and downstream operations. For the general‐cost case, we propose a dynamic programming method for the problem. For the convex‐cost case, a general problem which involves both cost and demand disruptions can be solved by considering the cost disruption first and then the demand disruption. We find that a pure demand disruption is easy to handle; and for a pure cost disruption, we propose a greedy method which is provably efficient. Our computational studies also reveal insights that will be helpful to managing disruptions in production planning. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.