首页 > 最新文献

Expert Systems with Applications最新文献

英文 中文
MatNet : Multi-scale adaptive time series forecasting network with bidirectional collaborative pathways MatNet:具有双向协同路径的多尺度自适应时间序列预测网络
IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-03 DOI: 10.1016/j.eswa.2026.131493
Guangming Zi, Yujun Zhu, Xin He, Yong Xu, Qun Fang
In long-term time series forecasting (LSTF), a fundamental challenge lies in simultaneously capturing fine-grained local dynamics and long-range global dependencies within inherently complex and non-stationary temporal series. However, most existing forecasting architectures rely on single-structure paradigms, each exhibiting inherent representational biases–for example, CNNs are constrained by limited receptive fields, while Transformers often overlook fine-grained local patterns. More critically, these architectures typically operate in isolation, lacking collaborative mechanisms to effectively integrate their complementary modeling capabilities. To address these limitations, we propose MatNet, a Multi-scale Adaptive Forecasting Network with a novel bidirectional collaborative architecture designed to establish bidirectional collaborative pathways between CNN and Transformer branches. Within this architecture, local representations extracted by CNNs are leveraged to refine and enrich the global context modeled by Transformers, thereby improving the model’s sensitivity to fine-grained temporal structures. Conversely, global dependencies captured by Transformer provide high-level semantic guidance to CNNs, enabling them to focus on contextually salient local regions and enhance representation coherence. Additionally, we introduce a Dynamic Temporal-Aware Router that adaptively extracts and fuses temporal features across multiple scales, enabling adaptive multi-scale modeling. Extensive experiments on nine public datasets demonstrate that MatNet consistently outperforms existing state-of-the-art methods in forecasting accuracy.
在长期时间序列预测(LSTF)中,一个基本的挑战在于同时捕获固有的复杂和非平稳时间序列中的细粒度局部动态和长期全局依赖关系。然而,大多数现有的预测架构依赖于单结构范式,每个都表现出固有的表征偏差——例如,cnn受到有限的接受域的约束,而变形金刚经常忽略细粒度的局部模式。更关键的是,这些体系结构通常是孤立运行的,缺乏协作机制来有效地集成它们互补的建模功能。为了解决这些限制,我们提出了MatNet,这是一个多尺度自适应预测网络,具有新颖的双向协作架构,旨在建立CNN和Transformer分支之间的双向协作路径。在该体系结构中,利用cnn提取的局部表示来细化和丰富变形金刚建模的全局上下文,从而提高模型对细粒度时间结构的敏感性。相反,Transformer捕获的全局依赖关系为cnn提供了高级语义指导,使它们能够专注于上下文显著的局部区域并增强表示一致性。此外,我们还引入了一个动态时间感知路由器,该路由器可以自适应地提取和融合多尺度的时间特征,从而实现自适应多尺度建模。在9个公共数据集上进行的大量实验表明,MatNet在预测准确性方面始终优于现有的最先进的方法。
{"title":"MatNet : Multi-scale adaptive time series forecasting network with bidirectional collaborative pathways","authors":"Guangming Zi,&nbsp;Yujun Zhu,&nbsp;Xin He,&nbsp;Yong Xu,&nbsp;Qun Fang","doi":"10.1016/j.eswa.2026.131493","DOIUrl":"10.1016/j.eswa.2026.131493","url":null,"abstract":"<div><div>In long-term time series forecasting (LSTF), a fundamental challenge lies in simultaneously capturing fine-grained local dynamics and long-range global dependencies within inherently complex and non-stationary temporal series. However, most existing forecasting architectures rely on single-structure paradigms, each exhibiting inherent representational biases–for example, CNNs are constrained by limited receptive fields, while Transformers often overlook fine-grained local patterns. More critically, these architectures typically operate in isolation, lacking collaborative mechanisms to effectively integrate their complementary modeling capabilities. To address these limitations, we propose MatNet, a Multi-scale Adaptive Forecasting Network with a novel bidirectional collaborative architecture designed to establish bidirectional collaborative pathways between CNN and Transformer branches. Within this architecture, local representations extracted by CNNs are leveraged to refine and enrich the global context modeled by Transformers, thereby improving the model’s sensitivity to fine-grained temporal structures. Conversely, global dependencies captured by Transformer provide high-level semantic guidance to CNNs, enabling them to focus on contextually salient local regions and enhance representation coherence. Additionally, we introduce a Dynamic Temporal-Aware Router that adaptively extracts and fuses temporal features across multiple scales, enabling adaptive multi-scale modeling. Extensive experiments on nine public datasets demonstrate that MatNet consistently outperforms existing state-of-the-art methods in forecasting accuracy.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"312 ","pages":"Article 131493"},"PeriodicalIF":7.5,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146192696","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
Towards privacy-preserving and communication-efficient federated distillation 面向隐私保护和通信高效的联邦蒸馏
IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-03 DOI: 10.1016/j.eswa.2026.131503
Xinge Ma, Jin Wang, Xuejie Zhang
Federated distillation (FD) has emerged as a promising alternative to federated learning (FL) for collaborative training across decentralized clients to benefit from their private data by exchanging model outputs associated with a large-scale unlabeled public dataset. However, recent studies have revealed that sharing model outputs still poses privacy risks of data exposure when encountering malicious attacks. Although incorporating differential privacy (DP) can provide strong privacy guarantees for FD by perturbing model parameters to produce secure model outputs or directly injecting calibrated noise to model outputs before sharing, it either suffer from inefficient knowledge transfer due to the limited domain-specific knowledge learned by local models or incurs a high privacy cost that significantly compromises the utility of model outputs because the required noise magnitude is proportional to the scale of the perturbed target. To balance the trade-off between knowledge utility and privacy protection, this paper presents FedLA, a privacy-preserving and communication-efficient FD framework empowered by local differential privacy and active data sampling, which proactively selects the most informative subset from the large-scale unlabeled public dataset as a high-quality carrier for local perturbation and knowledge transfer. The resulting reduction in the number of queries to local models minimizes privacy cost and communication overhead while maximizing model performance. Experiments on two popular benchmark datasets across diverse evaluation settings demonstrate the superiority of FedLA in terms of model accuracy, communication efficiency, privacy cost, and attack defense. The code is available at: https://github.com/maxinge8698/FedLA.
联邦蒸馏(FD)已经成为联邦学习(FL)的一个有前途的替代方案,用于跨分散客户端的协作训练,通过交换与大规模未标记的公共数据集相关的模型输出,从他们的私有数据中受益。然而,最近的研究表明,共享模型输出在遭遇恶意攻击时仍然存在数据暴露的隐私风险。虽然结合差分隐私(DP)可以通过扰动模型参数以产生安全的模型输出或在共享之前直接向模型输出注入校准过的噪声,为FD提供强大的隐私保证,由于局部模型学习到的特定领域的知识有限,它要么存在知识转移效率低下的问题,要么由于所需的噪声大小与受干扰目标的规模成正比,从而导致高昂的隐私成本,从而严重损害了模型输出的效用。为了平衡知识效用和隐私保护之间的平衡,本文提出了一种基于局部差分隐私和主动数据采样的隐私保护和通信高效FD框架,该框架主动从大规模未标记的公共数据集中选择最具信息量的子集作为局部扰动和知识转移的高质量载体。对本地模型的查询数量的减少将最小化隐私成本和通信开销,同时最大化模型性能。在两个流行的基准数据集上进行的不同评估设置的实验表明,FedLA在模型精度、通信效率、隐私成本和攻击防御方面具有优势。代码可从https://github.com/maxinge8698/FedLA获得。
{"title":"Towards privacy-preserving and communication-efficient federated distillation","authors":"Xinge Ma,&nbsp;Jin Wang,&nbsp;Xuejie Zhang","doi":"10.1016/j.eswa.2026.131503","DOIUrl":"10.1016/j.eswa.2026.131503","url":null,"abstract":"<div><div>Federated distillation (FD) has emerged as a promising alternative to federated learning (FL) for collaborative training across decentralized clients to benefit from their private data by exchanging model outputs associated with a large-scale unlabeled public dataset. However, recent studies have revealed that sharing model outputs still poses privacy risks of data exposure when encountering malicious attacks. Although incorporating differential privacy (DP) can provide strong privacy guarantees for FD by perturbing model parameters to produce secure model outputs or directly injecting calibrated noise to model outputs before sharing, it either suffer from inefficient knowledge transfer due to the limited domain-specific knowledge learned by local models or incurs a high privacy cost that significantly compromises the utility of model outputs because the required noise magnitude is proportional to the scale of the perturbed target. To balance the trade-off between knowledge utility and privacy protection, this paper presents FedLA, a privacy-preserving and communication-efficient FD framework empowered by local differential privacy and active data sampling, which proactively selects the most informative subset from the large-scale unlabeled public dataset as a high-quality carrier for local perturbation and knowledge transfer. The resulting reduction in the number of queries to local models minimizes privacy cost and communication overhead while maximizing model performance. Experiments on two popular benchmark datasets across diverse evaluation settings demonstrate the superiority of FedLA in terms of model accuracy, communication efficiency, privacy cost, and attack defense. The code is available at: <span><span>https://github.com/maxinge8698/FedLA</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"312 ","pages":"Article 131503"},"PeriodicalIF":7.5,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146192778","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
Robot path planning based on multi-strategy enhanced aquila optimizer algorithm in complex environments 复杂环境下基于多策略增强aquila优化算法的机器人路径规划
IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-03 DOI: 10.1016/j.eswa.2026.131489
Yu Zhou , Xing Liu , Jianqiao Long , Yitian Lu , Jiaoyang Cheng , Jichun Li
Path planning is a core challenge in autonomous navigation and continuously attracts significant attention in mobile robotics. While optimization algorithms are widely employed for solving robot path planning problems, the Aquila Optimizer (AO) suffers from slow convergence and a tendency to become trapped in local optima. To address these limitations, we propose a robot path planning method based on a Multi-strategy Enhanced Aquila Optimizer (MEAO). In MEAO, the initial population is enhanced using opposition-based learning, and an adaptive parameter mechanism balances exploration and exploitation. During the narrowed exploration phase, a phasor operator enables non-parametric optimization to improve global search capability, while a differential evolution mutation strategy is embedded to strengthen local exploitation. The algorithm’s performance is validated on the CEC2022 benchmark functions with ablation studies confirming the effectiveness and synergy of the various strategies. MEAO is further applied to robot path planning, with simulations performed on various complex two-dimensional grid maps, and comparisons made against several intelligent optimization-based algorithms. In addition, to address the limitations of the traditional Dynamic Window Approach (DWA) in terms of dynamic obstacle avoidance robustness and susceptibility to local minima, we introduce a dynamic threat response mechanism and an adaptive heading trap detection strategy. A collaborative framework combining MEAO-based global planning with the improved DWA for local obstacle avoidance is then established. Experimental results demonstrate that MEAO achieves shorter path lengths and faster convergence, while the improved DWA significantly enhances obstacle avoidance robustness in complex environments. The proposed collaborative framework thus ensures globally optimal paths and reliable real-time local obstacle avoidance, demonstrating the practicality and efficiency of the MEAO algorithm and improved DWA for mobile robot navigation.
路径规划是自主导航的核心问题,一直是移动机器人研究的热点。虽然优化算法被广泛用于解决机器人路径规划问题,但Aquila Optimizer (AO)存在收敛速度慢且容易陷入局部最优的问题。为了解决这些限制,我们提出了一种基于多策略增强Aquila优化器(MEAO)的机器人路径规划方法。在MEAO中,使用基于对立的学习增强初始种群,并采用自适应参数机制平衡探索和开发。在狭窄的勘探阶段,相量算子实现非参数优化以提高全局搜索能力,而嵌入差分进化突变策略以加强局部开发。该算法的性能在CEC2022基准函数上进行了验证,并进行了消融研究,证实了各种策略的有效性和协同性。MEAO进一步应用于机器人路径规划,在各种复杂的二维网格地图上进行了仿真,并与几种基于智能优化的算法进行了比较。此外,为了解决传统动态窗口方法在动态避障鲁棒性和局部最小敏感性方面的局限性,引入了动态威胁响应机制和自适应航向陷阱检测策略。建立了基于meao的全局规划与改进DWA相结合的局部避障协作框架。实验结果表明,MEAO的路径长度更短,收敛速度更快,改进的DWA显著提高了复杂环境下的避障鲁棒性。所提出的协作框架保证了全局最优路径和可靠的实时局部避障,证明了MEAO算法和改进的DWA在移动机器人导航中的实用性和高效性。
{"title":"Robot path planning based on multi-strategy enhanced aquila optimizer algorithm in complex environments","authors":"Yu Zhou ,&nbsp;Xing Liu ,&nbsp;Jianqiao Long ,&nbsp;Yitian Lu ,&nbsp;Jiaoyang Cheng ,&nbsp;Jichun Li","doi":"10.1016/j.eswa.2026.131489","DOIUrl":"10.1016/j.eswa.2026.131489","url":null,"abstract":"<div><div>Path planning is a core challenge in autonomous navigation and continuously attracts significant attention in mobile robotics. While optimization algorithms are widely employed for solving robot path planning problems, the Aquila Optimizer (AO) suffers from slow convergence and a tendency to become trapped in local optima. To address these limitations, we propose a robot path planning method based on a Multi-strategy Enhanced Aquila Optimizer (MEAO). In MEAO, the initial population is enhanced using opposition-based learning, and an adaptive parameter mechanism balances exploration and exploitation. During the narrowed exploration phase, a phasor operator enables non-parametric optimization to improve global search capability, while a differential evolution mutation strategy is embedded to strengthen local exploitation. The algorithm’s performance is validated on the CEC2022 benchmark functions with ablation studies confirming the effectiveness and synergy of the various strategies. MEAO is further applied to robot path planning, with simulations performed on various complex two-dimensional grid maps, and comparisons made against several intelligent optimization-based algorithms. In addition, to address the limitations of the traditional Dynamic Window Approach (DWA) in terms of dynamic obstacle avoidance robustness and susceptibility to local minima, we introduce a dynamic threat response mechanism and an adaptive heading trap detection strategy. A collaborative framework combining MEAO-based global planning with the improved DWA for local obstacle avoidance is then established. Experimental results demonstrate that MEAO achieves shorter path lengths and faster convergence, while the improved DWA significantly enhances obstacle avoidance robustness in complex environments. The proposed collaborative framework thus ensures globally optimal paths and reliable real-time local obstacle avoidance, demonstrating the practicality and efficiency of the MEAO algorithm and improved DWA for mobile robot navigation.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"312 ","pages":"Article 131489"},"PeriodicalIF":7.5,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146122751","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
Integration of discriminant analysis with Artificial neural networks to decision analytic framework for enhancing automated visual IC inspection accuracy 将判别分析与人工神经网络集成到决策分析框架中,提高集成电路自动视觉检测精度
IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-03 DOI: 10.1016/j.eswa.2026.131356
Tossapol Kiatcharoenpol, Sakon Klongboonjit
This study aims to enhance the accuracy and reliability of automated visual inspection (AVI) in semiconductor manufacturing by integrating Linear Discriminant Analysis (LDA) and an Optimization Layer by Layer Neural Network (OLLNN). Unlike prior LDA-ANN hybrid approaches that primarily emphasize classification accuracy, this study formalizes a decision-analytic inspection loop that explicitly links discriminant centroids, feasible lighting regions, surrogate nonlinear modeling, and production level validation. A two-stage decision analytic framework is developed. In the first stage, LDA is applied to classify and identify discriminant boundaries and centroids between acceptable and defective image features under three lighting setups: coaxial ring, high ring, and low ring lights. In the second stage, OLLNN is trained using these features to capture nonlinear dependencies between greyscale intensity and lighting parameters, and then a surface response plot is used to ease the optimal parameter selection. The integrating model is validated using experimental IC marking inspection data to evaluate improvements in accuracy, especially false positive rates (Type I error). It was found that for the validation state, the false positive rates are reduced from 5.8% to below 4.6%, and classification accuracy improves significantly across variable illumination conditions. After implementation in mass production, the yield is increased to 99.6% with zero false positive found. This significant development of the integrating model enhances a foundation for adaptive, data-driven control of AVI parameters in smart factory environments that support real-time learning and improvement.
本研究旨在整合线性判别分析(LDA)与优化逐层神经网路(OLLNN),以提高半导体制造中自动视觉检测(AVI)的准确性与可靠性。与先前主要强调分类准确性的LDA-ANN混合方法不同,本研究形式化了一个决策分析检查回路,该回路明确地将判别质心、可行照明区域、替代非线性建模和生产水平验证联系起来。提出了一个两阶段决策分析框架。在第一阶段,应用LDA在同轴环、高环和低环三种照明设置下对可接受和有缺陷的图像特征之间的判别边界和质心进行分类和识别。在第二阶段,使用这些特征训练OLLNN来捕获灰度强度和照明参数之间的非线性依赖关系,然后使用表面响应图来简化最优参数的选择。使用实验IC标记检测数据验证了集成模型,以评估准确性的改进,特别是假阳性率(I型错误)。研究发现,在验证状态下,误报率从5.8%降低到4.6%以下,在不同光照条件下分类准确率显著提高。批量生产后,收率提高到99.6%,无假阳性。集成模型的这一重大发展为智能工厂环境中支持实时学习和改进的AVI参数的自适应、数据驱动控制奠定了基础。
{"title":"Integration of discriminant analysis with Artificial neural networks to decision analytic framework for enhancing automated visual IC inspection accuracy","authors":"Tossapol Kiatcharoenpol,&nbsp;Sakon Klongboonjit","doi":"10.1016/j.eswa.2026.131356","DOIUrl":"10.1016/j.eswa.2026.131356","url":null,"abstract":"<div><div>This study aims to enhance the accuracy and reliability of automated visual inspection (AVI) in semiconductor manufacturing by integrating Linear Discriminant Analysis (LDA) and an Optimization Layer by Layer Neural Network (OLLNN). Unlike prior LDA-ANN hybrid approaches that primarily emphasize classification accuracy, this study formalizes a decision-analytic inspection loop that explicitly links discriminant centroids, feasible lighting regions, surrogate nonlinear modeling, and production level validation. A two-stage decision analytic framework is developed. In the first stage, LDA is applied to classify and identify discriminant boundaries and centroids between acceptable and defective image features under three lighting setups: coaxial ring, high ring, and low ring lights. In the second stage, OLLNN is trained using these features to capture nonlinear dependencies between greyscale intensity and lighting parameters, and then a surface response plot is used to ease the optimal parameter selection. The integrating model is validated using experimental IC marking inspection data to evaluate improvements in accuracy, especially false positive rates (Type I error). It was found that for the validation state, the false positive rates are reduced from 5.8% to below 4.6%, and classification accuracy improves significantly across variable illumination conditions. After implementation in mass production, the yield is increased to 99.6% with zero false positive found. This significant development of the integrating model enhances a foundation for adaptive, data-driven control of AVI parameters in smart factory environments that support real-time learning and improvement.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"311 ","pages":"Article 131356"},"PeriodicalIF":7.5,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190994","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
Label-wise reliability-aware classifier for robust chest X-ray multi-label classification 基于标签的可靠性感知分类器,用于稳健的胸部x线多标签分类
IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-03 DOI: 10.1016/j.eswa.2026.131438
Wenkai Ye, Xichen Ye, Hang Yao, Kequan Yang, Xiaoqiang Li
Chest X-ray (CXR) multi-label classifiers are commonly trained with labels extracted from clinical reports, which are often incomplete and noisy. Under such label noise, we observe that performance degrades severely on tail classes (e.g., rare diseases), because these categories are under-represented and easily overwhelmed by corrupted annotations. As a result, existing methods can misidentify tail classes as noise and downweight their contribution to optimization during training. To address this issue, we propose LRC-CXR (Label-wise Reliability-aware Classifier for Chest X-ray), which calculates per-label reliability and selectively corrects noisy labels, preventing tail classes from being inadvertently under-trained. First, a Medical Description Bank provides lesion-aware textual prompts that guide the visual encoder toward diagnostically relevant patterns. Second, LRC-CXR models per-label reliability with a two-component Gaussian Mixture Model to distinguish clean, inseparable, and noisy labels. Third, only labels identified as noisy are refined via feature-space k-nearest-neighbor smoothing, while clean and inseparable labels are trained with stronger objectives through a hierarchical loss. Experiments on ChestX-ray14, CheXpert, and PadChest, including high-noise stress tests, show that LRC-CXR improves overall AUC/F1 and substantially boosts tail-class recall and robustness under label noise.
胸部x线(CXR)多标签分类器通常使用从临床报告中提取的标签进行训练,这些标签通常是不完整和嘈杂的。在这样的标签噪声下,我们观察到尾部类(例如罕见疾病)的性能严重下降,因为这些类别代表性不足,很容易被损坏的注释淹没。因此,现有的方法可能会错误地将尾类识别为噪声,并在训练过程中降低它们对优化的贡献。为了解决这个问题,我们提出了LRC-CXR(用于胸部x射线的标签可靠性感知分类器),它计算每个标签的可靠性并有选择地纠正噪声标签,防止尾类无意中训练不足。首先,医学描述库提供病变感知文本提示,引导视觉编码器找到诊断相关的模式。其次,LRC-CXR使用双分量高斯混合模型对每个标签的可靠性进行建模,以区分干净、不可分割和有噪声的标签。第三,通过特征空间k近邻平滑,只对被识别为有噪声的标签进行细化,而通过分层损失,用更强的目标训练干净和不可分割的标签。在ChestX-ray14、CheXpert和PadChest上进行的实验(包括高噪声压力测试)表明,LRC-CXR提高了总体AUC/F1,并显著提高了标签噪声下的尾级召回率和鲁棒性。
{"title":"Label-wise reliability-aware classifier for robust chest X-ray multi-label classification","authors":"Wenkai Ye,&nbsp;Xichen Ye,&nbsp;Hang Yao,&nbsp;Kequan Yang,&nbsp;Xiaoqiang Li","doi":"10.1016/j.eswa.2026.131438","DOIUrl":"10.1016/j.eswa.2026.131438","url":null,"abstract":"<div><div>Chest X-ray (CXR) multi-label classifiers are commonly trained with labels extracted from clinical reports, which are often incomplete and noisy. Under such label noise, we observe that performance degrades severely on tail classes (e.g., rare diseases), because these categories are under-represented and easily overwhelmed by corrupted annotations. As a result, existing methods can misidentify tail classes as noise and downweight their contribution to optimization during training. To address this issue, we propose LRC-CXR (<strong>L</strong>abel-wise <strong>R</strong>eliability-aware <strong>C</strong>lassifier for Chest X-ray), which calculates per-label reliability and selectively corrects noisy labels, preventing tail classes from being inadvertently under-trained. First, a Medical Description Bank provides lesion-aware textual prompts that guide the visual encoder toward diagnostically relevant patterns. Second, LRC-CXR models per-label reliability with a two-component Gaussian Mixture Model to distinguish clean, inseparable, and noisy labels. Third, only labels identified as noisy are refined via feature-space k-nearest-neighbor smoothing, while clean and inseparable labels are trained with stronger objectives through a hierarchical loss. Experiments on ChestX-ray14, CheXpert, and PadChest, including high-noise stress tests, show that LRC-CXR improves overall AUC/F1 and substantially boosts tail-class recall and robustness under label noise.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"312 ","pages":"Article 131438"},"PeriodicalIF":7.5,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146192694","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
Select prompting with chain-of-thought paired with large language models 选择与大型语言模型配对的思维链提示
IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-03 DOI: 10.1016/j.eswa.2026.131511
Xun Che , Wenjia Wu , Yadang Chen , Luanjuan Jiang , Qianmu Li
Chain-of-Thought (CoT) prompting has been demonstrated as a powerful tool for enhancing logical reasoning abilities. Among various methods, automatic prompting approaches like Auto-CoT have gained significant attention from researchers. However, existing methods often generate prompts with weak relevance to downstream tasks and overly simplistic content, which hinders the effectiveness of Large Language Models (LLMs) in addressing complex reasoning tasks. To address these limitations, we propose Select-Prompt, a novel automated prompting approach. It includes two key components: (1) an adaptive method for mining difficult samples, which improves task relevance, and (2) a reasoning chain selection strategy, which enhances prompt diversity through answer validation and gradient optimization. The proposed method has been thoroughly tested and validated on six reasoning datasets, encompassing arithmetic, commonsense, and symbolic reasoning tasks. Experimental results demonstrate that Select-Prompt outperforms state-of-the-art methods such as Auto-CoT and Self-Refine, significantly enhancing the accuracy and robustness of LLMs when reasoning through complex tasks.
思维链提示已被证明是提高逻辑推理能力的有力工具。在各种方法中,Auto-CoT等自动提示方法受到了研究人员的极大关注。然而,现有的方法通常生成与下游任务相关性较弱且内容过于简单的提示,这阻碍了大型语言模型(llm)处理复杂推理任务的有效性。为了解决这些限制,我们提出了一种新的自动提示方法——选择提示。它包括两个关键部分:(1)挖掘困难样本的自适应方法,提高任务相关性;(2)推理链选择策略,通过答案验证和梯度优化增强提示多样性。所提出的方法已经在六个推理数据集上进行了彻底的测试和验证,包括算术、常识和符号推理任务。实验结果表明,选择提示优于Auto-CoT和Self-Refine等最先进的方法,显著提高了llm在复杂任务推理时的准确性和鲁棒性。
{"title":"Select prompting with chain-of-thought paired with large language models","authors":"Xun Che ,&nbsp;Wenjia Wu ,&nbsp;Yadang Chen ,&nbsp;Luanjuan Jiang ,&nbsp;Qianmu Li","doi":"10.1016/j.eswa.2026.131511","DOIUrl":"10.1016/j.eswa.2026.131511","url":null,"abstract":"<div><div>Chain-of-Thought (CoT) prompting has been demonstrated as a powerful tool for enhancing logical reasoning abilities. Among various methods, automatic prompting approaches like Auto-CoT have gained significant attention from researchers. However, existing methods often generate prompts with weak relevance to downstream tasks and overly simplistic content, which hinders the effectiveness of Large Language Models (LLMs) in addressing complex reasoning tasks. To address these limitations, we propose Select-Prompt, a novel automated prompting approach. It includes two key components: (1) an adaptive method for mining difficult samples, which improves task relevance, and (2) a reasoning chain selection strategy, which enhances prompt diversity through answer validation and gradient optimization. The proposed method has been thoroughly tested and validated on six reasoning datasets, encompassing arithmetic, commonsense, and symbolic reasoning tasks. Experimental results demonstrate that Select-Prompt outperforms state-of-the-art methods such as Auto-CoT and Self-Refine, significantly enhancing the accuracy and robustness of LLMs when reasoning through complex tasks.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"312 ","pages":"Article 131511"},"PeriodicalIF":7.5,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146192697","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
MagTCN: A multi-scale adaptive graph-enhanced temporal convolutional network for variance-imbalanced multivariate passenger flow forecasting MagTCN:基于多尺度自适应图增强时间卷积网络的方差不平衡多元客流预测
IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-03 DOI: 10.1016/j.eswa.2026.131486
Rui Zhang , Jianyuan Guo , Yong Qin , Limin Jia
Station-level passenger flow prediction is crucial for passenger flow regulation, crew scheduling, and train dispatching. However, existing deep learning models are difficult to apply to intra-station multi-point passenger flow forecasting tasks characterized by multivariate interactions and variance imbalance. To address this, we propose a deep learning model–the Multi-Scale Adaptive Graph-Enhanced Temporal Convolutional Network (MagTCN). The model balances high- and low-variance channels through parallel multi-scale one-dimensional (1-D) convolutions and a squeeze-and-excitation mechanism. Meanwhile, it dynamically constructs temporal graphs using cosine similarity and enhances cross-time-step pattern reuse via a Graph Convolutional Network (GCN), thereby improving predictive robustness under peak-demand scenarios. On this basis, information fusion is performed by a fusion attention layer, and the residual-gated decoder simultaneously generates multi-point, multi-step forecasts within a station in a single forward pass. We evaluate the model’s performance on real station passenger flow data from Guangzhou and Suzhou, China. The experimental results demonstrate that MagTCN outperforms advanced baselines such as iTransformer and TimeMixer, in terms of prediction accuracy across the four prediction horizons, while exhibiting superior stability and channel adaptability.
车站客流预测对客流调控、班组调度和列车调度具有重要意义。然而,现有的深度学习模型难以应用于多变量交互和方差不平衡的车站内多点客流预测任务。为了解决这个问题,我们提出了一种深度学习模型-多尺度自适应图增强时态卷积网络(MagTCN)。该模型通过并行多尺度一维(1-D)卷积和挤压激励机制平衡高方差和低方差通道。同时,利用余弦相似度动态构建时间图,并通过图卷积网络(GCN)增强跨时间步模式重用,从而提高高峰需求场景下的预测鲁棒性。在此基础上,通过融合注意层进行信息融合,残差门控解码器在单次前向通中同时生成站点内的多点、多步预测。我们用广州和苏州的真实车站客流数据来评估模型的性能。实验结果表明,在四个预测层的预测精度方面,MagTCN优于iTransformer和TimeMixer等先进基线,同时具有优越的稳定性和信道适应性。
{"title":"MagTCN: A multi-scale adaptive graph-enhanced temporal convolutional network for variance-imbalanced multivariate passenger flow forecasting","authors":"Rui Zhang ,&nbsp;Jianyuan Guo ,&nbsp;Yong Qin ,&nbsp;Limin Jia","doi":"10.1016/j.eswa.2026.131486","DOIUrl":"10.1016/j.eswa.2026.131486","url":null,"abstract":"<div><div>Station-level passenger flow prediction is crucial for passenger flow regulation, crew scheduling, and train dispatching. However, existing deep learning models are difficult to apply to intra-station multi-point passenger flow forecasting tasks characterized by multivariate interactions and variance imbalance. To address this, we propose a deep learning model–the Multi-Scale Adaptive Graph-Enhanced Temporal Convolutional Network (MagTCN). The model balances high- and low-variance channels through parallel multi-scale one-dimensional (1-D) convolutions and a squeeze-and-excitation mechanism. Meanwhile, it dynamically constructs temporal graphs using cosine similarity and enhances cross-time-step pattern reuse via a Graph Convolutional Network (GCN), thereby improving predictive robustness under peak-demand scenarios. On this basis, information fusion is performed by a fusion attention layer, and the residual-gated decoder simultaneously generates multi-point, multi-step forecasts within a station in a single forward pass. We evaluate the model’s performance on real station passenger flow data from Guangzhou and Suzhou, China. The experimental results demonstrate that MagTCN outperforms advanced baselines such as iTransformer and TimeMixer, in terms of prediction accuracy across the four prediction horizons, while exhibiting superior stability and channel adaptability.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"312 ","pages":"Article 131486"},"PeriodicalIF":7.5,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146192712","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
Shipper-Centric Short-Term Vehicle Capacity Requirement Planning for First-Mile Bulk-Commodity Delivery 以货主为中心的第一英里大宗商品运输短期车辆运力需求规划
IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-03 DOI: 10.1016/j.eswa.2026.131531
Jin-Myeong Jang, Hwa-Joong Kim
This study considers the short-term vehicle capacity requirement planning problem from the shipper’s perspective, driven by the rapidly increasing demand for transporting bulk commodities in first mile logistics. The problem is to determine the types and quantities of vehicles and assign them to regions. The objective is to minimize the total costs associated with transport and additional stop costs. This problem is formulated as a mixed-integer programming model to reflect practical logistics constraints. This proposes two matheuristic algorithms to solve this problem. The relax-and-fix heuristic constructs an initial solution by progressively relaxing and fixing subsets of decision variables, while the fix-and-optimize heuristic improves this solution through iterative local optimization, refixing certain variables. Based on synthetic and real data from a South Korean context, computational experiments show that these proposed algorithms consistently produce acceptable quality solutions within a reasonable computation time. Scenario analyses provide further practical insights for shippers by incorporating real-world operational constraints.
本研究从托运人的角度考虑在第一英里物流中快速增长的大宗商品运输需求驱动下的短期车辆容量需求规划问题。问题是确定车辆的类型和数量,并将它们分配到各个地区。目标是尽量减少与运输和额外停站费用有关的总成本。该问题被表述为一个混合整数规划模型,以反映实际的物流约束。本文提出了两种数学算法来解决这个问题。松弛-修复启发式通过逐步放松和固定决策变量子集来构建初始解,而修复-优化启发式通过迭代局部优化来改进该解,重新固定某些变量。基于来自韩国背景的合成和真实数据,计算实验表明,这些提出的算法在合理的计算时间内始终产生可接受的质量解决方案。场景分析通过结合实际操作约束,为托运人提供了进一步的实际见解。
{"title":"Shipper-Centric Short-Term Vehicle Capacity Requirement Planning for First-Mile Bulk-Commodity Delivery","authors":"Jin-Myeong Jang,&nbsp;Hwa-Joong Kim","doi":"10.1016/j.eswa.2026.131531","DOIUrl":"10.1016/j.eswa.2026.131531","url":null,"abstract":"<div><div>This study considers the short-term vehicle capacity requirement planning problem from the shipper’s perspective, driven by the rapidly increasing demand for transporting bulk commodities in first mile logistics. The problem is to determine the types and quantities of vehicles and assign them to regions. The objective is to minimize the total costs associated with transport and additional stop costs. This problem is formulated as a mixed-integer programming model to reflect practical logistics constraints. This proposes two matheuristic algorithms to solve this problem. The relax-and-fix heuristic constructs an initial solution by progressively relaxing and fixing subsets of decision variables, while the fix-and-optimize heuristic improves this solution through iterative local optimization, refixing certain variables. Based on synthetic and real data from a South Korean context, computational experiments show that these proposed algorithms consistently produce acceptable quality solutions within a reasonable computation time. Scenario analyses provide further practical insights for shippers by incorporating real-world operational constraints.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"312 ","pages":"Article 131531"},"PeriodicalIF":7.5,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146192785","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
EMFNet: Edge-guided multi-scale fusion network for accurate tongue boundary delineation EMFNet:边缘引导的多尺度舌界精确描绘融合网络
IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-03 DOI: 10.1016/j.eswa.2026.131452
Ruitao Ning , Wei Li , Jikun Wang , Zhidong Zhang , Jiuzhang Men , Chenyang Xue
Tongue image semantic segmentation is a critical step in modernizing tongue diagnosis. However, due to similarities in color and texture between the tongue body and non-tongue areas (e.g., lips and facial features), existing segmentation methods suffer from issues when processed to tongue images, including blurred tongue edges and insufficient capture of multi-scale information such as overall shape, local tongue coating distribution, and minute structures like fissures and tooth marks. To address the problem, we proposed an Edge-Guided Multi-Scale Fusion Network (EMFNet) suitable for accurate tongue boundary delineation. First, the model constructs a three-stage edge feature generator (EPE-EAR-EDI) tailored for tongue imaging. Through edge extraction, attention-based refinement, and fusion, it progressively strengthens boundary representations while continuously providing edge guidance during decoding, effectively resolving the issue of blurred tongue body boundaries. Furthermore, a wavelet-enhanced feature selection module (LSWT) was designed to bridge spatial and frequency domain representations. A dynamic selection mechanism (SKFusion) was optimized to adaptively integrate fine tongue texture with global morphological features, thereby enhancing the network’s ability to effectively extract and fuse multi-scale features. Experimental results demonstrated that the proposed method achieved superior segmentation accuracy compared to existing approaches across multiple tongue image datasets, with notable improvements in edge clarity and localization precision. In addition, clinical data collected indicate that the clearer and more continuous tongue boundaries obtained by EMFNet facilitate precise quantification of clinically relevant features, such as tongue color, fissure detection, and the severity of dentation, thereby enhancing the accuracy of subsequent diagnostic evaluations.
舌象语义分割是舌诊现代化的关键步骤。然而,由于舌体与非舌区域(如嘴唇和面部特征)在颜色和纹理上的相似性,现有的分割方法在处理舌头图像时存在一些问题,包括舌头边缘模糊,以及对整体形状、局部舌苔分布、裂隙和牙印等微小结构等多尺度信息的捕捉不足。为了解决这一问题,我们提出了一种适合于精确描绘舌头边界的边缘引导多尺度融合网络(EMFNet)。首先,该模型构建了一个适合舌头成像的三级边缘特征生成器(EPE-EAR-EDI)。通过边缘提取、基于注意力的细化和融合,逐步强化边界表征,同时在解码过程中不断提供边缘引导,有效解决舌体边界模糊问题。此外,设计了一个小波增强特征选择模块(LSWT)来桥接空间域和频域表示。优化动态选择机制(SKFusion),自适应融合精细舌质与全局形态学特征,增强网络有效提取和融合多尺度特征的能力。实验结果表明,该方法在多舌图像数据集上的分割精度优于现有方法,在边缘清晰度和定位精度上均有显著提高。此外,收集的临床数据表明,EMFNet获得的更清晰、更连续的舌界有助于精确量化临床相关特征,如舌色、裂隙检测、牙列严重程度等,从而提高后续诊断评估的准确性。
{"title":"EMFNet: Edge-guided multi-scale fusion network for accurate tongue boundary delineation","authors":"Ruitao Ning ,&nbsp;Wei Li ,&nbsp;Jikun Wang ,&nbsp;Zhidong Zhang ,&nbsp;Jiuzhang Men ,&nbsp;Chenyang Xue","doi":"10.1016/j.eswa.2026.131452","DOIUrl":"10.1016/j.eswa.2026.131452","url":null,"abstract":"<div><div>Tongue image semantic segmentation is a critical step in modernizing tongue diagnosis. However, due to similarities in color and texture between the tongue body and non-tongue areas (e.g., lips and facial features), existing segmentation methods suffer from issues when processed to tongue images, including blurred tongue edges and insufficient capture of multi-scale information such as overall shape, local tongue coating distribution, and minute structures like fissures and tooth marks. To address the problem, we proposed an Edge-Guided Multi-Scale Fusion Network (EMFNet) suitable for accurate tongue boundary delineation. First, the model constructs a three-stage edge feature generator (EPE-EAR-EDI) tailored for tongue imaging. Through edge extraction, attention-based refinement, and fusion, it progressively strengthens boundary representations while continuously providing edge guidance during decoding, effectively resolving the issue of blurred tongue body boundaries. Furthermore, a wavelet-enhanced feature selection module (LSWT) was designed to bridge spatial and frequency domain representations. A dynamic selection mechanism (SKFusion) was optimized to adaptively integrate fine tongue texture with global morphological features, thereby enhancing the network’s ability to effectively extract and fuse multi-scale features. Experimental results demonstrated that the proposed method achieved superior segmentation accuracy compared to existing approaches across multiple tongue image datasets, with notable improvements in edge clarity and localization precision. In addition, clinical data collected indicate that the clearer and more continuous tongue boundaries obtained by EMFNet facilitate precise quantification of clinically relevant features, such as tongue color, fissure detection, and the severity of dentation, thereby enhancing the accuracy of subsequent diagnostic evaluations.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"311 ","pages":"Article 131452"},"PeriodicalIF":7.5,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190900","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 reliable location model for charging piles of automated guided vehicles in the logistics center based on queuing 基于排队的物流中心自动导引车充电桩可靠定位模型
IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-02-03 DOI: 10.1016/j.eswa.2026.131321
Xun Weng , Wenke She , Hongqiang Fan , Jingtian Zhang , Lifen Yun
Automated Guided Vehicles (AGVs) have been widely adopted in logistics centers for their high flexibility and low operating costs. However, the location of charging piles significantly impacts AGVs’ efficiency. Traditional charging piles locations, typically near shelves or at the periphery of logistics centers, often result in extended travel distances for AGVs, thereby reducing their effective working time. To address this issue, a reliable location model is proposed that balances travel cost, charging queuing cost, and construction cost of charging piles. The model incorporates three critical factors: queuing of AGVs, failure risk of charging piles, and the busyness degree of different areas within the logistics center. We develop two tailored solution methods to solve the proposed model. The first is a Lagrangian relaxation algorithm. The second is a customized immune algorithm, to efficiently explore approximate solutions for large-scale problems. Numerical experiments of varying scales validate the applicability of the proposed model and the performance of the proposed algorithms. The results indicate that the Lagrangian relaxation algorithm performs exceptionally well for small to medium-scale problems, while the customized immune algorithm is more suitable for large-scale scenarios. Furthermore, sensitivity analysis provides valuable insights into the design of charging pile locations, including the effectiveness of a reliable location design against queuing, failure risk, and busyness degree. The findings underscore the importance of a reliable location design in enhancing AGV operational efficiency and reducing costs.
自动导引车(agv)以其高灵活性和低运行成本在物流中心得到广泛应用。然而,充电桩的位置对agv的效率影响很大。传统的充电桩位置通常在货架附近或物流中心的外围,这往往导致agv的行驶距离延长,从而减少了其有效工作时间。为了解决这一问题,提出了一种平衡出行成本、充电排队成本和充电桩建设成本的可靠选址模型。该模型考虑了三个关键因素:agv排队、充电桩失效风险、物流中心内不同区域的繁忙程度。我们开发了两种定制的解决方法来解决所提出的模型。第一个是拉格朗日松弛算法。二是自定义免疫算法,用于高效地探索大规模问题的近似解。不同尺度的数值实验验证了该模型的适用性和算法的有效性。结果表明,拉格朗日松弛算法在中小型问题中表现优异,而自定义免疫算法更适合于大规模场景。此外,灵敏度分析为充电桩位置设计提供了有价值的见解,包括可靠的位置设计对排队、故障风险和繁忙程度的有效性。研究结果强调了可靠的定位设计在提高AGV运行效率和降低成本方面的重要性。
{"title":"A reliable location model for charging piles of automated guided vehicles in the logistics center based on queuing","authors":"Xun Weng ,&nbsp;Wenke She ,&nbsp;Hongqiang Fan ,&nbsp;Jingtian Zhang ,&nbsp;Lifen Yun","doi":"10.1016/j.eswa.2026.131321","DOIUrl":"10.1016/j.eswa.2026.131321","url":null,"abstract":"<div><div>Automated Guided Vehicles (AGVs) have been widely adopted in logistics centers for their high flexibility and low operating costs. However, the location of charging piles significantly impacts AGVs’ efficiency. Traditional charging piles locations, typically near shelves or at the periphery of logistics centers, often result in extended travel distances for AGVs, thereby reducing their effective working time. To address this issue, a reliable location model is proposed that balances travel cost, charging queuing cost, and construction cost of charging piles. The model incorporates three critical factors: queuing of AGVs, failure risk of charging piles, and the busyness degree of different areas within the logistics center. We develop two tailored solution methods to solve the proposed model. The first is a Lagrangian relaxation algorithm. The second is a customized immune algorithm, to efficiently explore approximate solutions for large-scale problems. Numerical experiments of varying scales validate the applicability of the proposed model and the performance of the proposed algorithms. The results indicate that the Lagrangian relaxation algorithm performs exceptionally well for small to medium-scale problems, while the customized immune algorithm is more suitable for large-scale scenarios. Furthermore, sensitivity analysis provides valuable insights into the design of charging pile locations, including the effectiveness of a reliable location design against queuing, failure risk, and busyness degree. The findings underscore the importance of a reliable location design in enhancing AGV operational efficiency and reducing costs.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"311 ","pages":"Article 131321"},"PeriodicalIF":7.5,"publicationDate":"2026-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146191356","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
期刊
Expert Systems with Applications
全部 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1