基于GA和SVM的水火弯板焰道布置优化方法

水火弯板是目前船舶建造中普遍采用的曲型外板加工方法,由于机理复杂,其加工过程参数确定往往依赖于工人的加工经验,难以实现标准化和规范化。文章提出基于遗传算法(GA)和支持向量机(SVM)的水火弯板焰道布置优化方法,以成形曲面和设计曲面之间的形状误差最小为优化目标,将焰道布置优化问题分解成计算最小形状误差和搜寻最佳匹配位置两个问题,并分别运用嵌套GA和SVM来实现这两个问题的求解。实例验证表明该方法能快速高效确定最优的加热线布置方案。     

基于作业成本法和目标成本法集成的船舶敏捷制造成本控制模型研究

通过对作业成本法和目标成本法集成和对船舶敏捷制造过程进行分析,提出了基于LCC的船舶敏捷制造作业成本和目标成本集成的控制方法,并建立了基于作业成本法和目标成本法集成的船舶敏捷制造成本控制模型,在工期-成本均衡的情况下实现船舶敏捷制造的成本最优。     

滚装甩挂运输牵引车调度优化及作业模式类比分析

针对滚装甩挂运输新船型可“直进直出”条件下的“边装边卸”作业模式，与传统船型“船艉 进出”条件下的“先卸后装”作业模式对比，建立滚装甩挂码头牵引车调度的混合整数规划模型， 并设计遗传算法求解模型。通过对比不同规模算例下CPLEX与所设计遗传算法的实验结果，验证模型的正确性和算法的有效性。结果表明：相较于传统船型“先卸后装”作业模式，新船型“边装边卸”作业模式在运营成本方面可降低约15%；当装卸任务分布密集时，卸船任务靠近船艏运营成本越高，装卸任务分布稀疏时，卸船任务远离船艏运营成本越高；总体而言，“边装边卸”作业模式的运营成本低于“先卸后装”作业模式。研究结论可为“边装边卸”作业模式下的港口滚装甩 挂作业调度提供决策支持。     

Prioritizing road extension projects with interdependent benefits under time constraint

Since transportation projects are costly and resources are limited, prioritizing or sequencing the projects is imperative. This study was inspired by a client who asked: “I have tens of approved road extension projects, but my financial resources are limited. I cannot construct all the projects simultaneously, so can you help me prioritize my projects?” To address this question, the benefits and costs of all the possible scenarios must be known. However, the impacts (or benefit) of road extension projects are highly interdependent, and in sizable cases cannot be specified thoroughly. We demonstrate that the problem is analogous to the Traveling Salesman Problem (TSP). Dynamic change in travel demand during construction is another aspect of the complexity of the problem. The literature is yet to provide efficient methods for large cases. To this end, we developed a heuristic methodology in which the variation of travel demand during the construction period is considered. We introduce a geometrical objective function for which a solution-finding policy based on “gradient maximization” is developed. To address the projects’ interdependency, a special neural network (NN) model was devised. We developed a search engine hybridized of Ant Colony and Genetic Algorithm to seek a solution to the TSP-like problem on the NN based on gradient maximization. The algorithm was calibrated and applied to real data from the city of Winnipeg, Canada, as well as two cases based on Sioux-Falls. The results were reliable and identification of the optimum solution was achievable within acceptable computational time.     

基于混沌蚁群算法的最短路径选择研究

如何解决最短路径选择问题一直是城市交通流诱导系统的关键之一.基于群体仿生理论的蚁群算法是解决此问题的一种方法,针对采用蚁群算法进行最短路径选择时易出现的陷入局部最优解问题,引入混沌理论,采用混沌蚁群算法利用混沌初始化进行改善个体质量和利用混沌扰动避免在蚁群算法搜索过程中陷入局部极值,同时降低了蚁群算法的时间复杂度,从而更好的解决了最短路径选择问题.     

积分分离PID控制算法在炉温控制系统中的应用

积分分离PID控制算法是当被控量与设定值偏差较大时,取消积分作用,以提高系统的稳定性,减小系统的偏差,当被控制量接近设定值时,引入积分控制。本文以工业中常用的炉温控制系统为例进行仿真试验分析,验证积分分离PID控制算法的作用。     

鲁棒实时钢轨表面擦伤检测算法研究

应用图像处理和模式识别技术,分析高速线阵扫描相机采集的钢轨数字图像,提出鲁棒实时的钢轨表面擦伤检测算法。这种算法首先分析采集图像在垂直方向的投影曲线,提取准确钢轨图像;之后,借鉴人类视觉对比度感知机理,将钢轨灰度图转换为灰度对比图,并基于最大熵原理进行二值化处理,分割出可疑擦伤区域;然后根据经验知识判定钢轨表面的可疑擦伤。实验验证表明:新算法的检测性能高,平均准确率为90.7%,平均漏检率为3.95%;检测速度快,平均检测时间不超过40 ms。     

Identification of Dynamic Parameters Based on Pseudo-Parallel Ant Colony Optimization Algorithm

IntroductionReal ants are capable of finding the shortest pathfrom a food source to the nest. Inspired by this factand the behavior of ant colonies, a novel optimizationalgorithm called ant system (AS) was first developedby Dorigo in1992[1]. In the following years, diversemodifications of the AS algorithm were made andapplied to many different types of optimization prob-lems, and satisfactory results were obtained. Re-cently, the AS algorithm has been extended to an al-gorithm for solving d…     

快速公交(BRT)线路布设优化算法研究

快速公交(BRT)在我国方兴未艾,而目前缺乏实用的快速公交线网布局优化方法。针对传统直达客流方法应用于快速公交线网布局优化的不足,根据快速公交的特点和功能定位,提出了以直达客流运输密度最大和直达客流绕行系数最小为目标的快速公交线网布局双层非线性优化模型,对模型合理性进行了论证,并提出了简单容易操作的实用求解算法。     

快速公交（BRT）线路布设优化算法研究

快速公交（BBT）在我国方兴未艾，而目前缺乏实用的快速公交线网布局优化方法。针对传统直达客流方法应用于快速公交线网布局优化的不足，根据快速公交的特点和功能定位，提出了以直达客流运输密度最大和直达客流绕行系数最小为目标的快速公交线网布局双层非线性优化模型，对模型合理性进行了论证，并提出了简单容易操作的实用求解算法。