A Multi-Strategy-Improved Northern Goshawk Optimization Algorithm for Global Optimization and Engineering Design

Optimization algorithms play a pivotal role in enhancing the performance and efficiency of systems across various scientific and engineering disciplines.To enhance the performance and alleviate the limitations of the Northern Goshawk Optimization(NGO)algorithm,particularly its tendency towards premature convergence and entrapment in local optima during function optimization processes,this study introduces an advanced Improved Northern Goshawk Optimization(INGO)algorithm.This algorithm incorporates a multifaceted enhancement strategy to boost operational efficiency.Initially,a tent chaotic map is employed in the initialization phase to generate a diverse initial population,providing high-quality feasible solutions.Subsequently,after the first phase of the NGO’s iterative process,a whale fall strategy is introduced to prevent premature convergence into local optima.This is followed by the integration of T-distributionmutation strategies and the State Transition Algorithm(STA)after the second phase of the NGO,achieving a balanced synergy between the algorithm’s exploitation and exploration.This research evaluates the performance of INGO using 23 benchmark functions alongside the IEEE CEC 2017 benchmark functions,accompanied by a statistical analysis of the results.The experimental outcomes demonstrate INGO’s superior achievements in function optimization tasks.Furthermore,its applicability in solving engineering design problems was verified through simulations on Unmanned Aerial Vehicle(UAV)trajectory planning issues,establishing INGO’s capability in addressing complex optimization challenges.

Implementation of Deutsch-Jozsa Algorithm with Superconducting Quantum-Interference Devices via Raman Transition

In this paper, a theoretical scheme is proposed to implement the Deutsch-Jozsa algorithm with SQUIDs （superconducting quantum-interference devices） in cavity via Raman transition. The scheme only requires a quantized cavity field and classical microwave pulses. In this scheme, no transfer of quantum information between the SQUIDs and the cavity is required, the cavity field is only virtually excited and thus the cavity decay is suppressed.

FLIGHT CLASSIFICATION MODEL BASED ON TRANSITIVE CLOSURE ALGORITHM AND APPLICATION TO FLIGHT SEQUENCING PROBLEM

A new arrival and departure flight classification method based on the transitive closure algorithm （TCA） is proposed. Firstly, the fuzzy set theory and the transitive closure algorithm are introduced. Then four different factors are selected to establish the flight classification model and a method is given to calculate the delay cost for each class. Finally, the proposed method is implemented in the sequencing problems of flights in a terminal area, and results are compared with that of the traditional classification method（TCM）. Results show that the new classification model is effective in reducing the expenses of flight delays, thus optimizing the sequences of arrival and departure flights, and improving the efficiency of air traffic control.

Bi-level programming model and algorithm for optimizing headway of public transit line

Due to the fact that headway is a key factor to be considered in bus scheduling, this paper proposes a bi-level programming model for optimizing bus headway in public transit lines. In this model, with the interests of bus companies and passengers in mind, the upper-level model＇s objective is to minimize the total cost, which is affected by frequency settings, both in time and economy in the transit system. The lower-level model is a transit assignment model used to describe the assignment of passengers＇ trips to the network based on the optimal bus headway. In order to solve the proposed model, a hybrid genetic algorithm, namely the genetic algorithm and the simulated annealing algorithm （GA-SA）, is designed. Finally, the model and the algorithm are tested against the transit data, by taking some of the bus lines of Changzhou city as an example. Results indicate that the proposed model allows supply and demand to be linked, which is reasonable, and the solving algorithm is effective.

Epithelial-mesenchymal transition status of circulating tumor cells in breast cancer and its clinical relevance

Objective:Circulating tumor cells(CTCs)play a critical role in cancer metastasis,but their prevalence and significance remain unclear.This study attempted to track the epithelial-mesenchymal transition(EMT)status of CTCs in breast cancer patients and investigate their clinical relevance.Methods:In this study,the established negFACS-IF:E/M platform was applied to isolate rare CTCs and characterize their EMT status in breast cancer.A total of 89 breast cancer patients were recruited,including stage 0–III(n=60)and late stage(n=29)cases.Results:Using the negFACS-IF:E/M platform,it was found that in human epidermal growth factor receptor 2(HER2)+patients,mesenchymal CTCs usually exhibited a high percentage of HER2+cells.Stage IV breast cancer patients had considerably more CTCs than stage 0–III patients.Among stage 0–III breast cancers,the HER2 subtype included a significantly higher percentage of mesenchymal and biphenotypic(epithelial and mesenchymal)CTCs than the luminal A or B subtypes.Among stage IV patients,CTCs were predominantly epithelial in cases with local recurrence and were more mesenchymal in cases with distant metastasis.By applying a support vector machine(SVM)algorithm,the EMT status of CTCs could distinguish between breast cancer cases with metastasis/local recurrence and those without recurrence.Conclusions:The negFACS-IF:E/M platform provides a flexible and generally acceptable method for the highly sensitive and specific detection of CTCs and their EMT traits in breast cancer.This study demonstrated that the EMT status of CTCs had high clinical relevance in breast cancer,especially in predicting the distant metastasis or local recurrence of breast cancer.

