公交网络最优路径选择的DNA算法

2009 Fourth International on Conference on Bio-Inspired Computing Pub Date : 2009-11-17 DOI:10.1109/BICTA.2009.5338116

Qian Zhang, Enqi Xu, Zhenye Wang, Yafei Dong

{"title":"公交网络最优路径选择的DNA算法","authors":"Qian Zhang, Enqi Xu, Zhenye Wang, Yafei Dong","doi":"10.1109/BICTA.2009.5338116","DOIUrl":null,"url":null,"abstract":"Through the analysis of the transit network solution of optimal path algorithm, this paper proposes the bus route optimization algorithm of DNA to consider both the shortest distance by bus and the minimum interchange, and gives a detailed biological process. It not only puts forward a new feasible algorithm for transit network optimal path search, but also provides an practical opportunity for the theory of DNA computation.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"DNA algorithm on optimal path selection for bus travel network\",\"authors\":\"Qian Zhang, Enqi Xu, Zhenye Wang, Yafei Dong\",\"doi\":\"10.1109/BICTA.2009.5338116\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Through the analysis of the transit network solution of optimal path algorithm, this paper proposes the bus route optimization algorithm of DNA to consider both the shortest distance by bus and the minimum interchange, and gives a detailed biological process. It not only puts forward a new feasible algorithm for transit network optimal path search, but also provides an practical opportunity for the theory of DNA computation.\",\"PeriodicalId\":161787,\"journal\":{\"name\":\"2009 Fourth International on Conference on Bio-Inspired Computing\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Fourth International on Conference on Bio-Inspired Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BICTA.2009.5338116\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fourth International on Conference on Bio-Inspired Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BICTA.2009.5338116","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

通过对公交网络最优路径算法求解的分析，提出了兼顾公交最短距离和最小换乘的DNA公交路线优化算法，并给出了详细的生物过程。它不仅提出了一种新的可行的公交网络最优路径搜索算法，而且为DNA计算理论提供了实践机会。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

DNA algorithm on optimal path selection for bus travel network

Through the analysis of the transit network solution of optimal path algorithm, this paper proposes the bus route optimization algorithm of DNA to consider both the shortest distance by bus and the minimum interchange, and gives a detailed biological process. It not only puts forward a new feasible algorithm for transit network optimal path search, but also provides an practical opportunity for the theory of DNA computation.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 Fourth International on Conference on Bio-Inspired Computing

自引率

0.00%

发文量