{"title":"高效的大规模道路检测路径","authors":"Yujie Chen, P. Cowling, Stephen Remde, F. Polack","doi":"10.5220/0005749203040312","DOIUrl":null,"url":null,"abstract":"Gaist Solutions Ltd. carries out large scale surveys for UK road inspection. To estimate the total distance that vehicles travel, we model routing as a Chinese Postman Problem. We propose a novel graph reduction approach that dramatically speeds up the calculation of the Chinese Postman Tour for large-scale road networks. Because the analysis of large road-network graphs is now possible, planners can explore the effects of changes to traditional inspection techniques and scheduling. Case studies of road networks from six UK cities and the county of Norfolk are tested. The graph reduction process is also analysed on ten randomly generated road networks with different characteristics, to show its ability and give advice for suitable use.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Efficient Large-scale Road Inspection Routing\",\"authors\":\"Yujie Chen, P. Cowling, Stephen Remde, F. Polack\",\"doi\":\"10.5220/0005749203040312\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Gaist Solutions Ltd. carries out large scale surveys for UK road inspection. To estimate the total distance that vehicles travel, we model routing as a Chinese Postman Problem. We propose a novel graph reduction approach that dramatically speeds up the calculation of the Chinese Postman Tour for large-scale road networks. Because the analysis of large road-network graphs is now possible, planners can explore the effects of changes to traditional inspection techniques and scheduling. Case studies of road networks from six UK cities and the county of Norfolk are tested. The graph reduction process is also analysed on ten randomly generated road networks with different characteristics, to show its ability and give advice for suitable use.\",\"PeriodicalId\":235376,\"journal\":{\"name\":\"International Conference on Operations Research and Enterprise Systems\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Operations Research and Enterprise Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5220/0005749203040312\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Operations Research and Enterprise Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5220/0005749203040312","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Gaist Solutions Ltd. carries out large scale surveys for UK road inspection. To estimate the total distance that vehicles travel, we model routing as a Chinese Postman Problem. We propose a novel graph reduction approach that dramatically speeds up the calculation of the Chinese Postman Tour for large-scale road networks. Because the analysis of large road-network graphs is now possible, planners can explore the effects of changes to traditional inspection techniques and scheduling. Case studies of road networks from six UK cities and the county of Norfolk are tested. The graph reduction process is also analysed on ten randomly generated road networks with different characteristics, to show its ability and give advice for suitable use.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
