Environmental regulation in project‐based industries

We study the environmental regulation of industrial activities that are organized as projects. Applications arise in construction, ship and aircraft building, and film making, among other industries. Relative to manufacturing, environmental regulation is different in project‐based industries, due to the uniqueness and geographical diversity of projects, and a lack of product takeback programs. Because the amount of waste and pollution generated by project companies can be large, regulators need environmental policies to ensure reduction of waste and pollution. We consider a regulator who attempts to maximize social welfare. We model this problem as a bilevel nonlinear program. The upper level regulator specifies waste reduction targets, which the lower level project companies meet using waste stream reduction and remediation of pollution, while attempting to control their project costs. We find that high waste diversion targets lead to outcomes with little pollution, but excessive project costs and only modest waste stream reduction. Projects that have lower task precedence density, or that have pollutants with different environmental impacts, show larger increases in project cost and time resulting from regulation. We describe a subsidy for waste stream reduction that coordinates the system, and we estimate the value of coordination. We also describe a bonus that encourages truthful reporting by project companies, and evaluate the relative cost and effectiveness of the subsidy and the bonus. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 228–247, 2015     

A decomposition heuristic for the twin robots scheduling problem

This article provides an efficient heuristic based on decomposition for the twin robots scheduling problem (TRSP). TRSP concerns two moving robots executing storage and retrieval requests in parallel along a shared pathway. The depots are located at both ends of the line and a dedicated robot is assigned to each of them. While moving goods between their respective depots and some storage locations on the line, noncrossing constraints among robots need to be considered. Our heuristic uses a dynamic programming framework to determine the schedule of one robot while keeping the other one's fixed. It finds near‐optimal solutions even for large problem instances with hundreds of jobs in a short time span. © 2014 Wiley Periodicals, Inc. 62:16–22, 2015     

Modeling and solution for the ship stowage planning problem of coils in the steel industry

We consider a ship stowage planning problem where steel coils with known destination ports are to be loaded onto a ship. The coils are to be stowed on the ship in rows. Due to their heavy weight and cylindrical shape, coils can be stowed in at most two levels. Different from stowage problems in previous studies, in this problem there are no fixed positions on the ship for the coils due to their different sizes. At a destination port, if a coil to be unloaded is not at a top position, those blocking it need to be shuffled. In addition, the stability of ship has to be maintained after unloading at each destination port. The objective for the stowage planning problem is to minimize a combination of ship instability throughout the entire voyage, the shuffles needed for unloading at the destination ports, and the dispersion of coils to be unloaded at the same destination port. We formulate the problem as a novel mixed integer linear programming model. Several valid inequalities are derived to help reducing solution time. A tabu search (TS) algorithm is developed for the problem with the initial solution generated using a construction heuristic. To evaluate the proposed TS algorithm, numerical experiments are carried out on problem instances of three different scales by comparing it with a model‐based decomposition heuristic, the classic TS algorithm, the particle swarm optimization algorithm, and the manual method used in practice. The results show that for small problems, the proposed algorithm can generate optimal solutions. For medium and large practical problems, the proposed algorithm outperforms other methods. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 564–581, 2015     

胶泥缓冲器的非线性刚度的控制机理研究

为了改善履带车辆悬挂系统在各种路面的平顺性和缓冲性,对悬挂系统匹配了一款具有非线性刚度的粘弹性胶泥缓冲器。为了定量地研究胶泥缓冲器的非线性刚度控制机理,建立了非线性悬挂系统的动力学方程组。提出了一种无条件稳定的线性加速度逐步积分法对非线性方程组进行数值求解的新方法,最后用冲击实验验证该方法的可靠性。该研究为胶泥缓冲器的优化设计和车辆悬挂悬挂系统的动力学匹配提供了理论指导。     

随机布阵条件下同时数字多波束干扰优化设计方法