基于List-Based转移的英语语义分析翻译系统研究

针对智能语义分析方法中的非投射弧问题,在List-Based转移算法的基础上,文中结合抽象语义关系图,提出了一种语义分析翻译系统。利用对比大量词语对的方法,List-Based转移算法可以获取这些词语的语义关系,且同时还具有较小的时间复杂度,再结合改进的JAMR对齐器和Oracle分析器,最终提出了基于List-Baesd转移的语义分析翻译系统。该翻译系统可以准确识别出英语等语言的词语顺序变化,从而避免出现智能语义分析方法的非投射弧问题。相关的仿真结果表明,与常用的智能语义分析方法相比,基于List-Based转移算法的语义分析翻译系统具有更加优秀的分析和翻译准确度。

Modified stochastic user-equilibrium assignment algorithm for urban rail transit under network operation

Based on the framework of method of successive averages(MSA), a modified stochastic user-equilibrium assignment algorithm was proposed, which can be used to calculate the passenger flow distribution of urban rail transit(URT) under network operation. In order to describe the congestion's impact to passengers' route choices, a generalized cost function with in-vehicle congestion was set up. Building on the k-th shortest path algorithm, a method for generating choice set with time constraint was embedded, considering the characteristics of network operation. A simple but efficient route choice model, which was derived from travel surveys for URT passengers in China, was introduced to perform the stochastic network loading at each iteration in the algorithm. Initial tests on the URT network in Shanghai City show that the methodology, with rational calculation time, promises to compute more precisely the passenger flow distribution of URT under network operation, compared with those practical algorithms used in today's China.

Analysis of Transit Network Design Using GIS and Honeybee Algorithm in the City of Sanandaj, Iran

Public transit planning is a user-oriented problem, respectful of financial issues and involves different stakeholders such as the general public, the transportation provider and the local government. One of the main components of public transit planning is the transit network design (TND) problem. This research is an attempt to perform transit network design and analysis in the city of Sanandaj, Iran using the capabilities of GIS and Honeybee algorithm. Objectives of this study are formulating a multi-objective model of the TND problem, developing a GIS-based procedure for solving the TND problem and examination of the solutions using artificial metaheuristic methods such as honeybee algorithm. The transit network design approach in this research, aims to reduce the walking distance, the total travel distance and the total number of stops needed for a suitable transit service in Sanandaj, Iran. One of the contributions of this research is developing a transit network design with utilizing a spectrum of GIS software modelling functionalities and using the abilities of the artificial intelligence in modelling and assessment of the transit network.

改进蚁群算法的送餐机器人路径规划

蚁群算法拥有良好的全局性、自组织性、鲁棒性,但传统蚁群算法存在许多不足之处。为此,针对算法在路径规划问题中的缺陷,在传统蚁群算法的状态转移公式中,引入目标点距离因素和引导素,加快算法收敛性和改善局部最优缺陷。在带时间窗的车辆路径问题(vehicle routing problem with time windows,VRPTW)上,融合蚁群算法和遗传算法,并将顾客时间窗宽度以及机器人等待时间加入蚁群算法状态转移公式中,以及将蚁群算法的解作为遗传算法的初始种群,提高遗传算法的初始解质量,然后进行编码,设置违反时间窗约束和载重量的惩罚函数和适应度函数,在传统遗传算法的交叉、变异操作后加入了破坏-修复基因的操作来优化每一代新解的质量,在Solomon Benchmark算例上进行仿真,对比算法改进前后的最优解,验证算法可行性。最后在餐厅送餐问题中把带有障碍物的仿真环境路径规划问题和VRPTW问题结合,使用改进后的算法解决餐厅环境下送餐机器人对顾客服务配送问题。

基于迁移学习的轨道交通特殊OD客流预测研究

