A hybrid vendor managed inventory and redundancy allocation optimization problem in supply chain management: An NSGA-II with tuned parameters

In this research, a bi-objective vendor managed inventory model in a supply chain with one vendor (producer) and several retailers is developed, in which determination of the optimal numbers of different machines that work in series to produce a single item is considered. While the demand rates of the retailers are deterministic and known, the constraints are the total budget, required storage space, vendor's total replenishment frequencies, and average inventory. In addition to production and holding costs of the vendor along with the ordering and holding costs of the retailers, the transportation cost of delivering the item to the retailers is also considered in the total chain cost. The aim is to find the order size, the replenishment frequency of the retailers, the optimal traveling tour from the vendor to retailers, and the number of machines so as the total chain cost is minimized while the system reliability of producing the item is maximized. Since the developed model of the problem is NP-hard, the multi-objective meta-heuristic optimization algorithm of non-dominated sorting genetic algorithm-II (NSGA-II) is proposed to solve the problem. Besides, since no benchmark is available in the literature to verify and validate the results obtained, a non-dominated ranking genetic algorithm (NRGA) is suggested to solve the problem as well. The parameters of both algorithms are first calibrated using the Taguchi approach. Then, the performances of the two algorithms are compared in terms of some multi-objective performance measures. Moreover, a local searcher, named simulated annealing (SA), is used to improve NSGA-II. For further validation, the Pareto fronts are compared to lower and upper bounds obtained using a genetic algorithm employed to solve two single-objective problems separately.     

Enhancing throughput of the Hadoop Distributed File System for interaction-intensive tasks

The Hadoop Distributed File System (HDFS) is designed to run on commodity hardware and can be used as a stand-alone general purpose distributed file system (Hdfs user guide, 2008). It provides the ability to access bulk data with high I/O throughput. As a result, this system is suitable for applications that have large I/O data sets. However, the performance of HDFS decreases dramatically when handling the operations of interaction-intensive files, i.e., files that have relatively small size but are frequently accessed. The paper analyzes the cause of throughput degradation issue when accessing interaction-intensive files and presents an enhanced HDFS architecture along with an associated storage allocation algorithm that overcomes the performance degradation problem. Experiments have shown that with the proposed architecture together with the associated storage allocation algorithm, the HDFS throughput for interaction-intensive files increases 300% on average with only a negligible performance decrease for large data set tasks.     

许昌市水资源多模式联合调度与合理配置

水资源短缺是制约城市经济社会发展的重要因素,合理配置和有效利用有限的水资源是解决水资源供需矛盾的有效途径。以许昌市国家水生态文明试点城市建设为例,在分析水资源开发利用现状的基础上,运用定额法对需水量进行预测。以多年平均水资源量为基础,2011年作为研究基准年,根据水资源取用方式、工程方案及各种水量需求等,利用MIKE BASIN建立水资源配置模型,对许昌市水资源供需平衡进行模拟,通过三次供需平衡分析,得到不同规划水平年水资源供需配置方案,最终达到水资源供需平衡,使有限的水资源发挥最大效益。研究结果表明,本地水资源结合南水北调、引黄调蓄、中水回用等多模式联合调度,可以满足许昌市中长期经济社会可持续发展用水需求,对未来许昌市水资源可持续利用具有重要的指导意义。     

基于非负矩阵分解的水量分配方案后评价

提出了水量分配方案后评价指标体系,建立了基于非负矩阵分解的水量分配方案后评价模型,并以1983年国务院批复的引滦水量分配方案为研究对象进行了水量分配方案诊断式后评价。该方法利用非负矩阵分解算法将指标矩阵最大程度分解为基向量和权向量,根据权向量元素的数值对水量分配方案进行评级,根据基向量元素的数值判断评价指标的实施状况。通过对引滦水量分配方案质量、实施过程、实施效果和可持续性的调查分析,得出方案综合后评价结果为优,但在来用水可持续性、对水环境影响及水质目标保证率等方面需加以改进。评价结果表明,基于非负矩阵分解原理的后评价方法评价效果较好,可为水量分配方案等项目的后评价提供科学依据。     

水网连通下山东蓝色半岛经济区水资源优化调配研究

