To enhance the service scope and quality of urban public transport systems, this study investigates the optimal design problem of feeder-bus networks related to urban rail transit considering time windows (FBNDP-TW). To ensure an acceptable passenger travel time, we differentially set the travel time window for each origin-destination (OD) pair based on the ideal travel time. Considering logical constraints, capacity constraints and time window constraints, we construct an FBNDP-TW optimisation model to minimise passengers’ generalised travel cost and bus operators’ operating cost. To solve this model, a genetic algorithm is developed with a diverse multi-neighbourhood crossover operation that includes ‘direct’, ‘forward’ and ‘adjacent’ rules. This crossover operation mechanism can efficiently make the feeder-bus network quickly meet time window constraints to guarantee its quality. Finally, the proposed model and algorithm are evaluated using a standard example network. The results confirm that they can effectively ensure the travel time of each OD. Although integrating time window constraints slightly raises network cost, it significantly reduces the maximum OD detour ratio and ensures the travel time of all ODs within the acceptable range.
{"title":"Optimisation Design of Feeder-Bus Network Related to Urban Rail Transit With Time Windows","authors":"Jing Xu, Lianbo Deng, Chen Chen","doi":"10.1049/itr2.70131","DOIUrl":"10.1049/itr2.70131","url":null,"abstract":"<p>To enhance the service scope and quality of urban public transport systems, this study investigates the optimal design problem of feeder-bus networks related to urban rail transit considering time windows (FBNDP-TW). To ensure an acceptable passenger travel time, we differentially set the travel time window for each origin-destination (OD) pair based on the ideal travel time. Considering logical constraints, capacity constraints and time window constraints, we construct an FBNDP-TW optimisation model to minimise passengers’ generalised travel cost and bus operators’ operating cost. To solve this model, a genetic algorithm is developed with a diverse multi-neighbourhood crossover operation that includes ‘direct’, ‘forward’ and ‘adjacent’ rules. This crossover operation mechanism can efficiently make the feeder-bus network quickly meet time window constraints to guarantee its quality. Finally, the proposed model and algorithm are evaluated using a standard example network. The results confirm that they can effectively ensure the travel time of each OD. Although integrating time window constraints slightly raises network cost, it significantly reduces the maximum OD detour ratio and ensures the travel time of all ODs within the acceptable range.</p>","PeriodicalId":50381,"journal":{"name":"IET Intelligent Transport Systems","volume":"19 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2025-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/itr2.70131","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145824719","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mohammed Al-Soswa, Zhaoyun Sun, Ali Desbi, Abdulkareem Abdullah
To address the issues of false positives and missed detections of multi-scale cracks and small targets in complex environments, this paper proposes an enhanced YOLOv10 instance segmentation network named YOLO-RCS (YOLOv10s road crack segmentation), specifically designed for segmenting surface cracks. YOLO-RCS utilizes the DCNv4 module to enhance feature extraction in the backbone network, improving the accurate localization of surface crack segmentation. Additionally, we introduce a novel C3FB structure (an efficient fusion of the C3 module and FocalNextBlock structure) to replace the C2f module in YOLOv10's neck network, aiming to reduce the number of parameters while enhancing model accuracy. Finally, we improve the original loss function to the WIOU loss function, which increases the model's precision and mean average precision (mAP) for segmenting surface cracks. Experimental results show that our model achieves an mAP50 of 90.0% on the surface crack segmentation dataset Crackseg9k, a 5.0% improvement over the original algorithm, with a precision of 91.6%, demonstrating excellent segmentation performance. Compared to some mainstream object detection algorithms, our proposed method also exhibits certain advantages.
{"title":"Crack Segmentation Model Based on Deformable Convolution and Cross-Stage Feature Fusion Network","authors":"Mohammed Al-Soswa, Zhaoyun Sun, Ali Desbi, Abdulkareem Abdullah","doi":"10.1049/itr2.70133","DOIUrl":"10.1049/itr2.70133","url":null,"abstract":"<p>To address the issues of false positives and missed detections of multi-scale cracks and small targets in complex environments, this paper proposes an enhanced YOLOv10 instance segmentation network named YOLO-RCS (YOLOv10s road crack segmentation), specifically designed for segmenting surface cracks. YOLO-RCS utilizes the DCNv4 module to enhance feature extraction in the backbone network, improving the accurate localization of surface crack segmentation. Additionally, we introduce a novel C3FB structure (an efficient fusion of the C3 module and FocalNextBlock structure) to replace the C2f module in YOLOv10's neck network, aiming to reduce the number of parameters while enhancing model accuracy. Finally, we improve the original loss function to the WIOU loss function, which increases the model's precision and mean average precision (mAP) for segmenting surface cracks. Experimental results show that our model achieves an mAP50 of 90.0% on the surface crack segmentation dataset Crackseg9k, a 5.0% improvement over the original algorithm, with a precision of 91.6%, demonstrating excellent segmentation performance. Compared to some mainstream object detection algorithms, our proposed method also exhibits certain advantages.</p>","PeriodicalId":50381,"journal":{"name":"IET Intelligent Transport Systems","volume":"19 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2025-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/itr2.70133","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145824755","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Meng Mei, Lin Zhou, Zuxi Chen, Shengbin Chen, Zhongwei Xu, Xiaoyong Wang, Liang Pan, Xiangyu Luo
Computer-based systems (CBSs) are complex and critical, with risks to human lives and the environment. Ensuring their safety requires rigorous methods. Unlike traditional approaches that model system mission specifications in a single step before introducing safety requirements, this paper proposes a layered strategy for modelling both mission and safety requirements. This strategy ensures alignment between safety and mission requirements at each layer and formally proves their sufficiency with respect to system-level safety constraints (SLSCs), thereby achieving synchronised assurance of functionality and safety. Mission requirements are specified in Event-B, while System-Theoretic Process Analysis (STPA) derives safety requirements (SRs) to address system-level hazards. These SRs and SLSCs are integrated into the Event-B model to ensure consistency and verify compliance. By iteratively applying this pattern at each STAMP refinement step, a layered CBS is developed with safety as a core feature. Key contributions include stepwise STAMP refinement aligned with the system architecture hierarchy, coordinated development of Event-B models and STPA analysis using common STAMP models, and managing abstraction levels to ensure compliance between SRs and SLSCs while addressing formal verification complexity. A case study of a computer-based interlocking system demonstrates the approach's practical application.
{"title":"Safety-Guided Development of Critical Computer-Based Systems Using STPA and Event-B in an Iterative Process","authors":"Meng Mei, Lin Zhou, Zuxi Chen, Shengbin Chen, Zhongwei Xu, Xiaoyong Wang, Liang Pan, Xiangyu Luo","doi":"10.1049/itr2.70128","DOIUrl":"10.1049/itr2.70128","url":null,"abstract":"<p>Computer-based systems (CBSs) are complex and critical, with risks to human lives and the environment. Ensuring their safety requires rigorous methods. Unlike traditional approaches that model system mission specifications in a single step before introducing safety requirements, this paper proposes a layered strategy for modelling both mission and safety requirements. This strategy ensures alignment between safety and mission requirements at each layer and formally proves their sufficiency with respect to system-level safety constraints (SLSCs), thereby achieving synchronised assurance of functionality and safety. Mission requirements are specified in Event-B, while System-Theoretic Process Analysis (STPA) derives safety requirements (SRs) to address system-level hazards. These SRs and SLSCs are integrated into the Event-B model to ensure consistency and verify compliance. By iteratively applying this pattern at each STAMP refinement step, a layered CBS is developed with safety as a core feature. Key contributions include stepwise STAMP refinement aligned with the system architecture hierarchy, coordinated development of Event-B models and STPA analysis using common STAMP models, and managing abstraction levels to ensure compliance between SRs and SLSCs while addressing formal verification complexity. A case study of a computer-based interlocking system demonstrates the approach's practical application.</p>","PeriodicalId":50381,"journal":{"name":"IET Intelligent Transport Systems","volume":"19 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2025-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/itr2.70128","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145814581","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xin Gao, Peng Liu, Ying Liu, Yugang Qin, Yan Gong, Xinyu Zhang, Jianqiang Wang
Low-light road segmentation is a challenging dense prediction task, which is very important for the safety monitoring of intelligent sea ports at night and the autonomous vehicles of shipping logistics. Most current research focuses on scenes with sufficient light. At the same time, there are few datasets for low-light scenes, making research on low-light perception very difficult and seriously restricting the shipping logistics industry's ability to operate safely at night. Directly applying segmentation methods developed for well-lit scenes to low-light road segmentation is unsatisfactory. To solve this problem, we propose a new approach by building an image enhancement module and an edge detection module, and integrating them into existing well-lit segmentation models as a plugin to meet the road segmentation requirements for low-light scenes. Specifically, to compensate for the lack of low-light image detail, we design an image enhancement module that achieves end-to-end pixel-level image enhancement by connecting four image processing filters in series and using convolutional neural network to predict hyperparameters. Additionally, to address the problem that road edges become blurred and difficult to extract in low-light images, we design an edge detection module to maximize its ability to extract road edges by selecting differential pixel pairs using different strategies and efficient combinations. We conduct comprehensive experiments on our newly released dataset, LoRD, demonstrating that our method significantly outperforms previous state-of-the-art models with relatively few parameters and computational cost. Our method achieves new SOTA performance in terms of accuracy and computational efficiency, achieving 93.29