客流预测一直是轨道交通运营公司关注的重点,由于受到运输能力的限制等因素影响,部分OD的实际客流数据与真实需求有偏差,出现异常或者样本缺失,从而造成总体样本量偏小,直接采用这些样本进行预测会明显影响预测精度,但通过还原样本值增加样本量难度太大。根据上述特点选择基于实例的迁移学习,先确定源域的对象和范围,从源域中选择合适的样本补充到总体样本中,共同组成最终的训练样本数据集,完成迁移学习。同时选择改进的Boost算法,通过误差调整样本权重,不断迭代,得到最终的预测模型。结果表明:基于实例的迁移学习结合改进Boost算法的预测精度要好于传统集成学习、ARIMA模型、多元回归模型,为轨道交通运营公司对特定OD的客流预测提供新的有益尝试。

城市轨道交通列车加开计划编制模型研究

本文主要研究城市轨道交通在计划编制阶段由于客流不均衡需要在初始运行图加开列车的问题,在确保列车运行安全降低运营成本的前提下合理地加开列车实现运输能力的灵活配置。将列车运行过程形式化描述为事件-活动网络,构建了分时段多目标优化列车加开计划编制模型,提出了启发式决策规则与禁忌搜索算法相结合的两阶段求解算法。结合地铁运行实际数据,在高峰时段和平峰时段分别构建不同算例场景,验证了模型和算法的可行性和有效性。

一种引入过渡阶段和高斯变异的改进算术优化算法

针对算术优化算法收敛精度低、易陷入局部最优等问题,提出了一种改进的过渡高斯算术优化算法,该算法将新的非线性过渡阶段与改进的高斯变异策略相结合.首先,为了更好地从勘探阶段的高离散度策略过渡到开发阶段的低离散度策略,提出过渡阶段策略,并通过比较三种曲线实验重构数学优化加速函数.其次,引入具有算术优化算法特性的高斯变异策略和边界函数策略,加强算法跳出局部区域的能力.最后,将改进后的算术优化算法与几种著名算法进行对比,并进行不同维度的可扩展性分析,验证了所提算法的有效性.此外,该算法在压力容器设计问题中进行了测试.实验结果表明,TGAOA具有优异的收敛精度、收敛速度和鲁棒性.

基于改进涡流搜索算法的外骨骼迭代学习控制

为提升康复外骨骼机器人的步态跟踪性能,提出一种基于改进涡流搜索算法的迭代学习控制方法。首先针对传统迭代学习控制抗扰性差和控制信息缺失问题,引入PD控制器、自适应遗忘因子、误差过渡曲线和控制信息搜索等策略,改进迭代学习控制律;其次,基于多种策略对涡流搜索算法进行改进,提出了一种改进涡流搜索算法,改进后的算法可优化迭代学习控制的PD参数;最后进行行走实验,将提出的迭代学习控制方法与现有的同类算法进行仿真和数值比较,并测试了扰动情况下的跟踪性能。实验结果表明,所提方法的误差更小,跟踪性能更强。该算法改进了迭代学习控制的不足,具有较强的抗扰性能,保证了使用时的稳定性。

考虑动态随机客流的城市轨道交通列车时刻表仿真优化

为更加精准刻画动态随机客流与列车时刻表编制间的复杂匹配过程,综合考虑乘客动态随机到达过程、列车容量限制、车内拥挤度对乘客上下车速率影响、停站时间动态调整和列车运行安全防护等重要运营特征,构建城市轨道交通列车运行离散仿真模型。在此基础上,建立以最小化乘客平均候车时间为目标的随机非线性优化模型,并设计一种基于仿真的有限差分随机逼近算法,用于优化城市轨道交通发车方案。以国内某条线路的实际运营数据为例验证仿真模型及优化方法,结果表明所构建模型及算法具有较好的优化效果和计算效率,优化后的列车实绩运行时刻能更好地适应客流需求的动态随机性,且在不增加发车频次的前提下有效降低乘客平均候车时间,提升城市轨道交通运营管理水平。

基于饥饿变异检索与局部小生境的麻雀算法

针对麻雀搜索算法在迭代过程中在原点与最优解徘徊,造成迭代代价高,在迭代后期,直接跳跃到极值点附近,易于陷入局部最优,且后期种群多样性减小,全局搜索能力差的问题,提出一种基于饥饿变异检索与局部小生境的麻雀算法。首先改进种群中发现者位置迭代方法,提出饥饿短距变异机制,添加变异因子减少在原点与已有最优解的跃迁,提高全局搜索能力;其次改进跟随者位置迭代过程,引入局部小生境概念,将最优解发现者周围划定一个局部小生境,在小生境范围中的麻雀集中搜索最优解附近,小生境外麻雀逃逸到其它位置进行搜索,增强算法最优解附近的搜索能力与增强算法跃出局部空间的能力。对16个基准函数进行仿真对比实验,结果表明提出的基于饥饿变异检索与局部小生境的麻雀算法能够提高算法的搜索精度、收敛速度和稳定性。