对山东半岛蓝色经济区进行水资源优化配置,利于解决区内水资源短缺,促进经济区发展及规划实现。以山东现代水网建设为依托,针对山东蓝色地区水系连通的水资源可持续开发利用的功能需求以及河库连通的二元水网特征,构建水资源优化调配模型。模型基于最严格水资源管理制度需求,通过对现状及规划水平年水资源供需预测分析,开展山东半岛蓝色经济区水系连通下的分层水资源优化配置研究。研究结果为优化区域水资源配置方案,实现地区水资源与社会经济协调发展提供理论支撑。     

Modeling and global trajectory tracking control for an over-actuated MAV

This paper deals with an original micro aerial vehicle (MAV) design, the Omnicopter MAV. It has two central coaxial rotors with fixed-pitch propellers and three perimeter mounted ducted fans with servo motors performing thrust vectoring. Compared with traditional rotary wing MAVs that have inherent underactuation, the Omnicopter possesses some advantages in mobility, for example, lateral translation with zero attitude and hover with nonzero attitude. The trajectory tracking control design, global stability analysis, and control allocation are demonstrated through numerical simulation. The advantage of zero attitude translation is illustrated through experimental results.     

Rescheduling policies for large-scale task allocation of autonomous straddle carriers under uncertainty at automated container terminals

This paper investigates replanning strategies for container-transportation task allocation of autonomous Straddle Carriers (SC) at automated container terminals. The strategies address the problem of large-scale scheduling in the context of uncertainty (especially uncertainty associated with unexpected events such as the arrival of a new task). Two rescheduling policies–Rescheduling New arrival Jobs (RNJ) policy and Rescheduling Combination of new and unexecuted Jobs (RCJ) policy–are presented and compared for long-term Autonomous SC Scheduling (ASCS) under the uncertainty of new job arrival. The long-term performance of the two rescheduling policies is evaluated using a multi-objective cost function (i.e., the sum of the costs of SC travelling, SC waiting, and delay of finishing high-priority jobs). This evaluation is conducted based on two different ASCS solving algorithms–an exact algorithm (i.e., branch-and-bound with column generation (BBCG) algorithm) and an approximate algorithm (i.e., auction algorithm)–to get the schedule of each short-term planning for the policy. Based on the map of an actual fully-automated container terminal, simulation and comparative results demonstrate the quality advantage of the RCJ policy compared with the RNJ policy for task allocation of autonomous straddle carriers under uncertainty. Long-term testing results also show that although the auction algorithm is much more efficient than the BBCG algorithm for practical applications, it is not effective enough, even when employed by the superior RCJ policy, to achieve high-quality scheduling of autonomous SCs at the container terminals.     

一种多接口多信道VANET动态信道分配算法研究

为了合理地实现多接口多信道车载自组织网络（VANET）车辆节点间通信信道的动态分配,提出了一种基于通信双方车辆节点信道切换队列的动态信道分配算法。定义了车辆节点的射频接口状态,给出了信道的性能因子以及信道切换队列的生成方法,通过综合考虑通信双方车辆节点的射频接口状态和信道切换队列,快速自主地建立通信链路,从而解决了信道公平接入和分配不合理的问题。通过软件仿真比较可以看出,该算法实现了信道的动态分配,减小了平均端到端时延,增加了网络平均吞吐量,显著提高了多接口多信道VANET的网络性能。     

随机环境下带有私人信息的单机能力分配策略

本文研究随机环境下考虑私人信息的单机能力分配问题.该问题中各部门的单位产品收益、需求信息及加工设备各时段的能力为私人信息,且各时段中产品的加工时间为随机变量.本文采用设备方与各部门协商的方法对问题进行求解,首先利用随机规划理论将能力分配问题清晰化,然后利用拉格朗日松弛和泰勒级数展开方法进行协商机制设计,接着给出基于偏转次梯度方法的协商参数更新法则,最后综合上述过程给出最终的问题求解算法.数值算例验证了算法的有效性并分析了关键参数对能力分配结果的影响.     

智能电动车辆横纵向协调与重构控制

针对具有高度非线性、强耦合和冗余特性的智能电动车辆运动控制问题,提出了一种由协调控制律和控制分配律组成的横纵向综合控制新方法.首先,建立准确表征智能电动车辆行为机理的动力学模型;其次,采用非奇异滑模控制技术,引入非线性滑动模态切换面,设计有效克服非线性及不确定特性的协调控制律,保证系统状态在有限时间内收敛至平衡点;在此基础上,考虑到轮胎存在冗余和耦合特性,提出基于内点法的控制分配算法来完成期望广义力/力矩的优化分配,实现轮胎横纵向力的协调与重构.仿真结果表明了该方法的有效性.