Di Yin, Hongbo Zhang, Shih-Mo Yang, R. Yin, Wenjun Zhang
Cell migration assay is the most common research approach for cell migration. Quantitative research and analysis are carried out by measuring the migration of cells into the region that is artificially created among confluent monolayer cells. To improve the efficiency and accuracy of the analysis, the software/tools were developed to assist the image analysis process. However, these software and tools are still at the stage of measuring a single sample, which cannot satisfy the requirement of large sample size for cell migration assay device. In this paper, an image analysis tool based on Fiji is developed, which can segment multiple samples from a scanned image and then analyze a single sample in batch. In addition, the screening function should be added for the application scenario of large sample size. The samples can be filtered according to different conditions to improve the consistency of experimental conditions. The results show that the developed analysis tool ATCA has high accuracy in identifying cell-free zones, with a difference of 2.3% from the tool WHST and 2.9% from manual operation. The analysis efficiency of this tool is 15 times that of manual operation.
{"title":"An image analysis tool for cell migration assay with a large sample size","authors":"Di Yin, Hongbo Zhang, Shih-Mo Yang, R. Yin, Wenjun Zhang","doi":"10.1117/12.2667479","DOIUrl":"https://doi.org/10.1117/12.2667479","url":null,"abstract":"Cell migration assay is the most common research approach for cell migration. Quantitative research and analysis are carried out by measuring the migration of cells into the region that is artificially created among confluent monolayer cells. To improve the efficiency and accuracy of the analysis, the software/tools were developed to assist the image analysis process. However, these software and tools are still at the stage of measuring a single sample, which cannot satisfy the requirement of large sample size for cell migration assay device. In this paper, an image analysis tool based on Fiji is developed, which can segment multiple samples from a scanned image and then analyze a single sample in batch. In addition, the screening function should be added for the application scenario of large sample size. The samples can be filtered according to different conditions to improve the consistency of experimental conditions. The results show that the developed analysis tool ATCA has high accuracy in identifying cell-free zones, with a difference of 2.3% from the tool WHST and 2.9% from manual operation. The analysis efficiency of this tool is 15 times that of manual operation.","PeriodicalId":345723,"journal":{"name":"Fifth International Conference on Computer Information Science and Artificial Intelligence","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121570785","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Automatic and accurate arrival time pickup of microseismic first-arrival waves is an important prerequisite for high precision microseismic source location. Aiming at the low efficiency of the traditional manual pickup method and the low accuracy of the long, short window energy ratio (STA/LTA) method commonly used in automatic pickup for low signal-to-noise ratio signals, an automatic picking method of microseismic first arrival based on support vector machine based on particle swarm optimization is proposed. Firstly, according to the amplitude and energy of microseismic signal and the energy ratio of adjacent time, the signals are marked with different categories. Then the parameters are optimized by particle swarm optimization algorithm to construct the support vector machine model of microseismic first-arrival. Finally, the data is substituted to extract the microseismic first-arrival. The experiment is carried out with the microseismic monitoring data of underground roadway in a gold mine. The experimental results show that, under the condition of low SIGNal-to-noise ratio, the picking accuracy of the proposed method is 96.4%, the average pickup error is 3.9ms, and the picking accuracy and accuracy are better than STA/LTA method.
{"title":"Automatic picking method of microseismic first arrival based on support vector machine based on particle swarm optimization","authors":"Tieniu Li, Binxin Hu, Zengrong Sun, Feng Zhu, Hua Zhang, Quancheng Yang","doi":"10.1117/12.2667714","DOIUrl":"https://doi.org/10.1117/12.2667714","url":null,"abstract":"Automatic and accurate arrival time pickup of microseismic first-arrival waves is an important prerequisite for high precision microseismic source location. Aiming at the low efficiency of the traditional manual pickup method and the low accuracy of the long, short window energy ratio (STA/LTA) method commonly used in automatic pickup for low signal-to-noise ratio signals, an automatic picking method of microseismic first arrival based on support vector machine based on particle swarm optimization is proposed. Firstly, according to the amplitude and energy of microseismic signal and the energy ratio of adjacent time, the signals are marked with different categories. Then the parameters are optimized by particle swarm optimization algorithm to construct the support vector machine model of microseismic first-arrival. Finally, the data is substituted to extract the microseismic first-arrival. The experiment is carried out with the microseismic monitoring data of underground roadway in a gold mine. The experimental results show that, under the condition of low SIGNal-to-noise ratio, the picking accuracy of the proposed method is 96.4%, the average pickup error is 3.9ms, and the picking accuracy and accuracy are better than STA/LTA method.","PeriodicalId":345723,"journal":{"name":"Fifth International Conference on Computer Information Science and Artificial Intelligence","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125140378","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sign language recognition can make the communication between deaf mutes and healthy people more convenient and fast. In recent years, with the continuous development of deep learning, the research method of deep learning has also been introduced into the field of sign language recognition. Compared with the recognition of isolated words, the recognition of continuous sign language is more time-dependent. The current research still has shortcomings in recognition accuracy. Therefore, we proposed a continuous sign language recognition method based on 3DCNN and BLSTM. Based on the spatial feature information extracted by 3DCNN and the short-term temporal relationship established, the global temporal modeling of the video information of continuous sign language is carried out by using the bidirectional semantic mining ability of BLSTM. The CTC loss function is constructed to solve the problem of time series label misalignment. At the same time, we add the calculation of auxiliary loss function and auxiliary classifier. Experiments show that the auxiliary loss function and classifier can effectively reduce the error rate of the network. The word error rate of the continuous sign language recognition algorithm proposed in this paper on the large continuous sign language dataset RWTH-PHONEIX-Weather 2014 is as low as 23.5%, which is lower than the previous algorithm.
{"title":"Continuous sign language recognition based on 3DCNN and BLSTM","authors":"Hengbo Zhang, Daming Liu, Nana Fu","doi":"10.1117/12.2667649","DOIUrl":"https://doi.org/10.1117/12.2667649","url":null,"abstract":"Sign language recognition can make the communication between deaf mutes and healthy people more convenient and fast. In recent years, with the continuous development of deep learning, the research method of deep learning has also been introduced into the field of sign language recognition. Compared with the recognition of isolated words, the recognition of continuous sign language is more time-dependent. The current research still has shortcomings in recognition accuracy. Therefore, we proposed a continuous sign language recognition method based on 3DCNN and BLSTM. Based on the spatial feature information extracted by 3DCNN and the short-term temporal relationship established, the global temporal modeling of the video information of continuous sign language is carried out by using the bidirectional semantic mining ability of BLSTM. The CTC loss function is constructed to solve the problem of time series label misalignment. At the same time, we add the calculation of auxiliary loss function and auxiliary classifier. Experiments show that the auxiliary loss function and classifier can effectively reduce the error rate of the network. The word error rate of the continuous sign language recognition algorithm proposed in this paper on the large continuous sign language dataset RWTH-PHONEIX-Weather 2014 is as low as 23.5%, which is lower than the previous algorithm.","PeriodicalId":345723,"journal":{"name":"Fifth International Conference on Computer Information Science and Artificial Intelligence","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125644394","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The synthesis of human movement is used in a wide range of applications, such as in military, gaming, sports, medical, robotics and many other fields. The current common approach is based on the acquisition of human motion data by motion capture devices. However, employing this method to gather information on human movements is expensive, time-consuming, and subject to space constraints. In order to avoid these problems, our goal is to create a system that can generate a variety of naturalistic movements quickly and inexpensively. We assume that the creation of human motion is a complicated, non-linear process that is amenable to modeling with deep neural networks. First, using optical motion capture equipment, we collect a range of human motion data, which we then pre-process and annotate. After that-we combine Transformer with Conditional GAN (Cgan) to train this human motion generation model with the collected data. Finally, we evaluate this model by qualitative and qualitative means, which can generate multiple human motions from a high-dimensional potential space based on specified labels.
{"title":"TransCGan-based human motion generator","authors":"Wenya Yu","doi":"10.1117/12.2668277","DOIUrl":"https://doi.org/10.1117/12.2668277","url":null,"abstract":"The synthesis of human movement is used in a wide range of applications, such as in military, gaming, sports, medical, robotics and many other fields. The current common approach is based on the acquisition of human motion data by motion capture devices. However, employing this method to gather information on human movements is expensive, time-consuming, and subject to space constraints. In order to avoid these problems, our goal is to create a system that can generate a variety of naturalistic movements quickly and inexpensively. We assume that the creation of human motion is a complicated, non-linear process that is amenable to modeling with deep neural networks. First, using optical motion capture equipment, we collect a range of human motion data, which we then pre-process and annotate. After that-we combine Transformer with Conditional GAN (Cgan) to train this human motion generation model with the collected data. Finally, we evaluate this model by qualitative and qualitative means, which can generate multiple human motions from a high-dimensional potential space based on specified labels.","PeriodicalId":345723,"journal":{"name":"Fifth International Conference on Computer Information Science and Artificial Intelligence","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131455251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Intelligent anti-jam communication is a new generation of anti-interference technology combined with artificial intelligence, and the identification of interference signals is the basis of the technology. It is required to achieve better identification results with lower computational complexity in engineering applications. However, previous research has shown that they cannot balance these two sides. Here, we report an interference signal identification algorithm based on Extreme Learning Machine (ELM). Five typical oppressive interference signals were recognized based on ELM which is based on feature extraction. The overall correct identification rate is more than 96% under the condition of 40 neurons in a single hidden layer, and it has certain generalization ability. This study objectively promotes the engineering application of this technology.
{"title":"A method for wireless communication interference signal identification based on extreme learning machine","authors":"Xiaozheng Liu, Yue Wang, Xiaofei Wang, Jian Geng","doi":"10.1117/12.2667713","DOIUrl":"https://doi.org/10.1117/12.2667713","url":null,"abstract":"Intelligent anti-jam communication is a new generation of anti-interference technology combined with artificial intelligence, and the identification of interference signals is the basis of the technology. It is required to achieve better identification results with lower computational complexity in engineering applications. However, previous research has shown that they cannot balance these two sides. Here, we report an interference signal identification algorithm based on Extreme Learning Machine (ELM). Five typical oppressive interference signals were recognized based on ELM which is based on feature extraction. The overall correct identification rate is more than 96% under the condition of 40 neurons in a single hidden layer, and it has certain generalization ability. This study objectively promotes the engineering application of this technology.","PeriodicalId":345723,"journal":{"name":"Fifth International Conference on Computer Information Science and Artificial Intelligence","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131516171","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xiuyong Mao, Fan Yang, Kaiyu Fan, Weizhou Hu, Chungui Li
Identifying influential nodes is one of the crucial issues for controlling the network propagation process and exploring network properties in complex networks. Nevertheless, the accuracy of existing methods is still a challenge. In this paper, we rank influential nodes by considering tow aspects. On one hand, a normalized degree centrality is proposed to measure the local influence of each node. On the other hand, an improved fine-grained K-Shell decomposition is defined to measure the spreading ability of neighbors of a node. Further, a novel ranking measure is proposed by combining the normalized degree centrality and fine-grained K-Shell (NDF-FKS). The Susceptible-Infected-Recovery (SIR) model is used to simulate the network propagation process. Experiments with the model are performed on eight synthetic networks and four real networks. The NDF-FKS compared with six measures for accuracy and resolution. The results show that the accuracy of NDF-FKS outperforms existing six measures and has a competitive performance on distinguishing influential nodes.
{"title":"Ranking influential nodes by combining normalized degree centrality and fine-grained K-Shell","authors":"Xiuyong Mao, Fan Yang, Kaiyu Fan, Weizhou Hu, Chungui Li","doi":"10.1117/12.2667305","DOIUrl":"https://doi.org/10.1117/12.2667305","url":null,"abstract":"Identifying influential nodes is one of the crucial issues for controlling the network propagation process and exploring network properties in complex networks. Nevertheless, the accuracy of existing methods is still a challenge. In this paper, we rank influential nodes by considering tow aspects. On one hand, a normalized degree centrality is proposed to measure the local influence of each node. On the other hand, an improved fine-grained K-Shell decomposition is defined to measure the spreading ability of neighbors of a node. Further, a novel ranking measure is proposed by combining the normalized degree centrality and fine-grained K-Shell (NDF-FKS). The Susceptible-Infected-Recovery (SIR) model is used to simulate the network propagation process. Experiments with the model are performed on eight synthetic networks and four real networks. The NDF-FKS compared with six measures for accuracy and resolution. The results show that the accuracy of NDF-FKS outperforms existing six measures and has a competitive performance on distinguishing influential nodes.","PeriodicalId":345723,"journal":{"name":"Fifth International Conference on Computer Information Science and Artificial Intelligence","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133162875","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Face attribute editing, one of the important research directions in face image synthesis and processing techniques, aims to photorealistic editing single or multiple attributes of face images on demand using editing and generation models. Most existing methods are based on generative adversarial networks, using target attribute vectors to control the editing region or Gaussian noise as conditional input to capture texture details. However, these cannot better control the consistency of attributes in irrelevant regions, while the generation of fidelity is also limited. In this paper, we propose a method that uses an optimized latent space to fuse the attribute feature maps into the latent space. At the same time, make full use of the conditional information for additional constraints. Then, in the image generation phase, we use a progressive architecture for controlled editing of face attributes at different granularities. At last, we also conducted an ablation study on the selected training scheme further to demonstrate the stability and accuracy of our chosen method. The experiments show that our proposed approach, using an end-to-end progressive image translation network architecture, obtained qualitative (FID) as well as quantitative (LPIPS) face image editing results.
{"title":"Embedding diverse features in latent space for face attribute editing","authors":"Rui Yuan, Xiping He, Dan He, Yue Li","doi":"10.1117/12.2667748","DOIUrl":"https://doi.org/10.1117/12.2667748","url":null,"abstract":"Face attribute editing, one of the important research directions in face image synthesis and processing techniques, aims to photorealistic editing single or multiple attributes of face images on demand using editing and generation models. Most existing methods are based on generative adversarial networks, using target attribute vectors to control the editing region or Gaussian noise as conditional input to capture texture details. However, these cannot better control the consistency of attributes in irrelevant regions, while the generation of fidelity is also limited. In this paper, we propose a method that uses an optimized latent space to fuse the attribute feature maps into the latent space. At the same time, make full use of the conditional information for additional constraints. Then, in the image generation phase, we use a progressive architecture for controlled editing of face attributes at different granularities. At last, we also conducted an ablation study on the selected training scheme further to demonstrate the stability and accuracy of our chosen method. The experiments show that our proposed approach, using an end-to-end progressive image translation network architecture, obtained qualitative (FID) as well as quantitative (LPIPS) face image editing results.","PeriodicalId":345723,"journal":{"name":"Fifth International Conference on Computer Information Science and Artificial Intelligence","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125549720","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The use of blockchain technology in high-elastic power grids often requires the deployment of blockchain nodes in charging piles, substations, new energy vehicles and other equipment, rather than in traditional servers. Limited by equipment performance and deployment conditions, the technical implementation of blockchain also needs to be optimized accordingly. In this paper, a novel hash scheme without multiple iterations which is suitable for high-elastic power grid is proposed. The hash scheme is constructed using large scale bool functions, which meet the requirements of balance, nonlinearity and SAC. The characteristics of the hash algorithm are also suitable for hardware implementation, which can build hardware micro services in the deployment architecture of high-elastic power grids.
{"title":"A novel hash scheme for high elastic grid blockchain","authors":"Ying Yao, Xianke Zhou, Zhifei Pang, Yong Yan, Liangyu Zha","doi":"10.1117/12.2667491","DOIUrl":"https://doi.org/10.1117/12.2667491","url":null,"abstract":"The use of blockchain technology in high-elastic power grids often requires the deployment of blockchain nodes in charging piles, substations, new energy vehicles and other equipment, rather than in traditional servers. Limited by equipment performance and deployment conditions, the technical implementation of blockchain also needs to be optimized accordingly. In this paper, a novel hash scheme without multiple iterations which is suitable for high-elastic power grid is proposed. The hash scheme is constructed using large scale bool functions, which meet the requirements of balance, nonlinearity and SAC. The characteristics of the hash algorithm are also suitable for hardware implementation, which can build hardware micro services in the deployment architecture of high-elastic power grids.","PeriodicalId":345723,"journal":{"name":"Fifth International Conference on Computer Information Science and Artificial Intelligence","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125215011","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Guohan Ma, Q. Zheng, Jingfeng Wang, Tianyi Zhang, Da Chang, Xingli Li
Aiming at the problem of supply and demand that a large number of charging piles are idle, and the charging of some users is not satisfied, an Immune Algorithm (IA) based charging pile location optimization model is proposed. Give full consideration to affect the charging pile location of multivariate data, such as the data, the number of parking queued up for the charging data, etc., has established the mathematical model of charging pile location selection problem. Secondly, from the perspective of the user, based on the user to the shortest charging pile distance, time, at least for the target's location optimization model, in the regional scale adaptive search for charging pile location. Finally, through the simulation experiment, the rationality and effectiveness of the immune algorithm for optimizing the location of charging piles are verified, which provides a reference for the scientific location of charging piles.
{"title":"Research on optimization of charging pile siting based on immune algorithm","authors":"Guohan Ma, Q. Zheng, Jingfeng Wang, Tianyi Zhang, Da Chang, Xingli Li","doi":"10.1117/12.2668802","DOIUrl":"https://doi.org/10.1117/12.2668802","url":null,"abstract":"Aiming at the problem of supply and demand that a large number of charging piles are idle, and the charging of some users is not satisfied, an Immune Algorithm (IA) based charging pile location optimization model is proposed. Give full consideration to affect the charging pile location of multivariate data, such as the data, the number of parking queued up for the charging data, etc., has established the mathematical model of charging pile location selection problem. Secondly, from the perspective of the user, based on the user to the shortest charging pile distance, time, at least for the target's location optimization model, in the regional scale adaptive search for charging pile location. Finally, through the simulation experiment, the rationality and effectiveness of the immune algorithm for optimizing the location of charging piles are verified, which provides a reference for the scientific location of charging piles.","PeriodicalId":345723,"journal":{"name":"Fifth International Conference on Computer Information Science and Artificial Intelligence","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132014584","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ruijia Ma, Yanjia Luo, Ke-Fan Xie, Peng Li, Jie Wu
In the treatment of substations, it is very crucial to make a reasonable arrangement of route used for the maintenance of each substation. Moreover, given the urgency degree of different substations, the priority of each substation should be carefully considered for a good arrangement of route used for the maintenance. In this paper, considering the complexity of the routing arrangement, Genetic Algorithm (GA) and Ant Colony Optimization (ACO) were adopted with the designed priority coding methods and priority constraints for a more reasonable arrangement of route. Moreover, with the analysis of the performances of GA and ACO on the priority-based routing arrangement, a fused method was designed to obtain a good routing arrangement in an efficient manner. The experimental results show that, with the designed priority coding method and the priority constraints, a more reason result can be obtained by the fusion-based method.
{"title":"Substation priority maintenance planning based on genetic ant colony algorithm","authors":"Ruijia Ma, Yanjia Luo, Ke-Fan Xie, Peng Li, Jie Wu","doi":"10.1117/12.2667336","DOIUrl":"https://doi.org/10.1117/12.2667336","url":null,"abstract":"In the treatment of substations, it is very crucial to make a reasonable arrangement of route used for the maintenance of each substation. Moreover, given the urgency degree of different substations, the priority of each substation should be carefully considered for a good arrangement of route used for the maintenance. In this paper, considering the complexity of the routing arrangement, Genetic Algorithm (GA) and Ant Colony Optimization (ACO) were adopted with the designed priority coding methods and priority constraints for a more reasonable arrangement of route. Moreover, with the analysis of the performances of GA and ACO on the priority-based routing arrangement, a fused method was designed to obtain a good routing arrangement in an efficient manner. The experimental results show that, with the designed priority coding method and the priority constraints, a more reason result can be obtained by the fusion-based method.","PeriodicalId":345723,"journal":{"name":"Fifth International Conference on Computer Information Science and Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132658181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：