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

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

IP ADDRESS AUTOCONFIGURATION FOR WIRELESS AD HOC NETWORKS

IntroductionWireless ad hoc networks are gaining increas-ing popularity in recent years because of their easeof deployment. No wired base station or infras-tructure is supported,and each hostcommunicatesone anothervia packetradios. In ad hoc networks,routing protocols are challenged with establishingand maintaining multihop routes in the face of mo-bility,bandwidth limitation and power con-straints. In ad hoc networks,each node( host)acts as a router since routes are mostly multihop.Nodes in …     

Vehicle rollover avoidance by application of gain-scheduled LQR controllers using state observers

Many researches have been conducted in the area of control applied to vehicle dynamics, aiming at reducing the possibility of the occurrence of the type of accident known as rollover. In this research, based on a common nonlinear model and its linearisation, a method for properly selecting matrices for solving the Riccati equation considering different speeds was proposed. The method showed in which ways speed really influences the choice of controller gains. By developing the dynamic equations for the yaw- and roll-coupled motions and modelling of controllers and state observers, it is possible to compare the efficacy of this control strategy using both linear and nonlinear simulations using Matlab. Significant results were obtained regarding the reduction of the rollover coefficient for a double-lane change manoeuvre at different speeds, thus indicating advantages of using this controller in practical cases.     

Power-Aware Anycast Routing in Wireless Sensor Network Exploiting Small World Effect

By considering energy-efficient anycast routing in wireless sensor network (WSN), and combining small world characteristics of WSN with the properties of the ant algorithm, a power-aware anycast routing algorithm (SWPAR) with multi-sink nodes is proposed and evaluated. By SWPAR, the optimal sink node is found and the problem of routing path is effectively solved. Simulation results show that compared with the sink-based anycast routing protocol (SARP) and the hierarchy-based anycast routing protocol (HARP), the proposed algorithm improves network lifetime and reduces power consumption.     

移动Ad Hoc网络中基于可靠传输的节能机制

随着移动Ad Hoc网络的应用日趋广泛,如何有效节省移动节点的能量,提高网络生存时间成为了难题.针对现有的节能协议和机制很少考虑链路误码率的问题,分析了在端到端重传机制和逐跳重传机制下的理想能耗,定义了新的链路代价函数.仿真结果表明使用该机制的路由协议具有较好性能,在数据传输可靠性和能耗之间达到有效的平衡.     

最小化网络总时延启发式遗传算法

路由选择算法是用于决定计算机网络每个结点输入的信息包应当从哪一个输出线路发送出去,以便使得某种指定的费用最小。提出了一种新的有效启发式遗传路由算法,以使网络总时延最小。该算法采用了启发式遗传路由方案,从而获得近似最优解。采用遗传算法的方法可以减少网络路由算法的运算规模,实现逐步求解。与其他已知类似算法相比较,该算法具有较小的时间复杂性。     

Reliable routing algorithm in marine ad hoc networks

A routing algorithm called DNH for increasing efficiency of mobile ad hoe network is presented, which is based on a new cflteflon called TSS (Temporarily Steady State), combining with wireless transmission theory that makes networks topology correspondingly stabilization. Also the DNH algorithm has the characteristics of giving up queuing in a node, but selecting another idle node instead of the node for forwarding data packets if the node has a full throughput. Simulation evaluation shows that selecting another node is better than queuing in a full throughout node if some conditions are satisfied, especially during a sea battle, every warship in ad hoe network wants to contest time and increase propagation reliability. The DNH algorithm can help decrease routing time, and raise efficiency of marine ad hoe networks.     

Overview of intelligent ship route optimization methods北大核心CSCD

智能船舶航线优化在学术界和工业界均受到越来越多的关注。针对智能船舶航线优化问题,从航线设计方法和航线优化算法这2个层面,分别阐述各种设计方法和优化算法的特点。结合近5年来的最新研究成果,在分析国内外智能船舶航线优化技术发展现状的基础上,将航线设计方法归纳为3种,即基于气象数据的航线优化、基于油耗模型的航线优化以及基于航线库或航路点库的航线优化,剖析其技术内涵及应用情况;深入分析改进的等时线法、动态规划法、图形搜索算法、智能算法、人工智能和机器学习算法的特性及不足,总结归纳将各类算法应用于智能船舶航线优化时存在的主要问题。最后,简要展望智能船舶航线优化的发展趋势,为未来在该领域的研究提供一定的思路。     

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

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

带时间窗的混和车辆路径问题的优化算法研究

文章针对带时间窗约束的混合车辆路径问题的特点,建立了带时间窗的混合车辆路径问题的数学模型,并设计了变邻域禁忌搜索算法对该问题进行求解。通过标准算例测试及与现有文献计算结果的比较,验证了该算法的有效性。