efficient routing of emergency vehicles under uncertain urban traffic conditions急救车辆在不确定的城市交通条件下的高效路由.pdfVIP

下载本文档

0
0
约5.12万字
约 8页
2017-08-28 发布于上海
举报
版权申诉

efficient routing of emergency vehicles under uncertain urban traffic conditions急救车辆在不确定的城市交通条件下的高效路由.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

efficient routing of emergency vehicles under uncertain urban traffic conditions急救车辆在不确定的城市交通条件下的高效路由

Journal of Service Science and Management, 2012, 5, 241-248 241 /10.4236/jssm.2012.53029 Published Online September 2012 (http://www.SciRP.org/journal/jssm) Efficient Routing of Emergency Vehicles under Uncertain Urban Traffic Conditions Amir Elalouf Department of Management, Bar-Ilan University, Ramat Gan, Israel. Email: amir.elalouf@biu.ac.il Received May 22nd, 2012; revised June 20th, 2012; accepted July 2nd, 2012 ABSTRACT Emergency-vehicle drivers who aim to reach their destinations through the fastest possible routes cannot rely solely on expected average travel times. Instead, the drivers should combine this travel-time information with the characteristics of data variation and then select the best or optimal route. The problem can be formulated on a graph in which the origin point and destination point are given. To each arc in the graph a random variable is assigned, characterized by the ex- pected time to traverse the arc and the variance of that time. The problem is then to minimize the total origin-destination expected time, subject to the constraint that the variance of the travel time does not exceed a given threshold. This paper proposes an exact pseudo-polynomial algorithm and an ε-approximation algorithm (so-called FPTAS) for this problem. The model and algorithms were tested using real-life data of travel times under uncertain urban traffic conditions and demonstrated favorable computational results. Keywords: Fast Routing Algorithm; FPTAS; Dynamic Programming 1. Introduction mulated as a constrained shortest-path problem that can help the dispatcher to make decisions. The problem is The public’s concern for safety and improving quality of