Homotopy continuation enhanced branch and bound algorithms for strongly nonconvex mixed-integer nonlinear optimization

Large-scale strongly nonlinear and nonconvex mixed-integer nonlinear programming (MINLP) models frequently appear in optimization-based process synthesis, integration, intensification, and process control. However, they are usually difficult to solve by existing algorithms within acceptable time. In this study, we propose two robust homotopy continuation enhanced branch and bound (HCBB) algorithms (denoted as HCBB-FP and HCBB-RB) where the homotopy continuation method is employed to gradually approach the optimum of the NLP subproblem at a node from the solution at its parent node. A variable step length is adapted to effectively balance feasibility and computational efficiency. The computational results from solving four existing process synthesis problems demonstrate that the proposed HCBB algorithms can find the same optimal solution from different initial points, while the existing MINLP algorithms fail or find much worse solutions. In addition, HCBB-RB is superior to HCBB-FP due to much lower computational effort required for the same locally optimal solution.     

基于分支定界法的相控阵雷达事件调度算法

为解决相控阵雷达事件调度问题中调度成功率、时间偏移率与算法时效性三者之间的矛盾，本文提出一种基于分支定界法的调度算法；该算法首先在现有调度结果上调取所有可执行事件，即获得若干"节点"，多步递推后由多"层"节点形成若干条备选"分支"，扩大解空间范围，提高算法性能；然后通过"删减"操作删减掉收益较低分支，将解空间控制在一适当范围内，减小搜索盲目性，降低算法计算量.仿真实验表明，与基于综合优先级算法的调度结果相比，利用本文算法调度时调度成功率提升了52%；与基于时间指针算法的调度结果相比，本身算法时间偏移率降低了61%；与基于遗传算法的调度结果相比，本文算法调度耗时仅为前者1~2%.     

基于弱变异准则的测试用例约简方法

针对为数较多的测试用例增加了回归测试成本的问题，提出一种基于弱变异准则的测试用例约简方法。首先，基于弱变异准则获得测试用例和变异分支关系矩阵；然后，重复约简4种无效测试需求和子集测试用例；最后，结合人工鱼群算法选择当前最优测试用例，并且交替执行简化和测试用例选择操作直至覆盖所有测试需求。该方法针对6个经典程序与贪心算法和HGS算法相比，基于弱变异准则并且不改变或稍微改变变异评分的条件下，约简率分别提高了73.4%和8.2%，且耗时分别降低了25.3%和56.1%。实验结果表明，所提方法在回归测试中可有效约简测试用例，降低测试代价。     

Effects of multiple-try feedback and question type during mathematics problem solving on performance in similar problems

In a study of mathematics problem solving, the effect of providing multiple-try feedback on later success in solving similar problems was examined. Participants solved mathematics problems that were presented as either multiple-choice or open-ended questions, and were provided with one of four types of feedback: no feedback (NF), immediate knowledge of the correct response (KCR), multiple-try feedback with knowledge of the correct response (MTC), or multiple-try feedback with hints after an initial incorrect response (MTH). Results showed that gains in performance were larger in the open-ended than multiple-choice condition. Furthermore, gains under NF and KCR were similar, gains were larger under MTC than KCR, and gains were larger under MTH than MTC. The implications of these results for the design of assessments for learning are discussed.     

A fast branch,bound and remember algorithm for disassembly line balancing problem

In recent years, the interests of disassembly line have increased owing to economic reasons and the increase of environmental awareness. Effective line can provide many advantages in terms of economic aspect and it facilitates competition the companies with others. This study contributes to the relevant literature by a branch, bound and remember algorithm for disassembly line balancing problem with AND/OR precedence. The proposed exact solution method employs the memory-based dominance rule to eliminate the reduplicated sub-problems by storing all the searched sub-problems and to utilise cyclic best-first search strategy to obtain high-quality complete solutions fast. In this paper, minimising the number of stations is taken as the performance measure. The proposed methodology is tested on a set of 260 instances and compared with the mathematical model using CPLEX solver and five well-known metaheuristics. Computational results show that the proposed method is capable of obtaining the optimal solutions for all the tested instances with less than 0.1?seconds on average. Additionally, comparative study demonstrates that the proposed method is the state-of-the-art algorithm and outperforms the CPLEX solver and metaheuristics in terms of both solution quality and search speed aspects.     

雷达工程专业本科毕业设计指导模式探索

为提高本科毕业设计指导工作效率和毕业论文质量，本文基于雷达工程专业特点建立了“导师主导--研究生辅助--本科生合作”的多层次、模块化、场景化指导模式。该模式以导师为核心、科研小组和学员合作为辅助，全方位全过程保障本科毕设工作。实践表明，该模式可以有效提高指导工作效率和本科毕业设计质量，学生专业素养和实践能力显著提升。本文对电子类专业本科毕设指导具有重要借鉴意义。     

平均值法在加热炉支路平衡控制上的实现

针对加热炉支路出口温度的平衡控制,提出了一种控制方法——平均值法,它采用增量式PID加输出修正的方式,既确保了出口温度平衡,又保证了平衡调节过程中总管流量不变。同时分析了总管流量增减过程中对温度平衡带来的干扰,并提出了一种控制算法。最后在DCS上的应用结果表明:平局值法能有效地在加热炉出口上实现温度平衡控制。     

能源动力类专业基础课参与式教学设计与实践

以教学实践为基础,结合能源动力类专业基础课课程的教学特点,深入探讨创新型人才培养背景下参与式教学在《热工理论基础》系列课程中应用的设计理念、实施策略、实践过程及其结果,结果表明参与式教学对于提高学生学习兴趣、自主能力和创新能力起着积极地作用,探索出了行之有效的工科专业基础课参与式教学模式。     

Ausbau des Stichkanals nach Salzgitter von SKS‐km 3,550 bis 14,918

Expansion of the branch channel to Salzgitter from SKS‐km 3,550 to 14,918 The branch channel to Salzgitter will be extended to the waterway category Vb in the next years. This will enable inland waterway vessels with a width of 11,45 m and a loaded draft of 2,80 m to run it without limitations. The reaches Wedtlenstedt and Üfingen will be extended in most areas to a trapezoidal cross section with a width at water level of 36,90 m and a water depth of 4,00 m. The exit basins of the locks will be extended on one side. Overall about 1 000 000 m² of soil will be moved. About 300 000 m² of clay sealing and 460 000 m² of rip‐rap will be installed. Three culverts have to be replaced by new constructions to adapt to the new cross section of the channel. In addition two bridges will be modified to allow for a clearance of 5,25 m. At present the plan approval procedure is carried out. It is expected to achieve the plan approval order in 2017. The construction is planned to start in 2018. Completion is scheduled for 2024.