{"title":"突发性交通拥堵下的在线交通问题","authors":"Hu Mao-Lin","doi":"10.1109/SPAC.2014.6982707","DOIUrl":null,"url":null,"abstract":"We study the online transportation problem with the sudden traffic congestions where the running time of online vehicles is our optimization objective. We consider an optimal combination of the Greedy Strategy, the Reposition Strategy and the Waiting strategy for the online scheduling of vehicles, as result a Harmonic Strategy with online algorithm model is given in compensation of the disadvantages of the three basic strategy. By analyzing the competitive ratio and competitive performance of the Harmonic Strategy, the result comes clearly to show that the Harmonic Strategy harmonizes well the three strategies and makes some progress towards the competitive performance.","PeriodicalId":326246,"journal":{"name":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The online transportation problem with the sudden traffic congestions\",\"authors\":\"Hu Mao-Lin\",\"doi\":\"10.1109/SPAC.2014.6982707\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the online transportation problem with the sudden traffic congestions where the running time of online vehicles is our optimization objective. We consider an optimal combination of the Greedy Strategy, the Reposition Strategy and the Waiting strategy for the online scheduling of vehicles, as result a Harmonic Strategy with online algorithm model is given in compensation of the disadvantages of the three basic strategy. By analyzing the competitive ratio and competitive performance of the Harmonic Strategy, the result comes clearly to show that the Harmonic Strategy harmonizes well the three strategies and makes some progress towards the competitive performance.\",\"PeriodicalId\":326246,\"journal\":{\"name\":\"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPAC.2014.6982707\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 2014 IEEE International Conference on Security, Pattern Analysis, and Cybernetics (SPAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAC.2014.6982707","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The online transportation problem with the sudden traffic congestions
We study the online transportation problem with the sudden traffic congestions where the running time of online vehicles is our optimization objective. We consider an optimal combination of the Greedy Strategy, the Reposition Strategy and the Waiting strategy for the online scheduling of vehicles, as result a Harmonic Strategy with online algorithm model is given in compensation of the disadvantages of the three basic strategy. By analyzing the competitive ratio and competitive performance of the Harmonic Strategy, the result comes clearly to show that the Harmonic Strategy harmonizes well the three strategies and makes some progress towards the competitive performance.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
