首页 > 最新文献
paperpass

Applied Soft Computing最新文献

英文 中文
Semantic enhancement in graph contrastive learning by combining topology and features 结合拓扑与特征的图对比学习语义增强
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-02-06 DOI: 10.1016/j.asoc.2026.114773
Bowen Mao , Wenjun Wang , Wei Yu , Qiang Tian , Wenkai Wang , Jiye Liu , Han Bao , Nannan Wu
Graph contrastive learning (GCL), which learns node representations by contrasting two augmented graphs, has attracted significant research interest. The core of GCL is to obtain high-quality positive and negative samples as contrastive pairs, thereby learning the latent semantic information of the original graph. Existing GCL methods typically use random augmentation strategies to generate augmented views. In existing methods, the embeddings of the same node across two augmented graph views are treated as positive pairs, while embeddings of different nodes are regarded as negative pairs. Nevertheless, random graph augmentations may inadvertently distort the inherent structural and semantic properties of the graph, thereby inducing semantic drift for the same node between the two augmented views. Additionally, two different nodes of the same class may have similar semantics after augmentation. Therefore, we argue that the previous method of defining positive and negative pairs faces a bottleneck due to potential inauthenticity between the pairs. To address this issue, we propose a method called Semantic-Aware Graph Contrastive Learning with Positive Sampling (GCLPS), which mines latent semantic information in the graph, incorporating truly semantically similar node pairs as positive pairs. This approach reduces the impact of false positive pairs and helps the GNN learn the semantic relationships between nodes. Specifically, in the topology aspect, we select one-hop neighbors of each node in the original graph as positive pairs. In the feature aspect, we represent nodes on augmented views using subgraph-level graph kernels and choose positive pairs based on their similarity. Finally, we combine these two aspects to form the final set of positive pairs for contrastive loss calculation. Extensive experiments on six benchmark datasets demonstrate that GCLPS achieves superior performance in various downstream tasks compared to state-of-the-art methods.
图对比学习(GCL)是一种通过对比两个增广图来学习节点表示的方法,引起了广泛的研究兴趣。GCL的核心是获得高质量的正、负样本作为对比对,从而学习原始图的潜在语义信息。现有的GCL方法通常使用随机增强策略来生成增强视图。在现有方法中,同一节点在两个增广图视图之间的嵌入被视为正对,而不同节点的嵌入被视为负对。然而,随机图增强可能会无意中扭曲图的固有结构和语义属性,从而导致两个增强视图之间同一节点的语义漂移。此外,同一类的两个不同节点在增强后可能具有相似的语义。因此,我们认为,由于正负对之间存在潜在的不真实性,以前的正负对定义方法面临瓶颈。为了解决这个问题,我们提出了一种称为语义感知图正采样对比学习(GCLPS)的方法,该方法挖掘图中潜在的语义信息,将真正语义相似的节点对合并为正对。这种方法减少了假阳性对的影响,并帮助GNN学习节点之间的语义关系。具体来说,在拓扑方面,我们选择原始图中每个节点的一跳邻居作为正对。在特征方面,我们使用子图级图核表示增强视图上的节点,并根据它们的相似度选择正对。最后,我们将这两个方面结合起来,形成对比损失计算的最终正对集。在六个基准数据集上进行的大量实验表明,与最先进的方法相比,GCLPS在各种下游任务中具有优越的性能。
{"title":"Semantic enhancement in graph contrastive learning by combining topology and features","authors":"Bowen Mao ,&nbsp;Wenjun Wang ,&nbsp;Wei Yu ,&nbsp;Qiang Tian ,&nbsp;Wenkai Wang ,&nbsp;Jiye Liu ,&nbsp;Han Bao ,&nbsp;Nannan Wu","doi":"10.1016/j.asoc.2026.114773","DOIUrl":"10.1016/j.asoc.2026.114773","url":null,"abstract":"<div><div>Graph contrastive learning (GCL), which learns node representations by contrasting two augmented graphs, has attracted significant research interest. The core of GCL is to obtain high-quality positive and negative samples as contrastive pairs, thereby learning the latent semantic information of the original graph. Existing GCL methods typically use random augmentation strategies to generate augmented views. In existing methods, the embeddings of the same node across two augmented graph views are treated as positive pairs, while embeddings of different nodes are regarded as negative pairs. Nevertheless, random graph augmentations may inadvertently distort the inherent structural and semantic properties of the graph, thereby inducing semantic drift for the same node between the two augmented views. Additionally, two different nodes of the same class may have similar semantics after augmentation. Therefore, we argue that the previous method of defining positive and negative pairs faces a bottleneck due to potential inauthenticity between the pairs. To address this issue, we propose a method called Semantic-Aware Graph Contrastive Learning with Positive Sampling (GCLPS), which mines latent semantic information in the graph, incorporating truly semantically similar node pairs as positive pairs. This approach reduces the impact of false positive pairs and helps the GNN learn the semantic relationships between nodes. Specifically, in the topology aspect, we select one-hop neighbors of each node in the original graph as positive pairs. In the feature aspect, we represent nodes on augmented views using subgraph-level graph kernels and choose positive pairs based on their similarity. Finally, we combine these two aspects to form the final set of positive pairs for contrastive loss calculation. Extensive experiments on six benchmark datasets demonstrate that GCLPS achieves superior performance in various downstream tasks compared to state-of-the-art methods.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"192 ","pages":"Article 114773"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190767","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A hybrid NSGA-II and delayed local search approach for home healthcare scheduling and routing optimization 一种混合NSGA-II和延迟局部搜索方法用于家庭医疗保健调度和路由优化
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-14 DOI: 10.1016/j.asoc.2026.114617
Radhia Zaghdoud , Issam Zidi , Olfa Ben Rhaiem , Salim El Khediri , Khaled Mesghouni
The home healthcare sector has emerged as a vital component of modern healthcare systems, addressing the needs of aging populations and individuals with disabilities. However, efficiently managing caregiver schedules and routing while balancing service time windows, skill compatibility, and operational costs remains a critical challenge. This study tackles a multi-objective Home Healthcare Scheduling and Routing Problem (HHCSRP) by optimizing three competing objectives: minimizing total travel time, ensuring equitable workload distribution among caregivers, and reducing waiting time between patient visits. We propose a novel two-stage hybrid algorithm that strategically integrates the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) with a tailored local search method. In the first stage, NSGA-II generates a diverse initial population over multiple generations, while the second stage embeds local search at mid-generations to refine solutions without premature convergence. Computational experiments using adapted Solomon’s Vehicle Routing Problem with Time Windows (VRPTW) benchmarks demonstrate the effectiveness of the algorithm. Our approach achieves superior hypervolume (0.57–0.86) and Pareto front diversity (|FP| = 94.27 on average), outperforming existing methods in balancing efficiency, fairness, and scalability. The results highlight the robustness of the method in handling large-scale instances (100 patients), offering a scalable tool for real-world home healthcare logistics. This work advances multi-objective optimization in healthcare operations, providing actionable insights for administrators to harmonize patient satisfaction and operational efficiency.
家庭医疗保健部门已经成为现代医疗保健系统的重要组成部分,解决了老龄化人口和残疾人的需求。然而,在平衡服务时间窗口、技能兼容性和运营成本的同时,有效地管理护理人员的时间表和路线仍然是一个关键的挑战。本研究通过优化三个相互竞争的目标:最小化总旅行时间,确保护理人员之间公平的工作量分配,以及减少患者就诊之间的等待时间,来解决多目标家庭医疗保健调度和路由问题(HHCSRP)。本文提出了一种新的两阶段混合算法,该算法将非支配排序遗传算法II (NSGA-II)与定制的局部搜索方法相结合。在第一阶段,NSGA-II在多代中生成多样化的初始种群,而第二阶段在中间代嵌入局部搜索以完善解决方案,而不会过早收敛。基于时间窗的所罗门车辆路径问题(VRPTW)基准的计算实验证明了该算法的有效性。我们的方法实现了优越的hypervolume(0.57-0.86)和Pareto front diversity (|FP| =平均94.27),在平衡效率、公平性和可扩展性方面优于现有方法。结果突出了该方法在处理大规模实例(100名患者)方面的鲁棒性,为现实世界的家庭医疗保健物流提供了可扩展的工具。这项工作促进了医疗保健操作中的多目标优化,为管理员提供了可操作的见解,以协调患者满意度和操作效率。
{"title":"A hybrid NSGA-II and delayed local search approach for home healthcare scheduling and routing optimization","authors":"Radhia Zaghdoud ,&nbsp;Issam Zidi ,&nbsp;Olfa Ben Rhaiem ,&nbsp;Salim El Khediri ,&nbsp;Khaled Mesghouni","doi":"10.1016/j.asoc.2026.114617","DOIUrl":"10.1016/j.asoc.2026.114617","url":null,"abstract":"<div><div>The home healthcare sector has emerged as a vital component of modern healthcare systems, addressing the needs of aging populations and individuals with disabilities. However, efficiently managing caregiver schedules and routing while balancing service time windows, skill compatibility, and operational costs remains a critical challenge. This study tackles a multi-objective Home Healthcare Scheduling and Routing Problem (HHCSRP) by optimizing three competing objectives: minimizing total travel time, ensuring equitable workload distribution among caregivers, and reducing waiting time between patient visits. We propose a novel two-stage hybrid algorithm that strategically integrates the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) with a tailored local search method. In the first stage, NSGA-II generates a diverse initial population over multiple generations, while the second stage embeds local search at mid-generations to refine solutions without premature convergence. Computational experiments using adapted Solomon’s Vehicle Routing Problem with Time Windows (VRPTW) benchmarks demonstrate the effectiveness of the algorithm. Our approach achieves superior hypervolume (0.57–0.86) and Pareto front diversity (<span><math><mo>|</mo><mi>F</mi><mi>P</mi><mo>|</mo></math></span> = 94.27 on average), outperforming existing methods in balancing efficiency, fairness, and scalability. The results highlight the robustness of the method in handling large-scale instances (100 patients), offering a scalable tool for real-world home healthcare logistics. This work advances multi-objective optimization in healthcare operations, providing actionable insights for administrators to harmonize patient satisfaction and operational efficiency.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114617"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039739","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Circular intuitionistic fuzzy Dombi Bonferroni mean aggregation operators and MEREC-RAFSI approach for optimizing vehicle routing software 基于循环直觉模糊Dombi Bonferroni均值聚合算子和MEREC-RAFSI方法的车辆路线软件优化
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-17 DOI: 10.1016/j.asoc.2026.114642
Freeha Qamar , Iqra Zareef , Muhammad Riaz , Muhammad Aslam , Vladimir Simic , Dragan Pamucar
For the purpose of optimizing their routes, last mile delivery (LMD) organizations use vehicle routing software (VRS). The topic of VRS selection is of the utmost significance for corporations that deal with managing deliveries at the last mile. This study presents an innovative VRS selection methodology specifically designed for LMD businesses. We regulate the issue within the confines of multi-criteria decision-making (MCDM). Criteria for assessment are based on solid literature, mathematical formulation, and professional judgments. The utilization of circular intuitionistic fuzzy set (CIFS) for this model offers a more adaptable and evocative method for expressing unclear and conflicting data. A novel operator termed as a CIFDBM operator is presented to serve as an aggregation operator to boost the effectiveness of aggregation, influenced by the fundamental Bonferroni mean (BM) operator and centered on Dombi t-norm and t-conorm. Our research sets out a novel hybrid structure that integrates CIFS-based decision-making along with MEREC (method based on the removal effects of criteria) as a weighting technique and RAFSI (ranking of alternatives through functional mapping of criterion subintervals into a single interval) as a ranking approach. A robust MCDM hybrid approach named CIFS-MEREC-RAFSI is designed, which provides a reliable, competent, and quality decision for VRS selection problems containing inconsistent, uncertain, and vague data. The system outperforms state-of-the-art CIF-based MCDM approaches by 17%–22% in terms of ranking stability, resulting in more consistent and dependable rankings for all options.
为了优化他们的路线,最后一英里交付(LMD)组织使用车辆路线软件(VRS)。VRS选择的主题对于处理最后一英里交付管理的公司来说是至关重要的。本研究提出了一种创新的VRS选择方法,专门为LMD企业设计。我们在多标准决策(MCDM)的范围内规范这个问题。评估标准是基于坚实的文献,数学公式和专业判断。该模型采用循环直觉模糊集(circular intuiistic fuzzy set, CIFS),为表达不清晰和冲突的数据提供了一种适应性更强、唤起性更强的方法。提出了一种新的算子CIFDBM算子,该算子受基本Bonferroni mean (BM)算子的影响,以Dombi t-范数和t-保形为中心,作为聚合算子来提高聚合的有效性。我们的研究提出了一种新的混合结构,它将基于cifs的决策与MEREC(基于标准去除效果的方法)作为加权技术和RAFSI(通过将标准子区间的功能映射到单个区间来对备选方案进行排序)作为排序方法集成在一起。设计了一种健壮的MCDM混合方法CIFS-MEREC-RAFSI,该方法为包含不一致、不确定和模糊数据的VRS选择问题提供了可靠、有效和高质量的决策。在排名稳定性方面,该系统比最先进的基于cif的MCDM方法高出17%-22%,从而使所有选项的排名更加一致和可靠。
{"title":"Circular intuitionistic fuzzy Dombi Bonferroni mean aggregation operators and MEREC-RAFSI approach for optimizing vehicle routing software","authors":"Freeha Qamar ,&nbsp;Iqra Zareef ,&nbsp;Muhammad Riaz ,&nbsp;Muhammad Aslam ,&nbsp;Vladimir Simic ,&nbsp;Dragan Pamucar","doi":"10.1016/j.asoc.2026.114642","DOIUrl":"10.1016/j.asoc.2026.114642","url":null,"abstract":"<div><div>For the purpose of optimizing their routes, last mile delivery (LMD) organizations use vehicle routing software (VRS). The topic of VRS selection is of the utmost significance for corporations that deal with managing deliveries at the last mile. This study presents an innovative VRS selection methodology specifically designed for LMD businesses. We regulate the issue within the confines of multi-criteria decision-making (MCDM). Criteria for assessment are based on solid literature, mathematical formulation, and professional judgments. The utilization of circular intuitionistic fuzzy set (CIFS) for this model offers a more adaptable and evocative method for expressing unclear and conflicting data. A novel operator termed as a CIFDBM operator is presented to serve as an aggregation operator to boost the effectiveness of aggregation, influenced by the fundamental Bonferroni mean (BM) operator and centered on Dombi t-norm and t-conorm. Our research sets out a novel hybrid structure that integrates CIFS-based decision-making along with MEREC (method based on the removal effects of criteria) as a weighting technique and RAFSI (ranking of alternatives through functional mapping of criterion subintervals into a single interval) as a ranking approach. A robust MCDM hybrid approach named CIFS-MEREC-RAFSI is designed, which provides a reliable, competent, and quality decision for VRS selection problems containing inconsistent, uncertain, and vague data. The system outperforms state-of-the-art CIF-based MCDM approaches by 17%–22% in terms of ranking stability, resulting in more consistent and dependable rankings for all options.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114642"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039854","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A novel method for large-scale group decision-making with application to e-commerce software system evaluation 一种新的大规模群体决策方法及其在电子商务软件系统评价中的应用
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-12 DOI: 10.1016/j.asoc.2026.114595
Chuan Yue

BACKGROUND

Large-scale group decision-making (LSGDM) in big data environments faces challenges in robust data center construction, objective expert weighting, and efficient information fusion.

OBJECTIVE

This study aims to develop a novel LSGDM framework integrating a Golden Ratio-based data center and an inversion-based data quality metric to improve ranking stability and decision reliability.

METHODS

A GR-based data center was introduced to replace conventional mean/median centers, alongside an inversion-number-driven quality metric for expert weighting and a scalable aggregation technique for converting crisp data into intuitionistic fuzzy matrices. The framework was validated through dynamic experiments and sensitivity analysis.

RESULTS

The GR-based center outperformed mean/median centers in 95% of test scenarios. The inversion-based method achieved perfect ranking consistency (Kendall’s τ=1), showing a 50% improvement over entropy-based methods (τ=2/3), and maintained 100% ranking stability under parameter variations—20 times higher than entropy-based approaches.

CONCLUSION

The proposed framework offers a robust, quantitatively validated solution for LSGDM in data-intensive environments, with significant advantages in consistency and scalability.
背景大数据环境下的大规模群体决策(LSGDM)面临着稳健的数据中心建设、客观的专家权重和高效的信息融合等挑战。本研究旨在开发一种新的LSGDM框架,将基于黄金比例的数据中心和基于反转的数据质量度量相结合,以提高排名稳定性和决策可靠性。方法引入基于gr的数据中心来取代传统的均值/中位数中心,同时引入由反转数字驱动的专家权重质量度量和可扩展的聚合技术,将清晰的数据转换为直观的模糊矩阵。通过动态实验和灵敏度分析对该框架进行了验证。结果基于gr的中心在95%的测试场景中优于均值/中位数中心。基于反演的方法获得了完美的排序一致性(Kendall’s τ=1),比基于熵的方法(τ=2/3)提高了50%,在参数变化下保持了100%的排序稳定性,比基于熵的方法高20倍。结论提出的框架为数据密集型环境下的LSGDM提供了一种鲁棒性、定量验证的解决方案,在一致性和可扩展性方面具有显著优势。
{"title":"A novel method for large-scale group decision-making with application to e-commerce software system evaluation","authors":"Chuan Yue","doi":"10.1016/j.asoc.2026.114595","DOIUrl":"10.1016/j.asoc.2026.114595","url":null,"abstract":"<div><h3>BACKGROUND</h3><div>Large-scale group decision-making (LSGDM) in big data environments faces challenges in robust data center construction, objective expert weighting, and efficient information fusion.</div></div><div><h3>OBJECTIVE</h3><div>This study aims to develop a novel LSGDM framework integrating a Golden Ratio-based data center and an inversion-based data quality metric to improve ranking stability and decision reliability.</div></div><div><h3>METHODS</h3><div>A GR-based data center was introduced to replace conventional mean/median centers, alongside an inversion-number-driven quality metric for expert weighting and a scalable aggregation technique for converting crisp data into intuitionistic fuzzy matrices. The framework was validated through dynamic experiments and sensitivity analysis.</div></div><div><h3>RESULTS</h3><div>The GR-based center outperformed mean/median centers in 95% of test scenarios. The inversion-based method achieved perfect ranking consistency (Kendall’s <span><math><mi>τ</mi><mo>=</mo><mn>1</mn></math></span>), showing a 50% improvement over entropy-based methods (<span><math><mi>τ</mi><mo>=</mo><mn>2</mn><mrow><mo>/</mo></mrow><mn>3</mn></math></span>), and maintained 100% ranking stability under parameter variations—20 times higher than entropy-based approaches.</div></div><div><h3>CONCLUSION</h3><div>The proposed framework offers a robust, quantitatively validated solution for LSGDM in data-intensive environments, with significant advantages in consistency and scalability.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114595"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039869","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Small aerial object detection through FPN-DETR integrated with a novel alignment proposal network 结合新型对准建议网络的FPN-DETR小目标检测
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-12 DOI: 10.1016/j.asoc.2026.114620
Usman Ahmad , Tianlei Ma , Jing Liang , Ponnuthurai Nagaratnam Suganthan , Kunjie Yu , Faisal Mehmood , Farhad Banoori
In the domain of aerial imagery analysis, Small Aerial Object Detection (SAOD) presents significant challenges due to extensive scale variations, diverse orientations, and cluttered arrangements. Existing methods rely on anchor-based boxes or dense points, which involve complex manual steps such as anchor generation, transformation, and non-maximum suppression reasoning. This study proposes an innovative model that incorporates a Feature Pyramid Network into a Detection Transformer (FPN-DETR) to effectively address these challenges. The proposed approach employs the strengths of detection Transformers in modeling long-range dependencies, enabling a more comprehensive understanding of the aerial scene context, extraction of rich and scale-invariant features, and enhancement of detection accuracy for small aerial objects across varied scales and orientations. Additionally, this study develops a Novel Alignment Proposal Network (APN) with a novel loss function to further enhance FPN-DETR, resulting in the creation of the FPN-DETR+APN model. This network eliminates the time-consuming process of creating hand-crafted rotational anchors, which leads to computational complexity in existing conventional oriented detectors. Furthermore, FPN-DETR+APN generates oriented proposals that adeptly capture the diverse orientations of small objects in aerial scenes and provides improved positional priors for feature pooling, thereby enhancing cross-attention modulation in the Transformer decoder. The proposed method demonstrates superior performance in detecting small aerial objects, surpassing state-of-the-art detection frameworks in terms of precision, recall, and overall detection robustness. This study achieves 83.25 % mAP on DOTA-v1.0, 63.07 % mAP on DOTA-v2.0, 97.53 % on HRSC2016, 95.98 % on SSDD, 60.78 % on VisDrone2021, and 94.80 % on HRSID datasets.
在航空图像分析领域,小型空中目标检测(SAOD)由于广泛的尺度变化、不同的方向和混乱的排列而面临重大挑战。现有的方法依赖于基于锚点的盒子或密集点,这涉及复杂的手动步骤,如锚点生成、转换和非最大抑制推理。本研究提出了一种创新模型,该模型将特征金字塔网络集成到检测变压器(FPN-DETR)中,以有效应对这些挑战。该方法利用了探测变形在远程依赖关系建模方面的优势,能够更全面地理解空中场景背景,提取丰富且尺度不变的特征,并提高了对不同尺度和方向的小型空中物体的检测精度。此外,本研究还开发了一种具有新颖损失函数的新型对齐建议网络(APN),以进一步增强FPN-DETR,从而创建了FPN-DETR+APN模型。该网络消除了手工制作旋转锚点的耗时过程,这导致了现有传统定向探测器的计算复杂性。此外,FPN-DETR+APN生成定向建议,熟练地捕获空中场景中小物体的不同方向,并为特征池提供改进的位置先验,从而增强Transformer解码器中的交叉注意调制。该方法在检测小型空中目标方面表现出优异的性能,在精度、召回率和整体检测鲁棒性方面超越了最先进的检测框架。本研究在DOTA-v1.0上实现了83.25 % mAP,在DOTA-v2.0上实现了63.07 % mAP,在HRSC2016上实现了97.53 %,在SSDD上实现了95.98 %,在VisDrone2021上实现了60.78 %,在HRSID上实现了94.80 %。
{"title":"Small aerial object detection through FPN-DETR integrated with a novel alignment proposal network","authors":"Usman Ahmad ,&nbsp;Tianlei Ma ,&nbsp;Jing Liang ,&nbsp;Ponnuthurai Nagaratnam Suganthan ,&nbsp;Kunjie Yu ,&nbsp;Faisal Mehmood ,&nbsp;Farhad Banoori","doi":"10.1016/j.asoc.2026.114620","DOIUrl":"10.1016/j.asoc.2026.114620","url":null,"abstract":"<div><div>In the domain of aerial imagery analysis, Small Aerial Object Detection (SAOD) presents significant challenges due to extensive scale variations, diverse orientations, and cluttered arrangements. Existing methods rely on anchor-based boxes or dense points, which involve complex manual steps such as anchor generation, transformation, and non-maximum suppression reasoning. This study proposes an innovative model that incorporates a Feature Pyramid Network into a Detection Transformer (FPN-DETR) to effectively address these challenges. The proposed approach employs the strengths of detection Transformers in modeling long-range dependencies, enabling a more comprehensive understanding of the aerial scene context, extraction of rich and scale-invariant features, and enhancement of detection accuracy for small aerial objects across varied scales and orientations. Additionally, this study develops a Novel Alignment Proposal Network (APN) with a novel loss function to further enhance FPN-DETR, resulting in the creation of the FPN-DETR+APN model. This network eliminates the time-consuming process of creating hand-crafted rotational anchors, which leads to computational complexity in existing conventional oriented detectors. Furthermore, FPN-DETR+APN generates oriented proposals that adeptly capture the diverse orientations of small objects in aerial scenes and provides improved positional priors for feature pooling, thereby enhancing cross-attention modulation in the Transformer decoder. The proposed method demonstrates superior performance in detecting small aerial objects, surpassing state-of-the-art detection frameworks in terms of precision, recall, and overall detection robustness. This study achieves 83.25 % mAP on DOTA-v1.0, 63.07 % mAP on DOTA-v2.0, 97.53 % on HRSC2016, 95.98 % on SSDD, 60.78 % on VisDrone2021, and 94.80 % on HRSID datasets.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114620"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039913","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A structure-guided framework for multimodal optimization leveraging chaotic search and persistence-based clustering 利用混沌搜索和基于持久性的聚类的多模态优化的结构导向框架
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-21 DOI: 10.1016/j.asoc.2026.114687
Xiang Meng , Yan Pei
Multimodal optimization remains a fundamental challenge due to the difficulty of preserving population diversity while efficiently locating multiple optima. To address this challenge, we propose the structure-guided multimodal optimization (SRS-GMO) framework, which explicitly models the evolutionary process as a structured search over topological regions in the decision space, characterized by a novel structural relevance score (SRS). This score integrates persistence, spatial distinctiveness, and recent evolutionary activity to adaptively allocate computational resources to promising niches while maintaining overall structural diversity. SRS-GMO employs chaotic evolution based on logistic maps to enhance global exploration and facilitate escaping from local optima. We instantiate the framework into two variants: SRS-GMO-SO for single objective multimodal optimization problems and SRS-GMO-MO for multi-objective multimodal optimization problems, respectively. Extensive experiments on the CEC2013 and MMF benchmark suites demonstrate that SRS-GMO achieves superior performance in peak coverage, convergence stability, and structural diversity preservation. We also provide a per-module computational complexity analysis and discuss practical accelerations for scalability. These results validate the effectiveness of the proposed framework in addressing the challenges of both single- and multi-objective multimodal optimization.
由于难以在保证种群多样性的同时有效地定位多个最优点,多模态优化仍然是一个根本性的挑战。为了解决这一挑战,我们提出了结构导向的多模态优化(SRS- gmo)框架,该框架明确地将进化过程建模为决策空间中拓扑区域的结构化搜索,并以新的结构相关性评分(SRS)为特征。该评分综合了持久性、空间独特性和最近的进化活动,在保持整体结构多样性的同时,自适应地将计算资源分配给有希望的生态位。SRS-GMO采用基于logistic映射的混沌进化来增强全局探索能力,并便于从局部最优状态中逃脱。我们将该框架实例化为两个变体:分别用于单目标多模态优化问题的SRS-GMO-SO和用于多目标多模态优化问题的SRS-GMO-MO。在CEC2013和MMF基准测试套件上的大量实验表明,SRS-GMO在峰值覆盖、收敛稳定性和结构多样性保护方面具有优异的性能。我们还提供了每个模块的计算复杂性分析,并讨论了可伸缩性的实际加速。这些结果验证了所提出的框架在解决单目标和多目标多模态优化挑战方面的有效性。
{"title":"A structure-guided framework for multimodal optimization leveraging chaotic search and persistence-based clustering","authors":"Xiang Meng ,&nbsp;Yan Pei","doi":"10.1016/j.asoc.2026.114687","DOIUrl":"10.1016/j.asoc.2026.114687","url":null,"abstract":"<div><div>Multimodal optimization remains a fundamental challenge due to the difficulty of preserving population diversity while efficiently locating multiple optima. To address this challenge, we propose the structure-guided multimodal optimization (SRS-GMO) framework, which explicitly models the evolutionary process as a structured search over topological regions in the decision space, characterized by a novel structural relevance score (SRS). This score integrates persistence, spatial distinctiveness, and recent evolutionary activity to adaptively allocate computational resources to promising niches while maintaining overall structural diversity. SRS-GMO employs chaotic evolution based on logistic maps to enhance global exploration and facilitate escaping from local optima. We instantiate the framework into two variants: SRS-GMO-SO for single objective multimodal optimization problems and SRS-GMO-MO for multi-objective multimodal optimization problems, respectively. Extensive experiments on the CEC2013 and MMF benchmark suites demonstrate that SRS-GMO achieves superior performance in peak coverage, convergence stability, and structural diversity preservation. We also provide a per-module computational complexity analysis and discuss practical accelerations for scalability. These results validate the effectiveness of the proposed framework in addressing the challenges of both single- and multi-objective multimodal optimization.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"192 ","pages":"Article 114687"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146191524","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The attention mechanism for intelligent text generation of traditional cultural symbols in artistic design 艺术设计中传统文化符号智能文本生成的注意机制
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-02-04 DOI: 10.1016/j.asoc.2026.114733
Xi Xu , Da Guo
Amid the digital wave, how to leverage artificial intelligence technologies to accurately interpret and reconstruct traditional cultural symbols has become a key issue in the field of artistic design. Existing image caption generation methods can identify the visual features of objects. But they often fail to capture the inherent cultural spirit and symbolic meanings when dealing with cultural symbols with profound historical connotations and abstract metaphors. This results in generated texts that remain at the level of superficial visual descriptions, lacking cultural depth. In response to this semantic gap, this study proposes an intelligent text generation model integrated with a cross-modal attention mechanism. The model constructs a dual-stream encoding architecture based on the Visual Geometry Group 19 (VGG19) and Bidirectional Encoder Representations from Transformers (BERT). By introducing multi-head self-attention and cross-modal attention modules, it achieves dynamic alignment between visual regions and cultural semantics. Different from traditional methods, the model can actively retrieve key visual clues from images according to the generated textual context. It accurately describes the physical forms of symbols and effectively interprets the cultural implications behind them. Experimental results show that this model achieves scores of 0.42 and 1.31 on the Bilingual Evaluation Understudy-4 (BLEU-4) and Consensus-based Image Description Evaluation (CIDEr) metrics, respectively, significantly outperforming benchmark models. It provides a new paradigm with both accuracy and cultural expressiveness for the digital inheritance and innovative design of traditional cultural symbols.
在数字化浪潮中,如何利用人工智能技术对传统文化符号进行精准解读和重构,成为艺术设计领域的关键问题。现有的图像标题生成方法可以识别物体的视觉特征。但在处理具有深刻历史内涵和抽象隐喻的文化符号时,往往未能捕捉到其内在的文化精神和象征意义。这导致生成的文本停留在肤浅的视觉描述层面,缺乏文化深度。针对这种语义缺口,本研究提出了一种集成了跨模态注意机制的智能文本生成模型。该模型构建了基于视觉几何组19 (VGG19)和变形器双向编码器表示(BERT)的双流编码体系结构。通过引入多头自注意和跨模态注意模块,实现了视觉区域与文化语义的动态对齐。与传统方法不同的是,该模型可以根据生成的文本上下文主动从图像中检索关键的视觉线索。它准确地描述了符号的物理形式,并有效地解释了符号背后的文化含义。实验结果表明,该模型在双语评价Understudy-4 (BLEU-4)和基于共识的图像描述评价(CIDEr)指标上的得分分别为0.42和1.31,显著优于基准模型。它为传统文化符号的数字化传承和创新设计提供了一种兼具准确性和文化表现力的新范式。
{"title":"The attention mechanism for intelligent text generation of traditional cultural symbols in artistic design","authors":"Xi Xu ,&nbsp;Da Guo","doi":"10.1016/j.asoc.2026.114733","DOIUrl":"10.1016/j.asoc.2026.114733","url":null,"abstract":"<div><div>Amid the digital wave, how to leverage artificial intelligence technologies to accurately interpret and reconstruct traditional cultural symbols has become a key issue in the field of artistic design. Existing image caption generation methods can identify the visual features of objects. But they often fail to capture the inherent cultural spirit and symbolic meanings when dealing with cultural symbols with profound historical connotations and abstract metaphors. This results in generated texts that remain at the level of superficial visual descriptions, lacking cultural depth. In response to this semantic gap, this study proposes an intelligent text generation model integrated with a cross-modal attention mechanism. The model constructs a dual-stream encoding architecture based on the Visual Geometry Group 19 (VGG19) and Bidirectional Encoder Representations from Transformers (BERT). By introducing multi-head self-attention and cross-modal attention modules, it achieves dynamic alignment between visual regions and cultural semantics. Different from traditional methods, the model can actively retrieve key visual clues from images according to the generated textual context. It accurately describes the physical forms of symbols and effectively interprets the cultural implications behind them. Experimental results show that this model achieves scores of 0.42 and 1.31 on the Bilingual Evaluation Understudy-4 (BLEU-4) and Consensus-based Image Description Evaluation (CIDEr) metrics, respectively, significantly outperforming benchmark models. It provides a new paradigm with both accuracy and cultural expressiveness for the digital inheritance and innovative design of traditional cultural symbols.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"192 ","pages":"Article 114733"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146191556","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Hierarchical attentive feature refinement network with cross-resolution detail preservation for medical image segmentation 基于交叉分辨率细节保留的分层关注特征细化网络用于医学图像分割
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-02-03 DOI: 10.1016/j.asoc.2026.114760
Xin Shu , Anqi Shi , Xiaofang Guo , Yan Fan , Xin Zhang
Deep learning technology, particularly hierarchical encoder-decoder architectures, is developing rapidly in medical image segmentation, which aids in precise identification, localization, and quantification of anatomical structures and diseased areas in clinical diagnosis. However, most of the existing models face two critical challenges: (1) hierarchical semantic gaps caused by inconsistent receptive adaptation across different network depths; (2) gradual loss of fine details in traditional multi-scale fusion schemes, which disproportionately affects small-scale pathological features. Therefore, this paper proposes a Hierarchical Attentive Feature Refinement Network with Cross-Resolution Detail Preservation (HAFRN-CDP) to tackle these problems. Firstly, a Dual-Branch Pooling Fusion Encoder (DPFE) structure is designed to capture features of different scales and types to effectively alleviate information loss in the encoder. Secondly, a Fine Detail Retention (FDR) module is proposed to emphasize the high-resolution features in the encoder head, perceiving features at different scales and semantic levels. Thirdly, a novel Convolution Block (CB), which is composed of a Multi-Scale Residual Aggregation (MSRA) module and a Bi-Branch Global Attention (BGA) module, is presented to reduce the interference of redundant information caused by multi-scale strategy. Finally, in the decoder part, this paper proposes a Cross-Level Feature Fusion (CLFF) module to recover the details and structure by fusing features at different stages and scales. Extensive comparative experiments are conducted on three biomedical image datasets, and the results demonstrate that our HAFRN-CDP exhibits competitive performance compared to the state-of-the-art, with mDice of 92.87 % on JSUAH-Cerebellum and 91.77 % on 2018DSB, while also maintaining high mPrecision of 85.42 % and mRecall of 95.77 % on BUSI (malignant), confirming both its accuracy and robustness across diverse biomedical segmentation tasks.
深度学习技术,特别是分层编码器-解码器架构,在医学图像分割领域发展迅速,有助于临床诊断中解剖结构和病变区域的精确识别、定位和量化。然而,现有的大多数模型都面临着两个关键的挑战:(1)不同网络深度的接受性适应不一致导致的分层语义缺口;(2)传统的多尺度融合方案逐渐丢失了精细细节,对小尺度病理特征的影响不成比例。为此,本文提出了一种具有交叉分辨率细节保留的分层关注特征优化网络(HAFRN-CDP)来解决这些问题。首先,设计了双支路池化融合编码器(Dual-Branch Pooling Fusion Encoder, DPFE)结构,捕获不同尺度和类型的特征,有效减轻编码器中的信息丢失;其次,提出了精细细节保留(FDR)模块,强调编码器头部的高分辨率特征,感知不同尺度和语义层次的特征;第三,提出了一种由多尺度残差聚集(MSRA)模块和双分支全局关注(BGA)模块组成的新型卷积块(CB),以降低多尺度策略带来的冗余信息干扰;最后,在解码器部分,本文提出了一种跨水平特征融合(Cross-Level Feature Fusion, CLFF)模块,通过融合不同阶段和尺度的特征来恢复图像的细节和结构。在三个生物医学图像数据集上进行了大量的对比实验,结果表明,我们的HAFRN-CDP与最先进的算法相比具有竞争力,在jsuah -小脑上的mice为92.87 %,在2018DSB上的mice为91.77 %,同时在BUSI(恶性)上也保持了85.42 %的mPrecision和95.77 %的mRecall,证实了它在不同生物医学分割任务中的准确性和稳健性。
{"title":"Hierarchical attentive feature refinement network with cross-resolution detail preservation for medical image segmentation","authors":"Xin Shu ,&nbsp;Anqi Shi ,&nbsp;Xiaofang Guo ,&nbsp;Yan Fan ,&nbsp;Xin Zhang","doi":"10.1016/j.asoc.2026.114760","DOIUrl":"10.1016/j.asoc.2026.114760","url":null,"abstract":"<div><div>Deep learning technology, particularly hierarchical encoder-decoder architectures, is developing rapidly in medical image segmentation, which aids in precise identification, localization, and quantification of anatomical structures and diseased areas in clinical diagnosis. However, most of the existing models face two critical challenges: (1) hierarchical semantic gaps caused by inconsistent receptive adaptation across different network depths; (2) gradual loss of fine details in traditional multi-scale fusion schemes, which disproportionately affects small-scale pathological features. Therefore, this paper proposes a Hierarchical Attentive Feature Refinement Network with Cross-Resolution Detail Preservation (HAFRN-CDP) to tackle these problems. Firstly, a Dual-Branch Pooling Fusion Encoder (DPFE) structure is designed to capture features of different scales and types to effectively alleviate information loss in the encoder. Secondly, a Fine Detail Retention (FDR) module is proposed to emphasize the high-resolution features in the encoder head, perceiving features at different scales and semantic levels. Thirdly, a novel Convolution Block (CB), which is composed of a Multi-Scale Residual Aggregation (MSRA) module and a Bi-Branch Global Attention (BGA) module, is presented to reduce the interference of redundant information caused by multi-scale strategy. Finally, in the decoder part, this paper proposes a Cross-Level Feature Fusion (CLFF) module to recover the details and structure by fusing features at different stages and scales. Extensive comparative experiments are conducted on three biomedical image datasets, and the results demonstrate that our HAFRN-CDP exhibits competitive performance compared to the state-of-the-art, with mDice of 92.87 % on JSUAH-Cerebellum and 91.77 % on 2018DSB, while also maintaining high mPrecision of 85.42 % and mRecall of 95.77 % on BUSI (malignant), confirming both its accuracy and robustness across diverse biomedical segmentation tasks.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"192 ","pages":"Article 114760"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146191558","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Node importance identification method for urban rail transit networks based on improved mutual information considering inter-station cross-dependencies 考虑站间交叉依赖的改进互信息城市轨道交通网络节点重要性识别方法
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-02-04 DOI: 10.1016/j.asoc.2026.114755
Yanhui Yin , Guanghong Hu , Zhuo Huang , Jihui Chen , Wencheng Huang
Identifying and protecting the key nodes of urban rail transit networks (URTN) is crucial for the normal operation of rail transit. However, most of the previous studies mainly relied on a single topological structure or passenger flow to identify important nodes, ignoring the inter-station cross-dependencies among the stations. In this paper, an Improved Mutual Information (IMI) is introduced to identify the node importance of URTN considering inter-station cross-dependencies. IMI emphasizes that the influence of a node will spread to the adjacent nodes within the effective range, and the importance of a node is the result of the combined influence of the adjacent nodes within that range. The comparative numerical researches have been conducted, the effectiveness and reliability of the IMI algorithm are validated from three aspects: network connectivity, node importance evaluation, and statistical analysis. Furthermore, under random and intentional attacks, we utilize the relative size of the maximal connected subgraph (RSMCS) and the relative network efficiency (RNE) before and after nodes are attacked to study the invulnerability of undirected unweighted networks of URTN. Additionally, we utilize the weighted RSMCS and the weighted RNE to study the invulnerability of bi-directional weighted URTN networks. Finally, A case study is performed with the Chengdu URTN serving as the context, the results show that, the IMI is suitable for networks with strong inter-station cross-dependencies (especially URTN), and can identify nodes with low degree but crucial due to their high inter-station cross-dependencies. It has higher discrimination ability for nodes ranked lower, and can capture stations with lower node degree but closely related to other important stations or important routes. Finally, suggestions for improving the performance and invulnerability of URTN are proposed from four aspects including expanding the capacity of the station, strengthening the connection between urban bus network and URTN, protecting important stations and routes with strong inter-station cross-dependencies through IMI algorithm, improving operation plans and alleviating peak passenger flow pressure.
城市轨道交通网络关键节点的识别和保护对于轨道交通的正常运行至关重要。然而,以往的研究大多依赖于单一的拓扑结构或客流来识别重要节点,忽略了车站间的交叉依赖关系。本文引入改进的互信息(IMI)来识别URTN节点的重要性,并考虑站间的交叉依赖。IMI强调一个节点的影响会扩散到有效范围内的相邻节点,节点的重要性是该范围内相邻节点综合影响的结果。通过对比数值研究,从网络连通性、节点重要性评估和统计分析三个方面验证了IMI算法的有效性和可靠性。在随机攻击和故意攻击的情况下,利用最大连通子图(RSMCS)的相对大小和节点被攻击前后的相对网络效率(RNE)来研究URTN无向无权网络的抗毁性。此外,我们还利用加权RSMCS和加权RNE来研究双向加权URTN网络的抗毁性。最后,以成都URTN为例进行了实例分析,结果表明,IMI适用于站间交叉依赖较强的网络(尤其是URTN),可以识别出高度交叉依赖的低程度节点。该算法对排名较低的节点具有较高的识别能力,可以捕获节点度较低但与其他重要站点或重要路线密切相关的站点。最后,从扩大站点容量、加强城市公交网络与URTN的连接、通过IMI算法保护站间交叉依赖性强的重要站点和路线、改进运营方案、缓解高峰客流压力等四个方面提出了提高URTN性能和抗火性的建议。
{"title":"Node importance identification method for urban rail transit networks based on improved mutual information considering inter-station cross-dependencies","authors":"Yanhui Yin ,&nbsp;Guanghong Hu ,&nbsp;Zhuo Huang ,&nbsp;Jihui Chen ,&nbsp;Wencheng Huang","doi":"10.1016/j.asoc.2026.114755","DOIUrl":"10.1016/j.asoc.2026.114755","url":null,"abstract":"<div><div>Identifying and protecting the key nodes of urban rail transit networks (URTN) is crucial for the normal operation of rail transit. However, most of the previous studies mainly relied on a single topological structure or passenger flow to identify important nodes, ignoring the inter-station cross-dependencies among the stations. In this paper, an Improved Mutual Information (IMI) is introduced to identify the node importance of URTN considering inter-station cross-dependencies. IMI emphasizes that the influence of a node will spread to the adjacent nodes within the effective range, and the importance of a node is the result of the combined influence of the adjacent nodes within that range. The comparative numerical researches have been conducted, the effectiveness and reliability of the IMI algorithm are validated from three aspects: network connectivity, node importance evaluation, and statistical analysis. Furthermore, under random and intentional attacks, we utilize the relative size of the maximal connected subgraph (RSMCS) and the relative network efficiency (RNE) before and after nodes are attacked to study the invulnerability of undirected unweighted networks of URTN. Additionally, we utilize the weighted RSMCS and the weighted RNE to study the invulnerability of bi-directional weighted URTN networks. Finally, A case study is performed with the Chengdu URTN serving as the context, the results show that, the IMI is suitable for networks with strong inter-station cross-dependencies (especially URTN), and can identify nodes with low degree but crucial due to their high inter-station cross-dependencies. It has higher discrimination ability for nodes ranked lower, and can capture stations with lower node degree but closely related to other important stations or important routes. Finally, suggestions for improving the performance and invulnerability of URTN are proposed from four aspects including expanding the capacity of the station, strengthening the connection between urban bus network and URTN, protecting important stations and routes with strong inter-station cross-dependencies through IMI algorithm, improving operation plans and alleviating peak passenger flow pressure.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"192 ","pages":"Article 114755"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146191541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Differential-game algorithm for resource optimization of wireless sensor network 无线传感器网络资源优化的微分博弈算法
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-12 DOI: 10.1016/j.asoc.2026.114641
Ning Yao , Dong Liu , Bai Chen , Xiaochen Hao , Rongrong Yin
In response to the resource competition optimization problem in wireless sensor network, this paper first uses differential evolution algorithm to transform single-object multi-objective optimization into multi-object single-objective optimization, and combines game theory to design a new differential game algorithm. The algorithm conforms to the differential evolution framework on the outer layer and meets the requirements of game theory on the inner layer. And theoretically proved the low complexity and algorithm convergence. Then, the designed differential game algorithm was applied to the wireless sensor network to design the channel allocation algorithm. The convergence and effectiveness of the algorithm were verified through simulation. Finally, the differential game algorithm was discussed, and it was theoretically proved that the algorithm is also applicable to multi-objective optimization of multiple objects, providing a design idea for low complexity convergence multi-objective optimization algorithms.
针对无线传感器网络中的资源竞争优化问题,本文首先利用差分进化算法将单目标多目标优化转化为多目标单目标优化,并结合博弈论设计了一种新的差分博弈算法。该算法在外层符合微分进化框架,在内层满足博弈论的要求。并从理论上证明了该算法的低复杂度和收敛性。然后,将所设计的差分博弈算法应用到无线传感器网络中,设计信道分配算法。通过仿真验证了该算法的收敛性和有效性。最后对微分博弈算法进行了讨论,从理论上证明了该算法同样适用于多目标的多目标优化,为低复杂度收敛的多目标优化算法提供了设计思路。
{"title":"Differential-game algorithm for resource optimization of wireless sensor network","authors":"Ning Yao ,&nbsp;Dong Liu ,&nbsp;Bai Chen ,&nbsp;Xiaochen Hao ,&nbsp;Rongrong Yin","doi":"10.1016/j.asoc.2026.114641","DOIUrl":"10.1016/j.asoc.2026.114641","url":null,"abstract":"<div><div>In response to the resource competition optimization problem in wireless sensor network, this paper first uses differential evolution algorithm to transform single-object multi-objective optimization into multi-object single-objective optimization, and combines game theory to design a new differential game algorithm. The algorithm conforms to the differential evolution framework on the outer layer and meets the requirements of game theory on the inner layer. And theoretically proved the low complexity and algorithm convergence. Then, the designed differential game algorithm was applied to the wireless sensor network to design the channel allocation algorithm. The convergence and effectiveness of the algorithm were verified through simulation. Finally, the differential game algorithm was discussed, and it was theoretically proved that the algorithm is also applicable to multi-objective optimization of multiple objects, providing a design idea for low complexity convergence multi-objective optimization algorithms.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114641"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039862","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Applied Soft Computing
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
﹀
mjeditor
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1