Xinjie Wan , Hao Pu , Paul Schonfeld , Yang Ran , Taoran Song , Lihui Peng
{"title":"基于自适应快速探索随机树算法的铁路线路变压器导向优化","authors":"Xinjie Wan , Hao Pu , Paul Schonfeld , Yang Ran , Taoran Song , Lihui Peng","doi":"10.1016/j.asoc.2025.113977","DOIUrl":null,"url":null,"abstract":"<div><div>Railway alignment design is a crucial part of a railway project. Despite the widespread success of computer-aided alignment optimization methods in determining alignments, effectively exploring the objective function’s descent direction (OFDD) remains challenging, particularly when navigating complex alignment search spaces. To address this issue, it is essential to comprehensively consider key factors, including the global and local environment, explored and unexplored search spaces, as well as established alignment search strategies and potential new ones that may emerge during the OFDD optimizing process. Therefore, an alignment-oriented Transformer framework is formulated in this work. In this framework, various real-world railway cases are input into a stacked Transformer framework to learn an optimized OFDD strategy. Specifically, the model handles regular inputs (i.e., global and local contexts, long-term goals) and irregular inputs (i.e., historical paths) using two separate stacked Transformer encoders. Afterward, an adaptive rapidly-exploring random tree star (Ada-RRT-star) method is developed by integrating the Transformer framework’s output to guide RRT’s search direction as well as to enhance the solution quality. Ultimately, the proposed method is applied to a realistic railway case, where the results demonstrate its superiority over the conventional 3D-RRT-star algorithm in terms of solution quality. Besides, the best alignment generated by the Ada-RRT-star also outperforms the manually-designed alignment.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"185 ","pages":"Article 113977"},"PeriodicalIF":6.6000,"publicationDate":"2025-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Transformer-guided optimization of railway alignments using an adaptive rapidly-exploring random tree algorithm\",\"authors\":\"Xinjie Wan , Hao Pu , Paul Schonfeld , Yang Ran , Taoran Song , Lihui Peng\",\"doi\":\"10.1016/j.asoc.2025.113977\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Railway alignment design is a crucial part of a railway project. Despite the widespread success of computer-aided alignment optimization methods in determining alignments, effectively exploring the objective function’s descent direction (OFDD) remains challenging, particularly when navigating complex alignment search spaces. To address this issue, it is essential to comprehensively consider key factors, including the global and local environment, explored and unexplored search spaces, as well as established alignment search strategies and potential new ones that may emerge during the OFDD optimizing process. Therefore, an alignment-oriented Transformer framework is formulated in this work. In this framework, various real-world railway cases are input into a stacked Transformer framework to learn an optimized OFDD strategy. Specifically, the model handles regular inputs (i.e., global and local contexts, long-term goals) and irregular inputs (i.e., historical paths) using two separate stacked Transformer encoders. Afterward, an adaptive rapidly-exploring random tree star (Ada-RRT-star) method is developed by integrating the Transformer framework’s output to guide RRT’s search direction as well as to enhance the solution quality. Ultimately, the proposed method is applied to a realistic railway case, where the results demonstrate its superiority over the conventional 3D-RRT-star algorithm in terms of solution quality. Besides, the best alignment generated by the Ada-RRT-star also outperforms the manually-designed alignment.</div></div>\",\"PeriodicalId\":50737,\"journal\":{\"name\":\"Applied Soft Computing\",\"volume\":\"185 \",\"pages\":\"Article 113977\"},\"PeriodicalIF\":6.6000,\"publicationDate\":\"2025-09-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Soft Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1568494625012906\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494625012906","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Transformer-guided optimization of railway alignments using an adaptive rapidly-exploring random tree algorithm
Railway alignment design is a crucial part of a railway project. Despite the widespread success of computer-aided alignment optimization methods in determining alignments, effectively exploring the objective function’s descent direction (OFDD) remains challenging, particularly when navigating complex alignment search spaces. To address this issue, it is essential to comprehensively consider key factors, including the global and local environment, explored and unexplored search spaces, as well as established alignment search strategies and potential new ones that may emerge during the OFDD optimizing process. Therefore, an alignment-oriented Transformer framework is formulated in this work. In this framework, various real-world railway cases are input into a stacked Transformer framework to learn an optimized OFDD strategy. Specifically, the model handles regular inputs (i.e., global and local contexts, long-term goals) and irregular inputs (i.e., historical paths) using two separate stacked Transformer encoders. Afterward, an adaptive rapidly-exploring random tree star (Ada-RRT-star) method is developed by integrating the Transformer framework’s output to guide RRT’s search direction as well as to enhance the solution quality. Ultimately, the proposed method is applied to a realistic railway case, where the results demonstrate its superiority over the conventional 3D-RRT-star algorithm in terms of solution quality. Besides, the best alignment generated by the Ada-RRT-star also outperforms the manually-designed alignment.
期刊介绍:
Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities.
Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.