{"title":"路由计算的快速计算方法","authors":"Feng Wen, S. Mabu, K. Hirasawa","doi":"10.1109/MEC.2011.6025846","DOIUrl":null,"url":null,"abstract":"This paper introduces a speedup method for the optimal route calculation on large size road networks by preprocessing and pre-computing. A hierarchical network structure is constructed by separating a large network into several subnetworks. The boundary nodes partitioned the original network are new nodes in the higher level network. The new road sections on the multilevel network are decided by pre-computing the shortest path between the boundary nodes of each sub-network. A clustering method based on genetic algorithm is proposed. By the proposed method, the number of boundary nodes and road sections between boundary nodes of each sub-network can be reduced greatly. Then, the computational time for route calculation on this hierarchical network can be deceased sharply. Experimental results show that the efficiency of the proposed method.","PeriodicalId":386083,"journal":{"name":"2011 International Conference on Mechatronic Science, Electric Engineering and Computer (MEC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Fast computation method for route calculation\",\"authors\":\"Feng Wen, S. Mabu, K. Hirasawa\",\"doi\":\"10.1109/MEC.2011.6025846\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces a speedup method for the optimal route calculation on large size road networks by preprocessing and pre-computing. A hierarchical network structure is constructed by separating a large network into several subnetworks. The boundary nodes partitioned the original network are new nodes in the higher level network. The new road sections on the multilevel network are decided by pre-computing the shortest path between the boundary nodes of each sub-network. A clustering method based on genetic algorithm is proposed. By the proposed method, the number of boundary nodes and road sections between boundary nodes of each sub-network can be reduced greatly. Then, the computational time for route calculation on this hierarchical network can be deceased sharply. Experimental results show that the efficiency of the proposed method.\",\"PeriodicalId\":386083,\"journal\":{\"name\":\"2011 International Conference on Mechatronic Science, Electric Engineering and Computer (MEC)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Mechatronic Science, Electric Engineering and Computer (MEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MEC.2011.6025846\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Mechatronic Science, Electric Engineering and Computer (MEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MEC.2011.6025846","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper introduces a speedup method for the optimal route calculation on large size road networks by preprocessing and pre-computing. A hierarchical network structure is constructed by separating a large network into several subnetworks. The boundary nodes partitioned the original network are new nodes in the higher level network. The new road sections on the multilevel network are decided by pre-computing the shortest path between the boundary nodes of each sub-network. A clustering method based on genetic algorithm is proposed. By the proposed method, the number of boundary nodes and road sections between boundary nodes of each sub-network can be reduced greatly. Then, the computational time for route calculation on this hierarchical network can be deceased sharply. Experimental results show that the efficiency of the proposed method.