Hybrid genetic algorithm with Wiener process for multi-scale colored balanced traveling salesman problem

IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
{"title":"Hybrid genetic algorithm with Wiener process for multi-scale colored balanced traveling salesman problem","authors":"","doi":"10.1016/j.eswa.2024.125610","DOIUrl":null,"url":null,"abstract":"<div><div>Colored traveling salesman problem (CTSP) can be applied to Multi-machine Engineering Systems (MES) in industry, colored balanced traveling salesman problem (CBTSP) is a variant of CTSP, which can be used to model the optimization problems with partially overlapped workspace such as the planning optimization (For example, process planning, assembly planning, productions scheduling). The traditional algorithms have been used to solve CBTSP, however, they are limited both in solution quality and solving speed, and the scale of CBTSP is also restricted. Moreover, the traditional algorithms still have the problems such as lacking theoretical support of mathematical physics. In order to improve these, this paper proposes a novel hybrid genetic algorithm (NHGA) based on Wiener process (ITÖ process) and generating neighborhood solution (GNS) to solve multi-scale CBTSP problem. NHGA firstly uses dual-chromosome coding to construct the solutions of CBTSP, then they are updated by the crossover operator, mutation operator and GNS. The crossover length of the crossover operator and the city number of the mutation operator are controlled by activity intensity based on ITÖ process, while the city keeping probability of GNS can be learned or obtained by Wiener process. The experiments show that NHGA can demonstrate an improvement over the state-of-art algorithms for multi-scale CBTSP in term of solution quality.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":null,"pages":null},"PeriodicalIF":7.5000,"publicationDate":"2024-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Expert Systems with Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0957417424024771","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Colored traveling salesman problem (CTSP) can be applied to Multi-machine Engineering Systems (MES) in industry, colored balanced traveling salesman problem (CBTSP) is a variant of CTSP, which can be used to model the optimization problems with partially overlapped workspace such as the planning optimization (For example, process planning, assembly planning, productions scheduling). The traditional algorithms have been used to solve CBTSP, however, they are limited both in solution quality and solving speed, and the scale of CBTSP is also restricted. Moreover, the traditional algorithms still have the problems such as lacking theoretical support of mathematical physics. In order to improve these, this paper proposes a novel hybrid genetic algorithm (NHGA) based on Wiener process (ITÖ process) and generating neighborhood solution (GNS) to solve multi-scale CBTSP problem. NHGA firstly uses dual-chromosome coding to construct the solutions of CBTSP, then they are updated by the crossover operator, mutation operator and GNS. The crossover length of the crossover operator and the city number of the mutation operator are controlled by activity intensity based on ITÖ process, while the city keeping probability of GNS can be learned or obtained by Wiener process. The experiments show that NHGA can demonstrate an improvement over the state-of-art algorithms for multi-scale CBTSP in term of solution quality.
多尺度彩色平衡旅行推销员问题的维纳过程混合遗传算法
有色平衡旅行推销员问题(CBTSP)是 CTSP 的一种变体,可用于规划优化(如流程规划、装配规划、生产调度)等工作空间部分重叠的优化问题建模。传统算法已被用于求解 CBTSP,但它们在求解质量和求解速度上都受到限制,而且 CBTSP 的规模也受到限制。此外,传统算法还存在缺乏数学物理理论支持等问题。为了改善这些问题,本文提出了一种基于维纳过程(ITÖ process)和生成邻域解(GNS)的新型混合遗传算法(NHGA)来解决多尺度 CBTSP 问题。NHGA 首先使用双染色体编码构建 CBTSP 的解,然后通过交叉算子、突变算子和 GNS 对其进行更新。交叉算子的交叉长度和突变算子的城市数由基于 ITÖ 过程的活动强度控制,而 GNS 的城市保持概率可以通过学习或 Wiener 过程获得。实验表明,NHGA 在多尺度 CBTSP 的求解质量方面比最先进的算法有所提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Expert Systems with Applications
Expert Systems with Applications 工程技术-工程:电子与电气
CiteScore
13.80
自引率
10.60%
发文量
2045
审稿时长
8.7 months
期刊介绍: Expert Systems With Applications is an international journal dedicated to the exchange of information on expert and intelligent systems used globally in industry, government, and universities. The journal emphasizes original papers covering the design, development, testing, implementation, and management of these systems, offering practical guidelines. It spans various sectors such as finance, engineering, marketing, law, project management, information management, medicine, and more. The journal also welcomes papers on multi-agent systems, knowledge management, neural networks, knowledge discovery, data mining, and other related areas, excluding applications to military/defense systems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信