舰船辐射噪声特征建模

介绍一种舰船辐射噪声1/3 Oct谱模型建立方法.通过分别对机械噪声、螺旋桨直接辐射噪声及桨轴激励艇体振动噪声的特征规律研究,建立了机械和螺旋桨的额定声压脉动谱模型及桨轴激励艇体响应函数模型.根据机械噪声和螺旋桨噪声同航速的变化关系,得到不同转速下的合成辐射噪声1/3 Oct谱.利用Matlab GUI编写舰船辐射噪声...     

Approximate network loading and dual-time-scale dynamic user equilibrium

In this paper we present a dual-time-scale formulation of dynamic user equilibrium (DUE) with demand evolution. Our formulation belongs to the problem class that Pang and Stewart (2008) refer to as differential variational inequalities. It combines the within-day time scale for which route and departure time choices fluctuate in continuous time with the day-to-day time scale for which demand evolves in discrete time steps. Our formulation is consistent with the often told story that drivers adjust their travel demands at the end of every day based on their congestion experience during one or more previous days. We show that analysis of the within-day assignment model is tremendously simplified by expressing dynamic user equilibrium as a differential variational inequality. We also show there is a class of day-to-day demand growth models that allow the dual-time-scale formulation to be decomposed by time-stepping to yield a sequence of continuous time, single-day, dynamic user equilibrium problems. To solve the single-day DUE problems arising during time-stepping, it is necessary to repeatedly solve a dynamic network loading problem. We observe that the network loading phase of DUE computation generally constitutes a differential algebraic equation (DAE) system, and we show that the DAE system for network loading based on the link delay model (LDM) of Friesz et al. (1993) may be approximated by a system of ordinary differential equations (ODEs). That system of ODEs, as we demonstrate, may be efficiently solved using traditional numerical methods for such problems. To compute an actual dynamic user equilibrium, we introduce a continuous time fixed-point algorithm and prove its convergence for effective path delay operators that allow a limited type of nonmonotone path delay. We show that our DUE algorithm is compatible with network loading based on the LDM and the cell transmission model (CTM) due to Daganzo (1995). We provide a numerical example based on the much studied Sioux Falls network.     

A topological route choice model for metro

This article presents a route choice model for public transit networks that incorporates variables related to network topology, complementing those found in traditional models based on service levels (travel time, cost, transfers, etc.) and users’ socioeconomic and demographic characteristics (income level, trip purpose, etc.). The topological variables represent concepts such as the directness of the chosen route and user knowledge of the network. For both of these factors, the necessary data is endogenous to the modelling process and can be quantified without the need for information-gathering beyond what is normally required for building route choice models. Other novel variables in the proposed formulation capture notions of user comfort such as vehicle occupancy rates and certain physical characteristics of network stations. We conclude that these new variables significantly improve the explanatory and predictive ability of existing route choice specifications.     

Multi-objective optimization of a road diet network design

The present study focuses on the development of a model for the optimal design of a road diet plan within a transportation network, and is based on rigorous mathematical models. In most metropolitan areas, there is insufficient road space to dedicate a portion exclusively for cyclists without negatively affecting existing motorists. Thus, it is crucial to find an efficient way to implement a road diet plan that both maximizes the utility for cyclists and minimizes the negative effect on motorists. A network design problem (NDP), which is usually used to find the best option for providing extra road capacity, is adapted here to derive the best solution for limiting road capacity. The resultant NDP for a road diet (NDPRD) takes a bi-level form. The upper-level problem of the NDPRD is established as one of multi-objective optimization. The lower-level problem accommodates user equilibrium (UE) trip assignment with fixed and variable mode-shares. For the fixed mode-share model, the upper-level problem minimizes the total travel time of both cyclists and motorists. For the variable mode-share model, the upper-level problem includes minimization of both the automobile travel share and the average travel time per unit distance for motorists who keep using automobiles after the implementation of a road diet. A multi-objective genetic algorithm (MOGA) is mobilized to solve the proposed problem. The results of a case study, based on a test network, guarantee a robust approximate Pareto optimal front. The possibility that the proposed methodology could be adopted in the design of a road diet plan in a real transportation network is confirmed.     

考虑最短距离作业的港口拖轮作业调度优化

为了合理调度拖轮作业,有效提高拖轮的利用率,减少船舶等待时间,针对拖轮作业特点,用多处理器任务调度理论分析了拖轮作业调度问题.在考虑拖轮最短距离作业的前提下,以最小化最大完工时间为优化目标建立了拖轮作业调度模型.采用演化策略算法对拖轮作业调度问题进行优化,提出了一种基于轮盘赌概率分配的编、解码方法,并设计了三点交叉互换的重组算子和个体基因交叉互换的变异算子.算例结果表明:用演化策略算法的优化结果优于仿真结果和粒子群算法的计算结果.采用实数编码时,通过优化算法得到的最大完工时间最小值为356 min,比仿真结果减少了117 min;而采用整数编码时,最大完工时间最小值为369 min,比仿真结果减少了104 min.验证了最短距离作业原则的有效性.     

城市公路客运站选址与班线分配方法研究

以旅客出行的时间消耗降最低为目标,兼顾客运站的建设成本和经营效益,建立公路客运站的选址与班线分配模型。通过遗传算法求解,并请专家对最好的几组计算结果予以评估和修正,得到客运站的最优选址和班线分配方案。     

基于核函数变换的NLPCC分析在洪水分类中的应用

通过拟线性化变换和降维去噪,得出多维分类指标的低维主成分值,然后通过对每一待分类样本的低维主成分值进行聚类分析,最终得出洪水的自然分类结果.洪水分类实例结果表明,该计算方法不需要复杂的计算机专业知识和优化算法知识,原理清楚,计算简单,结果客观有效,不失为一种洪水分类评价的新途径.选择适宜的非线性变换函数是正确应用该方法的关键,同时对于能够预先给出分类指标值且数值范围较小时,需要指标标准数值判定和聚类效果判定相结合.     

模拟退火算法在供应链生产调度中的应用

研究一个简单供应链中的生产调度问题,目的是找到一个合理生产排序使得单位时间的成本最小,建立该问题的单目标非线性规划模型。运用模拟退火算法,结合邻域搜索进行求解,最后举例验证算法的有效性。     

������Ⱥ�㷨�Ĺ�·���˿�������Ż�

公路客运快递依托客运线路采用直达模式进行运输获得了较好的经济效益,但直达模式却制约着其运输网络的能力和结构. 为提高运输网络的能力,完善运输网络结构,发挥公路客运时效性好的优势,本文提出转运的思想,并用优化模型设计公路客运快递的运输网络,使快件运输时间最小化. 优化模型是带有时间窗的运输网络设计问题,传统算法难以求解,因此用蚁群算法进行求解. 算例分析表明,基于优化模型设计的运输网络可以节省快件的运输时间,提高公路客运快递的运输能力.     

�����н�ͨ��ʽѡ��ģ�͹����о�

基于广州居民出行调查成果,本文从模型架构、效用函数基本形式、参数标定及校核等几个方面对交通方式选择模型的构建进行研究. 提出了方式划分的基本原则,并针对无车家庭、有小汽车家庭和摩托车家庭构建层次划分. 以小汽车家庭为例,阐述方式划分的基本形式. 进而,提出了方式划分参数标定的方法和基本步骤以及系数校核的关键点. 最后将预测结果和实际观测数据进行比较,验证模型的有效性. 本文提出不同层次交通方式划分模型,提高了模型的精度,并在效用函数中引入收入、车辆拥有和吸引量等因素,增强了模型的适用性,为其他类似城市交通方式选择模型的构建提供一定的参考.