基于混合离散状态转移算法的多目标节能无等待流水车间调度

针对以完工时间和总能耗为目标的节能无等待流水车间调度问题(energy-efficient no-wait flow shop scheduling problem,EENWFSP),设计一种混合离散状态转移算法(hybrid discrete state transition algorithm,HDSTA)进行求解。根据问题特性设计工序和速度矩阵的编码方式,采用启发式算法获得优质的初始解。根据EENWFSP性质,对4个离散操作算子进行任务分配,将嵌入二次状态转移的交换、移动、对称算子用于工序优化,替换算子用于机器速度优化,并在替换算子中嵌入基于关键路径的速度替换策略。设计了一种改进的破坏重构操作,用于进一步提高Pareto解的质量。通过与4种算法在测试实例上的实验结果分析,表明HDSTA在解决EENWFSP时具有较强优势。

城市轨道交通乘务交路方案编制的禁忌搜索优化方法

针对城市轨道交通普遍采用轮乘制、日班和两头班混合等特点,对城市轨道交通乘务交路方案编制问题进行研究,旨在降低乘务成本并提高乘务效率.首先,通过分析城市轨道交通乘务交路方案的构成要素,考虑值乘时长、值乘片段接续时间和接续地点等要求,构建值乘片段、值乘任务构成和乘务规则约束,由此建立以乘务组数量和总接续时间等综合指标最小化为目标函数的多目标0-1整数规划模型.然后,针对该模型设计禁忌搜索(Tabu Search,TS)算法进行求解,以先到先走(First-In-First-Out,FIFO)的就近指派原则得到初始解,并设计4种邻域变换策略,以提高邻域解的多样性,并构建基于多邻域结构的禁忌搜索求解算法,实现对乘务交路方案的优化.最后,以广州地铁7号线的乘务交路方案为例进行实例验证.研究结果表明:优化方案较实际运营方案的乘务作业段数和总接续时间分别降低了20%和4.94%,每个乘务作业段值乘列车数量从8.2列增加到10.3列,有效驾驶时间从5.4 h增加到5.8 h,优化方案的各项指标均得到显著提升.研究成果可以为城市轨道交通乘务计划编制提供理论和方法支持.

考虑运输时间的混合流水车间绿色生产调度

针对运输时间对混合流水车间绿色生产调度的影响这一问题,以最大完工时间、生产能耗及生产成本为优化目标,提出一种改进的多目标麻雀搜索算法(Improved Multi-Objective Sparrow Search Algorithm,IMOSSA)进行求解,参考非支配排序将种群适应度值进行划分、引入正余弦策略提高解集质量、加入多项式变异算子和Levy飞行,提高解集的收敛速度和全局搜索能力,避免陷入局部最优。而后设计16种测试算例,将IMOSSA与其他多目标优化算法进行对比,验证了IMOSSA求解的优越性。最后,以某实际生产车间为例,将其生产调度划分为4种模式,证明算法求解的实用性。

数据赋能新质生产力发展的作用机理与实现路径研究

数据要素作为一种零边际成本、创新性高的新型生产要素,将凭借其强渗透性、超融合性等特征的发挥,快速融入到生产、流通、消费、分配等产业环节中,与传统生产要素进行协同联动;并在算法算力的加持下,以颠覆性的技术创新促进生产力质态跃迁,加速新质生产力的形成与发展。对此,将从数据赋能新质生产力的内涵特征出发,系统分析数据要素与新质生产力之间的内在机理与作用机制,进而探索数据赋能新质生产力的实现路径,为构建完善的新质生产力体系助力。

城市轨道交通系统的层次化功能结构解析——以上海为例

解析城市轨道交通系统的功能结构对于建立以轨道交通为骨架的城市空间结构至关重要,其有助于优化城市空间布局,促进交通与土地利用融合,进而推动城市可持续发展。本文利用交通刷卡大数据,基于轨道交通站域的功能相似性和邻接关系提出了功能站组的概念,并形成了一套“站域功能分类—站组范围划定—站群结构识别”的方法体系。以上海市轨道交通系统为例,针对单个站域,构建表征站域土地利用功能的连续客流时间序列,并依据时间序列特征分类得到站域功能类型;将多个具有相似的出行模式和土地利用功能的相邻站域划定为功能站组;以功能站组为基本单元,采用社区发现算法,对功能站组间的客流交互网络进行分析以识别站群。研究结果表明,城市轨道交通系统的“站域—站组—站群”层次化功能结构解析方法综合了场所空间和流空间视角,有助于认识特大城市轨道交通系统的功能结构特征,并为轨道交通系统的发展提供多层次的空间优化建议。