针对现有方法普遍存在的波束形成算法效率低、难以形成多频点多方向的同时多波束干扰、不适用于随机布阵条件下的波束形成等缺点,提出了一种基于二阶锥规划(SOCP,Second-Order Cone Programming)理论的同时数字多波束干扰形成方法。首先,给出了在随机布阵条件下干扰多波束优化设计问题的数学描述;其次,以范数准则为例,将随机布阵条件下干扰多波束设计问题的解析形式转化为相应的SOCP形式;再次,利用现有的原-对偶内点算法工具箱Se Du Mi或者CVX进行快速求解。最后,仿真结果表明该方法可以较好地解决随机布阵条件下的多频率多方向雷达目标同时多波束干扰优化设计问题。     

舰载机多机一体化机务保障调度研究

针对舰载机多机一体化机务保障调度问题,以出树、入树的形式描述实际保障过程中并行工序的约束关系,以最大保障完工时间和资源负载均衡性为目标,构建了舰载机多机一体化机务保障非线性多目标混合流水车间调度模型,并设计了一种结合基于Insert的动态邻域爬山搜索策略和并行工序的同步化修正的Memetic算法求解该模型。最后通过实例仿真验证了模型和所提算法的可行性和有效性。     

基于Virtools的洞库工程维护管理虚拟训练系统

为了解决洞库工程教学训练缺乏直观性和实践性的难题,利用Revit,Sketch Up和3D Max软件进行三维模型构建,以漫游中的基本图形变换和位置实时显示技术为例介绍了相关数学原理及Virtools编程实现过程,实现预定功能后发布了洞库工程维护管理虚拟训练系统。该虚拟训练系统具有功能演示、虚拟漫游、虚拟施工、维护管理虚拟训练和考核评估等功能,可以让学员身临其境地学习洞库工程维护管理的相关知识,有效地提高了教学效果。     

Balancing stability and efficiency in team formation as a generalized roommate problem

The assignment of personnel to teams is a fundamental managerial function typically involving several objectives and a variety of idiosyncratic practical constraints. Despite the prevalence of this task in practice, the process is seldom approached as an optimization problem over the reported preferences of all agents. This is due in part to the underlying computational complexity that occurs when intra-team interpersonal interactions are taken into consideration, and also due to game-theoretic considerations, when those taking part in the process are self-interested agents. Variants of this fundamental decision problem arise in a number of settings, including, for example, human resources and project management, military platooning, ride sharing, data clustering, and in assigning students to group projects. In this article, we study an analytical approach to “team formation” focused on the interplay between two of the most common objectives considered in the related literature: economic efficiency (i.e., the maximization of social welfare) and game-theoretic stability (e.g., finding a core solution when one exists). With a weighted objective across these two goals, the problem is modeled as a bi-level binary optimization problem, and transformed into a single-level, exponentially sized binary integer program. We then devise a branch-cut-and-price algorithm and demonstrate its efficacy through an extensive set of simulations, with favorable comparisons to other algorithms from the literature.     

搜索路径给定时的搜索对策问题及其应用

搜索路径给定时的最优搜索方案问题,也可以理解为是关于搜索者和目标的二人对策问题,主要讨论了当搜索路径给定时的单个搜索者和单个目标的搜索对策问题。首先根据问题的特点,利用动态规划和迭代的方法,确定关于目标逃逸路径混合策略的最优分区,证明该分区是多面体凸集;针对目标不同逃逸路径的分区,求出搜索者的最大期望收益,再将问题转化为二人有限零和对策,计算出搜索者的支付矩阵,确定最优搜索策略。最后结合海军护航行动,对我舰载直升机搜索小型海盗船进行分析和计算,说明搜索路径给定时的最优搜索对策对于双方的资源分配和提高搜索效率具有一定的应用价值。     

一类非线性系统的自适应模糊反推近似滑模控制

针对一类含有未知非线性函数项和外界干扰的不确定纯反馈非线性系统,提出了一种自适应模糊反推近似滑模变结构控制方法。采用中值定理和隐函数定理使未知非仿射输入函数拥有显式的控制输入,利用模糊系统逼近未知非线性函数,动态面控制技术解决了反推设计中出现的"微分爆炸"问题。所提出的自适应近似滑模控制方案削弱了传统滑模控制中的抖振现象。从理论上证明了所设计的控制器能够保证闭环系统所有信号半全局一致终结有界。仿真算例验证了算法的有效性。