CCR工艺在投产过程中的问题处理

介绍了常压间歇式循环催化改质制气装置的工艺特点、投产过程中出现的问题及处理方法。     

UCC日产万吨熟料水泥生产线的工艺设计及调试

UOC10 000 t/d熟料水泥生产线以"性能可靠、技术先进、经济实用、节能降耗"为工艺设计的总体原则,其特点为:窑头废气处理使用袋收尘器;窑尾废气降温没有使用增湿塔;窑尾废气处理使用旁路放风系统;燃料使用天然气和重油。采取措施解决了调试中部分车间扬尘严重,生料磨达不到设计产量,窑尾烟室有结皮现象等问题。调试后,该生产线实现了一次性点火成功;一次性投料成功;一次性考核通过。     

两级定位-路径问题的变邻域人工蜂群算法

建立了两级定位-路径问题的数学模型,提出了一种求解该问题的人工蜂群算法。针对该算法容易出现早熟现象,将近年来国外出现的一种新颖的轨迹式启发式算法--变邻域搜索融入其中,由此提出三种变邻域搜索策略。基于不同变邻域搜索策略的人工蜂群算法和人工鱼群算法的求解效果进行对比仿真。实验结果表明,变邻域人工蜂群算法能有效求解两级定位-路径问题。     

A domain-specific knowledge-based heuristic for the Blocks Relocation Problem

The Blocks Relocation Problem consists in minimizing the number of movements performed by a gantry crane in order to retrieve a subset of containers placed into a bay of a container yard according to a predefined order. A study on the mathematical formulations proposed in the related literature reveals that they are not suitable for its solution due to their high computational burden. Moreover, in this paper we show that, in some cases, they do not guarantee the optimality of the obtained solutions. In this regard, several optimization methods based on the well-known A¹ search framework are introduced to tackle the problem from an exact point of view. Using our A¹ algorithm we have corrected the optimal objective function value of 17 solutions out of 45 instances considered by Caserta et al. (2012) [4]. In addition, this work presents a domain-specific knowledge-based heuristic algorithm to find high-quality solutions by means of short computational times. It is based on finding the most promising positions into the bay where to relocate those containers that are currently located on the next one to be retrieved, in such a way that, they do not require any additional relocation operation in the future. The computational tests indicate the higher effectiveness and efficiency of the suggested heuristic when solving real-world scenarios in comparison with the most competitive approaches from the literature.     

基于问题框架的计算机辅助需求工程工具的研发

问题框架(Problem Frames,PF)已经得到需求工程界的广泛重视和研究。目前,问题框架在理论基础和开发方法等方面已经有很多研究成果,但如何把它们应用到实际的软件开发项目中仍是一个有待解决的问题。本工具可帮助系统分析员实现从用户需求到软件规约的平滑和可推理的变换,从而为软件开发项目中需求的沟通、建模及分析等提供技术支持。此外,该工具产生的结果也为下一步的软件设计提供帮助。它对促进问题框架方法的进一步发展和成熟,如从研究走向实用,具有重要的推动作用。     

二甲基亚砜生产技术

介绍国内外二甲基亚砜的生产概况，评述了生产工艺，揭示了存在的问题，进而对我国二甲基亚砜的生产提出建议。     

空气钻转为泥浆钻的技术分析与探讨

对空气钻转为泥浆钻的气液转化技术进行优化配方,为提高上部地层钻进速度找到了一条切实可行的成功之路。实践表明:(1)气液转化技术应从化学因素和钻井工艺因素入手,除选择高效钻井液体系、合理的钻井液密度外,还应采用封堵固壁技术,封固地层微裂隙,提高地层整体强度,达到稳定井壁的目的,并且稳定井壁必须采取多专业多学科共同治理才有成效。(2)建南地区巴东组以上地层相对稳定,适合空气钻井作业,如果配合使用空气锤,速度提高幅度会更大(在普光106井的气体钻井由于使用了空气锤,机械钻速达到10m/h以上)。     

A Building Information Model enabled Multiple Traveling Salesman Problem for building interior patrols

During building emergencies, an effective and visible primary search plan enhances situation awareness and enables a more efficient rescue mission. The aim of the primary search during an emergency is the rapid screening of every space in the building to identify locations of victims and their conditions. Afterwards, first responders can plan for the rescue of those victims. To provide a timely draw up of interior patrol routes and assign rescue teams to conduct the primary search, this study formulates the problem as a multiple traveling salesman problem (M-TSP) where the comprehensive building interior network is given by the building information models (BIMs), while the total traveling costs (lengths) of every rescue team is minimized. To meet the requirement of real-time patrol routes optimization, we employed the branch-and-price algorithm for the enhancement of computation efficiency. In addition, a heuristic method was introduced to provide timely solutions for large-scale networks. A case study is conducted for a single-floor convention center. We utilized BIM to construct a network of nodes and arcs where the decision model requires as input, and the branch-and-price algorithm finds the optimal patrol. The resulting patrol routes can be visualized and serve as guide for rescue teams to conduct the primary search. The integrated approach proposed in this study is practical and can expedite search and rescue missions.     

求解0-1背包问题的混合贪婪遗传算法

求解0-1背包问题（KP）的最优解的时候,传统遗传算法（GA）的局部求精能力不足而简单局部搜索算法的全局探索能力有限,针对上述问题,将这两个算法整合并提出了混合贪婪遗传算法（HGGA）。在GA全局搜索框架下增加局部搜索模块,并改进传统仅基于物品价值密度的修复算子,增加基于物品价值的贪婪混合选项,从而加速寻优过程。HGGA一方面引导种群在进化的优质解空间中展开精细搜索,另一方面依靠GA的经典操作算子开拓全局搜索空间,从而达到算法求精能力和开拓能力的良好平衡。HGGA分别在三组数据上做了测试,结果表明在第一组15个测试用例中的12个上,HGGA能够百分百找到最优解,成功率达到80%;在第二组小规模数据集上,HGGA的性能明显好于其他同类GA和其他元启发算法;在第三组大规模数据集上,HGGA较其他元启发式算法具有更好的稳定性和高效性。     

横向整合战略下异质车辆库存路径优化模型

以实现供货商联盟期望物流成本最小化为目标,针对需求随机波动下的多供货商多产品库存路径问题（IRP）进行了研究。基于横向整合战略,设计了供货商联盟成员间车辆配送成本的合理分摊方式。考虑零售商配送软硬时间窗和库存服务水平要求,构建了多供货商多产品的异质车辆库存路径混合整数随机规划模型,并利用需求累积分布逆函数将其转化为确定型规划模型。然后设计改进遗传算法求解该确定型规划模型。算例分析结果显示,使用异质车辆配送可以比使用同质重型和轻型车辆分别降低供货商联盟总成本8.3%和11.92%,分别提升配送车辆装载率24%和17%。敏感性分析结果表明,无论供货商供货数量占联盟总供货数量比例和零售商商品需求变异系数如何变化,采用异质车辆配送的供货商联盟总成本都能得到有效降低;且需求变异系数越大,采用异质车辆配送的优势越明显。