首页 > 最新文献
paperpass

Applied Soft Computing最新文献

英文 中文
Spectrum sparsity-driven learnable wavelet packet transform for denoising and its application in fault diagnosis 谱稀疏驱动的可学习小波包去噪及其在故障诊断中的应用
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-25 DOI: 10.1016/j.asoc.2026.114713
Xin Kang, Jianxin Cui, Junsheng Cheng, Yu Yang, Qiyao Liu
Domain-specific noise is a key cause of cross-domain data distribution shifts and a major obstacle in cross-domain fault diagnosis. Most existing denoising methods are built on the assumptions that noise is weak and Gaussian, which often do not hold in the industrial context, thus limiting their effectiveness. To address this, we propose a spectrum sparsity-driven learnable wavelet packet transform (SSLWPT) model for unsupervised, small-sample mechanical signal denoising and feature enhancement. First, based on the vibration properties of rotating machinery, where stationary and cyclostationary components carry critical health-related information, we propose a spectrum sparsity-driven mechanism to actively capture these components for adaptive feature enhancement. Next, an autoencoder mimicking wavelet packet decomposition and reconstruction is proposed, with learnable wavelet bases and denoising parameters. Under the joint constraints of reconstruction loss, parameter regularization, and spectrum sparsity loss, the model achieves effective signal denoising. We further integrate the proposed SSLWPT as a preprocessing tool into a two-stage framework for cross-domain fault diagnosis. Both theoretical analysis and experimental results validate the superiority of the proposed model in denoising. Moreover, cross-domain diagnosis experiments conducted on bearing, gear and motor datasets confirm that our method achieves significantly better generalization than related denoising methods and SOTA domain generalization methods.
域特异性噪声是导致数据跨域分布偏移的主要原因,也是跨域故障诊断的主要障碍。大多数现有的去噪方法都是建立在假设噪声是弱的和高斯的基础上的,这在工业环境中往往不成立,从而限制了它们的有效性。为了解决这个问题,我们提出了一个频谱稀疏驱动的可学习小波包变换(SSLWPT)模型,用于无监督、小样本机械信号去噪和特征增强。首先,基于旋转机械的振动特性,其中静止和循环静止组件携带关键的健康相关信息,我们提出了一种频谱稀疏驱动机制来主动捕获这些组件以进行自适应特征增强。其次,提出了一种模拟小波包分解和重构的自编码器,具有可学习的小波基和去噪参数。在重构损失、参数正则化和频谱稀疏性损失的共同约束下,该模型实现了有效的信号去噪。我们进一步将提出的SSLWPT作为预处理工具集成到跨域故障诊断的两阶段框架中。理论分析和实验结果都验证了该模型在去噪方面的优越性。此外,在轴承、齿轮和电机数据集上进行的跨域诊断实验证实,我们的方法的泛化效果明显优于相关的去噪方法和SOTA域泛化方法。
{"title":"Spectrum sparsity-driven learnable wavelet packet transform for denoising and its application in fault diagnosis","authors":"Xin Kang,&nbsp;Jianxin Cui,&nbsp;Junsheng Cheng,&nbsp;Yu Yang,&nbsp;Qiyao Liu","doi":"10.1016/j.asoc.2026.114713","DOIUrl":"10.1016/j.asoc.2026.114713","url":null,"abstract":"<div><div>Domain-specific noise is a key cause of cross-domain data distribution shifts and a major obstacle in cross-domain fault diagnosis. Most existing denoising methods are built on the assumptions that noise is weak and Gaussian, which often do not hold in the industrial context, thus limiting their effectiveness. To address this, we propose a spectrum sparsity-driven learnable wavelet packet transform (SSLWPT) model for unsupervised, small-sample mechanical signal denoising and feature enhancement. First, based on the vibration properties of rotating machinery, where stationary and cyclostationary components carry critical health-related information, we propose a spectrum sparsity-driven mechanism to actively capture these components for adaptive feature enhancement. Next, an autoencoder mimicking wavelet packet decomposition and reconstruction is proposed, with learnable wavelet bases and denoising parameters. Under the joint constraints of reconstruction loss, parameter regularization, and spectrum sparsity loss, the model achieves effective signal denoising. We further integrate the proposed SSLWPT as a preprocessing tool into a two-stage framework for cross-domain fault diagnosis. Both theoretical analysis and experimental results validate the superiority of the proposed model in denoising. Moreover, cross-domain diagnosis experiments conducted on bearing, gear and motor datasets confirm that our method achieves significantly better generalization than related denoising methods and SOTA domain generalization methods.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114713"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146080107","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
Shopping recommendation algorithm based on knowledge graph and dynamic association graph model 基于知识图和动态关联图模型的购物推荐算法
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-10 DOI: 10.1016/j.asoc.2026.114636
Li Gao, Shenglong Yang, Dunlu Peng, Hongjun Li
With the maturation of deep learning and big data technologies, the application of recommendation algorithms can help e-commerce platforms acquire new users and enhance conversion rates. This paper proposes a novel e-commerce recommendation algorithm, which is based on a combination model of knowledge graphs and dynamic association graphs and is designed in two stages, In the offline stage: Firstly, a knowledge graph attention network is built based on the features of product attributes and consumers’ historical shopping behavior, thereby obtaining key feature attributes of the products. Secondly, a dynamic association graph network is built by connecting the consumer behavior sequence with a dynamic graph structure, and key features of the selection behavior are obtained successively through a Graph Convolutional Neural Network (GCN), a Gated Recurrent Unit (GRU), and an attention mechanism. Thirdly, the output features are fused to generate a recommendation list, and the algorithm records the consumer’s shopping path, updates the database and dynamic association graph, and can automatically adjust according to the shopping path. Experiments on three Amazon datasets demonstrate that the algorithm exhibits superior recommendation performance and robustness in actual shopping scenarios with complex association features.
随着深度学习和大数据技术的成熟,推荐算法的应用可以帮助电商平台获得新的用户,提高转化率。本文提出了一种新的电子商务推荐算法,该算法基于知识图和动态关联图的组合模型,分两个阶段进行设计:在离线阶段:首先,根据产品属性特征和消费者历史购物行为构建知识图关注网络,从而获得产品的关键特征属性;其次,将消费者行为序列与动态图结构连接起来,构建动态关联图网络,并通过图卷积神经网络(GCN)、门控循环单元(GRU)和注意机制依次获得选择行为的关键特征;再次,将输出的特征融合生成推荐列表,算法记录消费者的购物路径,更新数据库和动态关联图,并根据购物路径进行自动调整。在三个Amazon数据集上的实验表明,该算法在具有复杂关联特征的实际购物场景中表现出优异的推荐性能和鲁棒性。
{"title":"Shopping recommendation algorithm based on knowledge graph and dynamic association graph model","authors":"Li Gao,&nbsp;Shenglong Yang,&nbsp;Dunlu Peng,&nbsp;Hongjun Li","doi":"10.1016/j.asoc.2026.114636","DOIUrl":"10.1016/j.asoc.2026.114636","url":null,"abstract":"<div><div>With the maturation of deep learning and big data technologies, the application of recommendation algorithms can help e-commerce platforms acquire new users and enhance conversion rates. This paper proposes a novel e-commerce recommendation algorithm, which is based on a combination model of knowledge graphs and dynamic association graphs and is designed in two stages, In the offline stage: Firstly, a knowledge graph attention network is built based on the features of product attributes and consumers’ historical shopping behavior, thereby obtaining key feature attributes of the products. Secondly, a dynamic association graph network is built by connecting the consumer behavior sequence with a dynamic graph structure, and key features of the selection behavior are obtained successively through a Graph Convolutional Neural Network (GCN), a Gated Recurrent Unit (GRU), and an attention mechanism. Thirdly, the output features are fused to generate a recommendation list, and the algorithm records the consumer’s shopping path, updates the database and dynamic association graph, and can automatically adjust according to the shopping path. Experiments on three Amazon datasets demonstrate that the algorithm exhibits superior recommendation performance and robustness in actual shopping scenarios with complex association features.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114636"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146080108","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
Green AI driven quantile boosting ensembles for sustainable real estate valuation 绿色人工智能驱动的可持续房地产估值分位数提升组合
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-29 DOI: 10.1016/j.asoc.2026.114616
Muhammet Ali Kadıoğlu , Mehmet Yavuz Yağcı
In today’s volatile economic environment, the accurate estimation of apartment prices is crucial for maintaining financial predictability. Nevertheless, the development of high-performing artificial intelligence (AI) models often entails substantial computational costs, which, in turn, raise critical concerns regarding environmental sustainability, economic viability, and equitable accessibility. This study addresses these challenges by proposing a comprehensive, energy-efficient framework for real estate price estimation grounded in the principles of Green AI. Utilizing a dataset of over 13 million geolocated listings in Turkey (January 2018–September 2024), we implement an end-to-end machine learning pipeline, including data preparation, outlier detection, quantile-based ensemble modeling, hyperparameter tuning using Optuna, and model evaluation. The performance of models—LightGBM, Gradient Boosting Regressor, XGBoost, and Random Forest—is assessed through a dual lens of estimation accuracy and environmental efficiency, incorporating metrics such as training time, energy consumption, and prediction latency. Results show that LightGBM offers the best balance between accuracy and resource efficiency, making it the recommended baseline for large-scale or real-time valuation systems, while GBR and XGBoost may be used in R&D settings under energy constraints. The paper also highlights the importance of integrating dynamic market indicators and climate risk variables to enhance model robustness and sustainability. Overall, this research advances a holistic framework for responsible and scalable real estate valuation, contributing to the growing field of sustainable AI deployment in high-impact sectors.
在当今动荡的经济环境中,准确估计公寓价格对于保持财务可预测性至关重要。然而,高性能人工智能(AI)模型的开发往往需要大量的计算成本,这反过来又引发了对环境可持续性、经济可行性和公平可及性的关键担忧。本研究通过提出一个基于绿色人工智能原则的全面、节能的房地产价格估算框架来解决这些挑战。利用土耳其超过1300万个地理位置列表的数据集(2018年1月至2024年9月),我们实现了端到端的机器学习管道,包括数据准备、异常值检测、基于分位数的集成建模、使用Optuna进行超参数调优和模型评估。lightgbm、Gradient Boosting Regressor、XGBoost和Random forest等模型的性能通过估计精度和环境效率的双重视角进行评估,并结合训练时间、能耗和预测延迟等指标。结果表明,LightGBM在准确性和资源效率之间提供了最佳平衡,使其成为大规模或实时评估系统的推荐基准,而GBR和XGBoost可用于能源限制的研发环境。本文还强调了整合动态市场指标和气候风险变量以增强模型稳健性和可持续性的重要性。总体而言,本研究提出了一个负责任和可扩展的房地产估值的整体框架,有助于在高影响力行业中可持续部署人工智能。
{"title":"Green AI driven quantile boosting ensembles for sustainable real estate valuation","authors":"Muhammet Ali Kadıoğlu ,&nbsp;Mehmet Yavuz Yağcı","doi":"10.1016/j.asoc.2026.114616","DOIUrl":"10.1016/j.asoc.2026.114616","url":null,"abstract":"<div><div>In today’s volatile economic environment, the accurate estimation of apartment prices is crucial for maintaining financial predictability. Nevertheless, the development of high-performing artificial intelligence (AI) models often entails substantial computational costs, which, in turn, raise critical concerns regarding environmental sustainability, economic viability, and equitable accessibility. This study addresses these challenges by proposing a comprehensive, energy-efficient framework for real estate price estimation grounded in the principles of Green AI. Utilizing a dataset of over 13 million geolocated listings in Turkey (January 2018–September 2024), we implement an end-to-end machine learning pipeline, including data preparation, outlier detection, quantile-based ensemble modeling, hyperparameter tuning using Optuna, and model evaluation. The performance of models—LightGBM, Gradient Boosting Regressor, XGBoost, and Random Forest—is assessed through a dual lens of estimation accuracy and environmental efficiency, incorporating metrics such as training time, energy consumption, and prediction latency. Results show that LightGBM offers the best balance between accuracy and resource efficiency, making it the recommended baseline for large-scale or real-time valuation systems, while GBR and XGBoost may be used in R&amp;D settings under energy constraints. The paper also highlights the importance of integrating dynamic market indicators and climate risk variables to enhance model robustness and sustainability. Overall, this research advances a holistic framework for responsible and scalable real estate valuation, contributing to the growing field of sustainable AI deployment in high-impact sectors.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114616"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146080297","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
Dual-path prompt-enhanced semi-supervised segmentation for retinal vessel quantification in OCTA imaging OCTA成像中视网膜血管定量的双路径快速增强半监督分割
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-02-05 DOI: 10.1016/j.asoc.2026.114778
Yuemei Luo , Yuan Li , Lei Tao , Jun Xu , Linbo Liu
Retinal vascular analysis plays a vital role in the early detection and management of ocular diseases, which remain a significant global health challenge. Optical Coherence Tomography Angiography (OCTA) provides non-invasive, dye-free, high-resolution visualization of retinal microvasculature, yet accurate segmentation of vascular structures—particularly large vessels—remains difficult due to noise, depth variability, and the scarcity of annotated data. To address the need for efficient vessel segmentation under limited annotation, this paper proposes a semi-supervised learning framework based on a dual-path Segment Anything Model (SAM), tailored for large vessel segmentation in OCTA images. The framework incorporates the following innovations: (1) Dual-decoder collaborative training, which integrates prompt-based and prompt-free segmentation to improve generalization from minimal labeled data; (2) Cross-prompt strategy, which establishes bidirectional guidance between dual decoder branches using pseudo-prompt points derived from unlabeled data; and (3) Prompt consistency regularization, which enforces output stability under varying spatial prompts, mitigating the sensitivity of segmentation results to prompt locations. A hybrid point sampling scheme—combining center and random points—further improves prompt reliability. Evaluated on the OCTA-500 dataset using only 5% labeled samples, the proposed framework achieves Dice scores of 0.9134 and 0.8924 at 3 mm and 6 mm scan depths, respectively, surpassing existing semi-supervised methods. These results demonstrate the method’s effectiveness, robustness, and potential for scalable, annotation-efficient retinal image analysis in clinical practice.
视网膜血管分析在眼部疾病的早期发现和管理中起着至关重要的作用,这仍然是一个重大的全球健康挑战。光学相干断层扫描血管造影(OCTA)提供了无创、无染料、高分辨率的视网膜微血管可视化,但由于噪声、深度变化和注释数据的缺乏,血管结构的准确分割(特别是大血管)仍然很困难。为了解决在有限标注下高效分割血管的需求,本文提出了一种基于双路径任意分割模型(SAM)的半监督学习框架,为OCTA图像中的大型血管分割量身定制。该框架包含以下创新:(1)双解码器协同训练,集成了基于提示和无提示的分割,以提高最小标记数据的泛化;(2)交叉提示策略,利用从未标记数据中得到的伪提示点,在双解码器分支之间建立双向引导;(3)提示一致性正则化,增强了在不同空间提示下的输出稳定性,降低了分割结果对提示位置的敏感性。采用中心点和随机点相结合的混合点采样方案,进一步提高了提示的可靠性。在OCTA-500数据集上仅使用5%的标记样本进行评估,所提出的框架在3 mm和6 mm扫描深度分别获得0.9134和0.8924的Dice分数,超过了现有的半监督方法。这些结果证明了该方法的有效性,鲁棒性,以及在临床实践中可扩展,注释高效的视网膜图像分析的潜力。
{"title":"Dual-path prompt-enhanced semi-supervised segmentation for retinal vessel quantification in OCTA imaging","authors":"Yuemei Luo ,&nbsp;Yuan Li ,&nbsp;Lei Tao ,&nbsp;Jun Xu ,&nbsp;Linbo Liu","doi":"10.1016/j.asoc.2026.114778","DOIUrl":"10.1016/j.asoc.2026.114778","url":null,"abstract":"<div><div>Retinal vascular analysis plays a vital role in the early detection and management of ocular diseases, which remain a significant global health challenge. Optical Coherence Tomography Angiography (OCTA) provides non-invasive, dye-free, high-resolution visualization of retinal microvasculature, yet accurate segmentation of vascular structures—particularly large vessels—remains difficult due to noise, depth variability, and the scarcity of annotated data. To address the need for efficient vessel segmentation under limited annotation, this paper proposes a semi-supervised learning framework based on a dual-path Segment Anything Model (SAM), tailored for large vessel segmentation in OCTA images. The framework incorporates the following innovations: (1) Dual-decoder collaborative training, which integrates prompt-based and prompt-free segmentation to improve generalization from minimal labeled data; (2) Cross-prompt strategy, which establishes bidirectional guidance between dual decoder branches using pseudo-prompt points derived from unlabeled data; and (3) Prompt consistency regularization, which enforces output stability under varying spatial prompts, mitigating the sensitivity of segmentation results to prompt locations. A hybrid point sampling scheme—combining center and random points—further improves prompt reliability. Evaluated on the OCTA-500 dataset using only 5% labeled samples, the proposed framework achieves Dice scores of 0.9134 and 0.8924 at 3 mm and 6 mm scan depths, respectively, surpassing existing semi-supervised methods. These results demonstrate the method’s effectiveness, robustness, and potential for scalable, annotation-efficient retinal image analysis in clinical practice.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"192 ","pages":"Article 114778"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146191886","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
Enhanced direction-aware ant colony optimization for smooth mobile robot path planning in complex environments 基于方向感知蚁群优化的复杂环境下平滑移动机器人路径规划
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-02-05 DOI: 10.1016/j.asoc.2026.114782
Zimin Xu , Yanying Chen , Lin Lin , Jinyan Huang , Guoli Wang
Global path planning is a core problem in mobile robotics, aiming to generate collision-free trajectories that are not only short but also smooth and suitable for real-world deployment. Although Ant Colony Optimization (ACO) has been widely applied due to its population-based global search capability, its standard formulation still suffers from inherent limitations in complex environments. Heuristic information solely based on distance to the goal, together with uniformly initialized pheromone trails, provides weak global directional guidance in the early search stage, leading to largely unguided exploration. Moreover, the conventional state transition rule does not explicitly penalize sharp direction changes, often producing zigzag paths with excessive turning, while homogeneous pheromone updating slows the emergence of high-quality solutions and delays convergence. To address these issues, this paper proposes a direction-aware ant colony optimization (DAACO) framework, which integrates four complementary mechanisms in a unified manner. Specifically, an enhanced heuristic function combines distance information with global and local directional consistency to strengthen goal-oriented guidance. A directional pheromone initialization mechanism embeds estimated path cost and directional alignment into the initial pheromone distribution to reduce early-stage randomness. A dynamic smooth state transition model incorporates an angle-based smoothing factor together with an adaptive pseudo-random selection scheme to promote path continuity. Finally, a heterogeneous pheromone update strategy differentiates reinforcement according to path quality and emphasizes elite solutions to improve convergence stability. Extensive simulations on simple, complex, and large-scale grid environments demonstrate that DAACO consistently outperforms the standard ACO and several state-of-the-art ACO variants. Compared with standard ACO, DAACO achieves average reductions of 5.02%–44.12% in path length, 43.75%–81.08% in the number of turns, and 86.07%–98.14% in convergence iterations across different scenarios, confirming its effectiveness and robustness for smooth mobile robot path planning in complex environments.
全局路径规划是移动机器人的核心问题,其目标是生成既短又平滑、适合实际部署的无碰撞轨迹。蚁群算法(Ant Colony Optimization, ACO)由于其基于群体的全局搜索能力而得到了广泛的应用,但其标准制定在复杂环境下仍然存在固有的局限性。仅基于目标距离的启发式信息,以及统一初始化的信息素轨迹,在搜索早期提供了弱的全局定向指导,导致大量无导向的探索。此外,传统的状态转移规则没有明确地惩罚急剧的方向变化,通常会产生带有过度转弯的之字形路径,而同质信息素更新减慢了高质量解的出现并延迟了收敛。为了解决这些问题,本文提出了一个方向感知蚁群优化(DAACO)框架,该框架统一集成了四种互补机制。具体来说,一种增强的启发式函数将距离信息与全局和局部方向一致性相结合,以加强目标导向。定向信息素初始化机制将估计的路径成本和定向对齐嵌入到初始信息素分布中,以减少早期的随机性。动态平滑状态转移模型采用基于角度的平滑因子和自适应伪随机选择方案来提高路径连续性。最后,异质信息素更新策略根据路径质量区分强化,并强调精英解决方案,以提高收敛稳定性。对简单、复杂和大规模网格环境的广泛模拟表明,DAACO始终优于标准蚁群算法和几种最先进的蚁群算法变体。与标准蚁群算法相比,DAACO在不同场景下的路径长度平均减少5.02% ~ 44.12%,回合数平均减少43.75% ~ 81.08%,收敛迭代平均减少86.07% ~ 98.14%,验证了其在复杂环境下平滑移动机器人路径规划的有效性和鲁棒性。
{"title":"Enhanced direction-aware ant colony optimization for smooth mobile robot path planning in complex environments","authors":"Zimin Xu ,&nbsp;Yanying Chen ,&nbsp;Lin Lin ,&nbsp;Jinyan Huang ,&nbsp;Guoli Wang","doi":"10.1016/j.asoc.2026.114782","DOIUrl":"10.1016/j.asoc.2026.114782","url":null,"abstract":"<div><div>Global path planning is a core problem in mobile robotics, aiming to generate collision-free trajectories that are not only short but also smooth and suitable for real-world deployment. Although Ant Colony Optimization (ACO) has been widely applied due to its population-based global search capability, its standard formulation still suffers from inherent limitations in complex environments. Heuristic information solely based on distance to the goal, together with uniformly initialized pheromone trails, provides weak global directional guidance in the early search stage, leading to largely unguided exploration. Moreover, the conventional state transition rule does not explicitly penalize sharp direction changes, often producing zigzag paths with excessive turning, while homogeneous pheromone updating slows the emergence of high-quality solutions and delays convergence. To address these issues, this paper proposes a direction-aware ant colony optimization (DAACO) framework, which integrates four complementary mechanisms in a unified manner. Specifically, an enhanced heuristic function combines distance information with global and local directional consistency to strengthen goal-oriented guidance. A directional pheromone initialization mechanism embeds estimated path cost and directional alignment into the initial pheromone distribution to reduce early-stage randomness. A dynamic smooth state transition model incorporates an angle-based smoothing factor together with an adaptive pseudo-random selection scheme to promote path continuity. Finally, a heterogeneous pheromone update strategy differentiates reinforcement according to path quality and emphasizes elite solutions to improve convergence stability. Extensive simulations on simple, complex, and large-scale grid environments demonstrate that DAACO consistently outperforms the standard ACO and several state-of-the-art ACO variants. Compared with standard ACO, DAACO achieves average reductions of 5.02%–44.12% in path length, 43.75%–81.08% in the number of turns, and 86.07%–98.14% in convergence iterations across different scenarios, confirming its effectiveness and robustness for smooth mobile robot path planning in complex environments.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"192 ","pages":"Article 114782"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146191883","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
Lightweight-oriented classification using distillation learning and spatial information from tabular data 基于蒸馏学习和表格数据空间信息的轻量化分类
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-02-07 DOI: 10.1016/j.asoc.2026.114798
Minh-Trieu Tran , Patrizio Pelliccione , Phuong T. Nguyen
Spatial information, along with deep learning approaches, plays a crucial role in classification tasks. However, tabular datasets do not inherently contain spatial information, so researchers often focus primarily on traditional machine learning algorithms or DNNs for simplicity. Thus, these methods cannot fully utilize all the information in tabular data because they are unable to mine spatial (2D) information. Additionally, while deep learning, particularly convolutional neural networks (CNNs), can handle spatial information effectively, it requires significant computational resources to achieve high performance. In this paper, we present a new method, named ESATTO (Efficient Synthetic Spatial Awareness for Tabular daTa classificatiOn), which uses distillation learning and is able to extract spatial features in an efficient way. The proposed model is 27 times smaller in size and has 50 times fewer parameters than standard models, making it highly efficient for resource-limited environments. This lightweight model is particularly beneficial to real-world applications, such as precision agriculture, where computational resources are constrained. The validation shows that our model outperforms in wine quality prediction and performs strongly on medical data, highlighting its versatility for various tasks. The code is available at https://github.com/tmtgssi/ESATTO.
空间信息和深度学习方法在分类任务中起着至关重要的作用。然而,表格数据集本身并不包含空间信息,因此为了简单起见,研究人员通常主要关注传统的机器学习算法或dnn。因此,这些方法不能充分利用表格数据中的所有信息,因为它们不能挖掘空间(2D)信息。此外,虽然深度学习,特别是卷积神经网络(cnn)可以有效地处理空间信息,但它需要大量的计算资源来实现高性能。本文提出了一种新的方法——ESATTO (Efficient Synthetic Spatial Awareness for Tabular daTa classificatiOn),该方法利用蒸馏学习,能够有效地提取空间特征。该模型的尺寸比标准模型小27倍,参数比标准模型少50倍,使其在资源有限的环境中非常高效。这种轻量级模型对实际应用程序特别有用,例如计算资源受限的精准农业。验证表明,我们的模型在葡萄酒质量预测方面表现出色,在医疗数据方面表现出色,突出了其在各种任务中的通用性。代码可在https://github.com/tmtgssi/ESATTO上获得。
{"title":"Lightweight-oriented classification using distillation learning and spatial information from tabular data","authors":"Minh-Trieu Tran ,&nbsp;Patrizio Pelliccione ,&nbsp;Phuong T. Nguyen","doi":"10.1016/j.asoc.2026.114798","DOIUrl":"10.1016/j.asoc.2026.114798","url":null,"abstract":"<div><div>Spatial information, along with deep learning approaches, plays a crucial role in classification tasks. However, tabular datasets do not inherently contain spatial information, so researchers often focus primarily on traditional machine learning algorithms or DNNs for simplicity. Thus, these methods cannot fully utilize all the information in tabular data because they are unable to mine spatial (2D) information. Additionally, while deep learning, particularly convolutional neural networks (CNNs), can handle spatial information effectively, it requires significant computational resources to achieve high performance. In this paper, we present a new method, named ESATTO (Efficient Synthetic Spatial Awareness for Tabular daTa classificatiOn), which uses distillation learning and is able to extract spatial features in an efficient way. The proposed model is 27 times smaller in size and has 50 times fewer parameters than standard models, making it highly efficient for resource-limited environments. This lightweight model is particularly beneficial to real-world applications, such as precision agriculture, where computational resources are constrained. The validation shows that our model outperforms in wine quality prediction and performs strongly on medical data, highlighting its versatility for various tasks. The code is available at <span><span>https://github.com/tmtgssi/ESATTO</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"192 ","pages":"Article 114798"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146191880","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
Frequency hopping synchronization for satellite communication system using reinforcement learning 基于强化学习的卫星通信系统跳频同步
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-19 DOI: 10.1016/j.asoc.2026.114648
Sangkeum Lee
Satellite communication systems (SCSs) deployed in tactical environments must maintain reliable links under severe interference, jamming attempts, and large path loss. From a soft computing perspective, frequency-hopping (FH) synchronization in such uncertain and highly dynamic channels is a sequential decision problem that benefits from adaptive, data-driven control. In this paper, we propose a reinforcement learning (RL)–driven FH synchronization framework for dehop–rehop SCSs, where a conventional serial search performs coarse acquisition and a proximal policy optimization (PPO) agent with a GCN–Bi-LSTM network refines the uplink hop timing. The RL agent interacts with the stochastic channel, observing signal-energy patterns and learning to minimize both mean acquisition time (MAT) and mean-squared error (MSE) of the timing estimate without requiring an explicit channel model. Mathematical analysis and Monte Carlo simulations show that the proposed hybrid method reduces the average number of hops required for synchronization by 58.17 % and the MSE of uplink hop-timing estimation by 76.95 % compared with a conventional serial-search scheme. Relative to an early–late-gate synchronization method that combines serial search with an LSTM network, the average number of hops is further reduced by 12.24 % and the MSE by 18.5 %. These results demonstrate that the PPO-based GCN–Bi-LSTM agent provides a flexible soft-computing solution that can adapt to rapidly varying SCS operating conditions while significantly improving FH synchronization performance.
部署在战术环境中的卫星通信系统(scs)必须在严重干扰、干扰企图和大路径损失下保持可靠的链路。从软计算的角度来看,在这种不确定和高度动态的信道中,跳频(FH)同步是一个顺序决策问题,它受益于自适应的数据驱动控制。在本文中,我们提出了一种用于脱跳-重跳的强化学习(RL)驱动的跳频同步框架,其中传统的串行搜索执行粗采集,而具有GCN-Bi-LSTM网络的近端策略优化(PPO)代理细化上行跳定时。RL代理与随机信道相互作用,观察信号能量模式并学习最小化定时估计的平均采集时间(MAT)和均方误差(MSE),而不需要显式信道模型。数学分析和蒙特卡罗仿真表明,与传统的串行搜索方案相比,该方法同步所需的平均跳数减少了58.17 %,上行跳时估计的MSE减少了76.95 %。相对于将串行搜索与LSTM网络相结合的早-晚门同步方法,平均跳数进一步减少了12.24 %,MSE进一步减少了18.5 %。这些结果表明,基于ppo的GCN-Bi-LSTM代理提供了一种灵活的软计算解决方案,可以适应快速变化的SCS操作条件,同时显著提高跳频同步性能。
{"title":"Frequency hopping synchronization for satellite communication system using reinforcement learning","authors":"Sangkeum Lee","doi":"10.1016/j.asoc.2026.114648","DOIUrl":"10.1016/j.asoc.2026.114648","url":null,"abstract":"<div><div>Satellite communication systems (SCSs) deployed in tactical environments must maintain reliable links under severe interference, jamming attempts, and large path loss. From a soft computing perspective, frequency-hopping (FH) synchronization in such uncertain and highly dynamic channels is a sequential decision problem that benefits from adaptive, data-driven control. In this paper, we propose a reinforcement learning (RL)–driven FH synchronization framework for dehop–rehop SCSs, where a conventional serial search performs coarse acquisition and a proximal policy optimization (PPO) agent with a GCN–Bi-LSTM network refines the uplink hop timing. The RL agent interacts with the stochastic channel, observing signal-energy patterns and learning to minimize both mean acquisition time (MAT) and mean-squared error (MSE) of the timing estimate without requiring an explicit channel model. Mathematical analysis and Monte Carlo simulations show that the proposed hybrid method reduces the average number of hops required for synchronization by 58.17 % and the MSE of uplink hop-timing estimation by 76.95 % compared with a conventional serial-search scheme. Relative to an early–late-gate synchronization method that combines serial search with an LSTM network, the average number of hops is further reduced by 12.24 % and the MSE by 18.5 %. These results demonstrate that the PPO-based GCN–Bi-LSTM agent provides a flexible soft-computing solution that can adapt to rapidly varying SCS operating conditions while significantly improving FH synchronization performance.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114648"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039727","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
Accurate solution of high-dimensional partial differential equations: Research on data-physics collaborative modeling and adaptive sampling 高维偏微分方程的精确解:数据物理协同建模与自适应采样研究
IF 6.6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2026-04-01 Epub Date: 2026-01-13 DOI: 10.1016/j.asoc.2025.114472
Haoran Du , Zhao Liu , Ping Zhu
Solving high-dimensional partial differential equations (PDEs) remains a fundamental challenge in modeling complex systems in science and engineering. Traditional methods often suffer from significant accuracy limitations due to the "curse of dimensionality." In this work, we propose a bidirectionally coupled data-physics collaborative modeling framework that integrates a Variational Autoencoder (VAE) with a Physics-Informed Neural Network (PINN), significantly improves the solution accuracy of high-dimensional PDEs. On the data-driven side, the VAE compresses high-dimensional data into a latent space to extract essential features; on the physics-constrained side, the PINN embeds physical priors via residual minimization, achieving deep integration of physical laws and data representations. Building upon this, we introduce a dynamically enhanced version, VAE-PINN-DS, which employs an adaptive sampling strategy to allocate computational resources to regions with high residual gradients, low latent-space density, and high uncertainty. Numerical experiments demonstrate the effectiveness of VAE-PINN-DS in solving the Poisson equation (5D–15D), non-uniform elliptic equation (10D), and the 20-dimensional Korteweg-de Vries (KdV) equation. Compared with the baseline PINN and other mainstream methods such as Galerkin and Deep Ritz, VAE-PINN-DS reduces the relative L2 error by 1–3 orders of magnitude and exhibits strong robustness in ultra-high-dimensional scenarios. These results highlight that the synergy between data-driven dimensionality reduction and physics-constrained learning provides a scalable new paradigm for solving high-dimensional PDEs.
求解高维偏微分方程(PDEs)仍然是科学和工程中复杂系统建模的一个基本挑战。由于“维度的诅咒”,传统的方法常常遭受严重的精度限制。在这项工作中,我们提出了一个双向耦合数据-物理协作建模框架,该框架集成了变分自编码器(VAE)和物理信息神经网络(PINN),显著提高了高维偏微分方程的求解精度。在数据驱动方面,VAE将高维数据压缩到一个潜在空间中提取本质特征;在物理约束方面,PINN通过残差最小化嵌入物理先验,实现物理定律和数据表示的深度集成。在此基础上,我们引入了一个动态增强版本,VAE-PINN-DS,它采用自适应采样策略将计算资源分配到残差梯度高、潜在空间密度低、不确定性高的区域。数值实验证明了VAE-PINN-DS在求解泊松方程(5D-15D)、非均匀椭圆方程(10D)和20维Korteweg-de Vries (KdV)方程中的有效性。与基线PINN和Galerkin、Deep Ritz等主流方法相比,VAE-PINN-DS将相对L2误差降低了1-3个数量级,在超高维场景下表现出较强的鲁棒性。这些结果表明,数据驱动的降维和物理约束的学习之间的协同作用为解决高维pde提供了一个可扩展的新范例。
{"title":"Accurate solution of high-dimensional partial differential equations: Research on data-physics collaborative modeling and adaptive sampling","authors":"Haoran Du ,&nbsp;Zhao Liu ,&nbsp;Ping Zhu","doi":"10.1016/j.asoc.2025.114472","DOIUrl":"10.1016/j.asoc.2025.114472","url":null,"abstract":"<div><div>Solving high-dimensional partial differential equations (PDEs) remains a fundamental challenge in modeling complex systems in science and engineering. Traditional methods often suffer from significant accuracy limitations due to the \"curse of dimensionality.\" In this work, we propose a bidirectionally coupled data-physics collaborative modeling framework that integrates a Variational Autoencoder (VAE) with a Physics-Informed Neural Network (PINN), significantly improves the solution accuracy of high-dimensional PDEs. On the data-driven side, the VAE compresses high-dimensional data into a latent space to extract essential features; on the physics-constrained side, the PINN embeds physical priors via residual minimization, achieving deep integration of physical laws and data representations. Building upon this, we introduce a dynamically enhanced version, VAE-PINN-DS, which employs an adaptive sampling strategy to allocate computational resources to regions with high residual gradients, low latent-space density, and high uncertainty. Numerical experiments demonstrate the effectiveness of VAE-PINN-DS in solving the Poisson equation (5D–15D), non-uniform elliptic equation (10D), and the 20-dimensional Korteweg-de Vries (KdV) equation. Compared with the baseline PINN and other mainstream methods such as Galerkin and Deep Ritz, VAE-PINN-DS reduces the relative L2 error by 1–3 orders of magnitude and exhibits strong robustness in ultra-high-dimensional scenarios. These results highlight that the synergy between data-driven dimensionality reduction and physics-constrained learning provides a scalable new paradigm for solving high-dimensional PDEs.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114472"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039726","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
Empirical group sparse decomposition: Algorithm and application 经验群稀疏分解:算法与应用
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.114752
Sainan Li , Jing Wu , Zhengbin Yan , Jiayi Zheng , Xianbin Zheng
Periodic pulse feature components are widely present in complex signals across various fields such as biomedical and aerospace engineering, and their accurate extraction is crucial for monitoring. Aiming to address the core challenges of extracting periodic pulse feature components, this paper proposes a novel signal decomposition method, Empirical Group Sparse Decomposition (EGSD). First, EGSD constructs a unimodal pre-segmentation strategy to determine the frequency band range of the decomposition modes, ensuring the physical significance of the pre-decomposed modes. Next, EGSD designs a group sparse filter bank to decompose the signal into a series of fundamental modes, thereby extracting the hidden periodic pulse feature components within the signal. Finally, EGSD proposes a periodic frequency similarity fusion strategy to fuse the fundamental mode components into a series of eigenmode functions, effectively overcoming the over-decomposition issue. As a novel signal decomposition method, EGSD enables effective signal separation and extracts feature information concealed within noise. This paper validates the effectiveness of EGSD through simulated cases and three real-world applications: mechanical vibration signal feature extraction, EEG signal denoising, and ECG signal separation. The experimental results demonstrate that the EGSD method effectively separates signals, extracts feature information, and mitigates noise interference, underscoring its practical value.
周期脉冲特征成分广泛存在于生物医学、航空航天等领域的复杂信号中,其准确提取对监测至关重要。针对周期脉冲特征分量提取的核心问题,提出了一种新的信号分解方法——经验群稀疏分解(EGSD)。首先,EGSD构建单峰预分割策略,确定分解模态的频带范围,保证预分解模态的物理意义。其次,EGSD设计一组稀疏滤波器组,将信号分解为一系列基模,从而提取信号中隐藏的周期脉冲特征分量。最后,EGSD提出了一种周期频率相似度融合策略,将基模态分量融合为一系列特征模态函数,有效地克服了过度分解问题。作为一种新型的信号分解方法,EGSD能够有效地分离信号,提取隐藏在噪声中的特征信息。本文通过仿真案例和机械振动信号特征提取、脑电信号去噪和心电信号分离三种实际应用验证了EGSD的有效性。实验结果表明,EGSD方法能有效地分离信号、提取特征信息、减轻噪声干扰,具有一定的实用价值。
{"title":"Empirical group sparse decomposition: Algorithm and application","authors":"Sainan Li ,&nbsp;Jing Wu ,&nbsp;Zhengbin Yan ,&nbsp;Jiayi Zheng ,&nbsp;Xianbin Zheng","doi":"10.1016/j.asoc.2026.114752","DOIUrl":"10.1016/j.asoc.2026.114752","url":null,"abstract":"<div><div>Periodic pulse feature components are widely present in complex signals across various fields such as biomedical and aerospace engineering, and their accurate extraction is crucial for monitoring. Aiming to address the core challenges of extracting periodic pulse feature components, this paper proposes a novel signal decomposition method, Empirical Group Sparse Decomposition (EGSD). First, EGSD constructs a unimodal pre-segmentation strategy to determine the frequency band range of the decomposition modes, ensuring the physical significance of the pre-decomposed modes. Next, EGSD designs a group sparse filter bank to decompose the signal into a series of fundamental modes, thereby extracting the hidden periodic pulse feature components within the signal. Finally, EGSD proposes a periodic frequency similarity fusion strategy to fuse the fundamental mode components into a series of eigenmode functions, effectively overcoming the over-decomposition issue. As a novel signal decomposition method, EGSD enables effective signal separation and extracts feature information concealed within noise. This paper validates the effectiveness of EGSD through simulated cases and three real-world applications: mechanical vibration signal feature extraction, EEG signal denoising, and ECG signal separation. The experimental results demonstrate that the EGSD method effectively separates signals, extracts feature information, and mitigates noise interference, underscoring its practical value.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"192 ","pages":"Article 114752"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146191785","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
Cost investigations and ANFIS implementation for M/M/1/L queueing model with general vacation, customer discouragement, and F-policy M/M/1/L排队模型的成本调查和ANFIS的实施
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.114667
Khushbu S. Antala, Sudeep Singh Sanga
This work investigates the M/M/1/L queueing model within real-life scenarios, highlighting its substantial impact on various domains such as call centers, distributed computing systems, healthcare facilities, traffic management centers, and other service-oriented operations. It focuses on the finite capacity queueing model with general vacations and customer discouragement under the F-policy. Additionally, we consider essential queueing features that account for customers’ behaviors, such as balking and reneging. When customers encounter long queues, they may experience discouragement and consequently choose not to join the queue or leave without receiving service. Implementation of the ‘F-policy’ is an effective strategy for the admission of customers into the system to reduce congestion resulting from excessive customer arrivals. Further, the server chooses to take a vacation when no customer is present in the system. The vacation time is not exponentially distributed; instead, we consider the general case of vacation time for a more comprehensive analysis. The mathematical development of the M/M/1/L queueing model is carried out using the Chapman-Kolmogorov steady-state equations by introducing supplementary variables corresponding to remaining vacation times. Subsequently, the Laplace-Stieltjes transform and recursive method are employed to solve these equations and establish probability distributions. Further, various performance metrics, such as the number of customers in the system, throughput, customer loss, long-run probabilities, etc., are derived. These performance measures will assist system organizers in making informed decision-making strategies. A numerical example is also presented, illustrating the impact of input parameters and customers’ discouraged behavior on various performance metrics. The adaptive neuro-fuzzy inference system, which is built on an artificial neural network and a support vector regression, a machine learning technique, is employed to validate the numerical results. Moreover, the nonlinear cost function is formulated with the service and vacation rates as decision variables. The cost is minimized using quasi-Newton methods and several metaheuristics (particle swarm optimization, bat algorithm, and differential evolution variants). These algorithms are utilized to compare the optimal values of the cost function. The queueing model’s practical application is demonstrated through its implementation in fog computing systems.
这项工作研究了现实场景中的M/M/1/L排队模型,强调了它对呼叫中心、分布式计算系统、医疗保健设施、交通管理中心和其他面向服务的操作等各个领域的重大影响。研究了F-policy下具有一般假期和顾客不鼓励的有限容量排队模型。此外,我们考虑了基本的排队特征,这些特征解释了客户的行为,如犹豫和食言。当顾客遇到排长队时,他们可能会感到沮丧,从而选择不加入队伍或没有得到服务就离开。实施“f政策”是一项有效的策略,可让旅客进入系统,以减少因旅客过多而造成的挤塞。此外,当系统中没有客户时,服务器选择休假。休假时间不呈指数分布;相反,我们考虑休假时间的一般情况,以便进行更全面的分析。通过引入与剩余休假时间相对应的补充变量,利用Chapman-Kolmogorov稳态方程对M/M/1/L排队模型进行数学发展。然后,利用Laplace-Stieltjes变换和递归方法求解这些方程,建立概率分布。此外,还推导出各种性能度量,例如系统中的客户数量、吞吐量、客户损失、长期运行概率等。这些绩效指标将有助于系统组织者制定明智的决策策略。最后给出了一个数值例子,说明了输入参数和顾客不鼓励行为对各种绩效指标的影响。采用基于人工神经网络和机器学习技术支持向量回归的自适应神经模糊推理系统对数值结果进行验证。并以服务率和休假率为决策变量,建立了非线性成本函数。使用准牛顿方法和几种元启发式方法(粒子群优化、蝙蝠算法和微分进化变体)最小化成本。这些算法用于比较成本函数的最优值。通过在雾计算系统中的实现,说明了排队模型的实际应用。
{"title":"Cost investigations and ANFIS implementation for M/M/1/L queueing model with general vacation, customer discouragement, and F-policy","authors":"Khushbu S. Antala,&nbsp;Sudeep Singh Sanga","doi":"10.1016/j.asoc.2026.114667","DOIUrl":"10.1016/j.asoc.2026.114667","url":null,"abstract":"<div><div>This work investigates the M/M/1/L queueing model within real-life scenarios, highlighting its substantial impact on various domains such as call centers, distributed computing systems, healthcare facilities, traffic management centers, and other service-oriented operations. It focuses on the finite capacity queueing model with general vacations and customer discouragement under the <em>F</em>-policy. Additionally, we consider essential queueing features that account for customers’ behaviors, such as balking and reneging. When customers encounter long queues, they may experience discouragement and consequently choose not to join the queue or leave without receiving service. Implementation of the ‘<em>F</em>-policy’ is an effective strategy for the admission of customers into the system to reduce congestion resulting from excessive customer arrivals. Further, the server chooses to take a vacation when no customer is present in the system. The vacation time is not exponentially distributed; instead, we consider the general case of vacation time for a more comprehensive analysis. The mathematical development of the M/M/1/L queueing model is carried out using the Chapman-Kolmogorov steady-state equations by introducing supplementary variables corresponding to remaining vacation times. Subsequently, the Laplace-Stieltjes transform and recursive method are employed to solve these equations and establish probability distributions. Further, various performance metrics, such as the number of customers in the system, throughput, customer loss, long-run probabilities, etc., are derived. These performance measures will assist system organizers in making informed decision-making strategies. A numerical example is also presented, illustrating the impact of input parameters and customers’ discouraged behavior on various performance metrics. The adaptive neuro-fuzzy inference system, which is built on an artificial neural network and a support vector regression, a machine learning technique, is employed to validate the numerical results. Moreover, the nonlinear cost function is formulated with the service and vacation rates as decision variables. The cost is minimized using quasi-Newton methods and several metaheuristics (particle swarm optimization, bat algorithm, and differential evolution variants). These algorithms are utilized to compare the optimal values of the cost function. The queueing model’s practical application is demonstrated through its implementation in fog computing systems.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"191 ","pages":"Article 114667"},"PeriodicalIF":6.6,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146080042","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