非线性规划中的SQP法

本文对非线性规划中的SQP法作了探讨。在求解QP子问题时引入了对偶变换和LCP法并采用了乘积法和重新求逆等技术。据此编制的非线性规划软件在收敛速度、可靠性和精度等方面均有较好的性能。     

遗传算法在逆向物流网络规划设计中的应用

考虑到客户、初始回收点和回收中心3个层次的逆向物流网络,选择合适的回收中心,确定初始回收点个数和回收周期,基于一些基本假设,以最小化总的相关成本建立了1个内嵌两个指派模型的非线性混合整数规划模型,对符号体系和求解思路进行了分析.借助遗传算法,结合具体实例,给出了求解步骤和求解结果分析.     

客运专线动车组运用计划的计算机编制

根据动车组运用规则，建立了动车组运用计划整数规划模型．为降低求解的复杂性，将动车组运用计划编制问题转化为交路段生成和基于交路段的交路生成两个问题分步求解．用多起点搜索和交路段互换的方法，使求解结果在有效性和均衡性上得以优化．实际编制实验表明了模型和算法的有效性．     

Mathematical model for optimising the sequence for clearing snow from the manoeuvring area during winter operations

This article considers the optimisation of the sequence for clearing snow from stretches of the manoeuvring area of an airport. This issue involves the optimisation of limited resources to remove snow from taxiways and runways thereby leaving them in an acceptable condition for operating aircraft. The airfield is divided into subsets of significant stretches for the purpose of operations and target times are established during which these are open to aircraft traffic. The document contains several mathematical models each with different functions, such as the end time of the process, the sum of the end times of each stretch and gap between the estimated and the real end times. During this process, we introduce different operating restrictions on partial fulfilment of the operational targets as applied to zones of special interest, or relating to the operation of the snow‐clearing machines. The problem is solved by optimisation based on linear programming. The article gives the results of the computational tests carried out on five distinct models of the manoeuvring area, which cover increasingly complex situations and larger areas. The mathematical model is particularised for the case of the manoeuvring area of Adolfo Suarez Madrid—Barajas Airport. Copyright © 2016 John Wiley & Sons, Ltd.

Highlights
• Optimal sequence for clearing snow from the manoeuvring area of an airport.
• Contains optimising algorithms solved using CPLEX LP‐based tree search.
• Restrictions on partial fulfilment of operational targets applied to subsets of significant stretches, used for planning the operation of snow‐clearing machines.
• Model applied to the case of the manoeuvring area of Adolfo Suárez Madrid Barajas Airport.
• Conclusions are given on the results of the computational tests carried out. There are five models of the manoeuvring area which cover increasingly complex situations and larger areas.

     

汉语编程在MapX二次开发中的应用

交通地理信息系统因具有强大的信息服务和管理功能,越来越受到人们的重视。MapX作为GIS设计中一个常用的功能组件．其当前的主要编程环境是英文,这对于英文程度不高的汉语软件开发者来说无疑是个羁绊。因此,通过实例详细说明在易语言汉语编程开发环境下如何利用MapX开发GIS软件的方法,对于该组件的进一步推广应用具有一定的意义。     

Daily Generation Strategies with Consideration of Electricity Contract and Spinning Reserve

When programming the daily generation strategies, power plants consider not only the competitive bids in spot market and the original purchase contracts with distribution companies or users, but also the spinning reserve. Aiming at this goal, the paper puts forward a daily generating model, which is a nonlinear programming model containing integral and continous variables, to coordinate the power volumes of competitive bids, contract and the spinning reserve of power plants and thus to maximize their profits. Then, the model is simplified to ease its solving process, and solved by priority ranking method based on efficiency and quadratic programming. The simulation result of a case study shows that the proposed scheme is reasonable and practicable.     

陆上空箱调运模糊优化研究

应用模糊规划的方法建立了内陆空箱多式联运调运优化模型,研究多种运输方式下的内陆集装箱空箱调运问题。在调运优化模型的基础上给出了不同运输时间和不同运输费用下的成本最低的调运方案.旨在为船公司提供费用最低的内陆空集装箱调运方案,提高船公司的空箱管理水平。     

基于MS-Fortran Powerstation V4.0的有限元分析系统BNAP

介绍新一代Fortran语言编译器 (MS FortranPowerstationV4 0 )的主要特点及其进行有限元分析系统开发的相关步骤 ,最后给出具体的应用示例 .     

�������·�������ģ�ͼ����㷨

在物流活动的商品配送运输中，由于受不确定因素的干扰，对配送车辆调度的适时性造成了很大影响，从而增加了配送成本和降低了配送的服务质量。本文考虑客户对配送时间的要求和车辆行驶时间的不确定性，建立了以车辆配送总行驶距离最小化为目标的机会约束规划模型，并构造了求解该模型的单亲遗传算法，通过实例对模型求解，结果表明，该算法是很有效的。     

基于动态规划的多目标的TBD算法

在弱目标检测领域中,动态规划法是一种有效的能量积累方法。文章针对低信噪比下的多目标检测问题,提出了一种基于动态规划的多目标检测前跟踪算法。该算法能够较有效地估计搜索空间中的目标个数,也能分离出每个目标的航迹。