随机时变搭便车问题的最优路线规划

IF 1.2 Q4 TELECOMMUNICATIONS

Journal of Location Based Services Pub Date : 2020-01-02 DOI:10.1080/17489725.2019.1682202

O. Vedernikov, L. Kulik, K. Ramamohanarao

{"title":"随机时变搭便车问题的最优路线规划","authors":"O. Vedernikov, L. Kulik, K. Ramamohanarao","doi":"10.1080/17489725.2019.1682202","DOIUrl":null,"url":null,"abstract":"ABSTRACT Hitchhiking is a travel mode characterised by unpredictable travel times involving several possible combinations of lifts on roads. In this paper, we formulate a hitchhiker’s problem and develop a time-dependent stochastic route planning algorithm for hitchhikers. Namely, we introduce a concept of the stochastic time-dependent hitchhiking graph to find hitchhiking strategies with the least expected travel time or maximised reliability. We introduce various heuristics to prune the original hitchhiking graph to improve computational efficiency. We provide a complexity analysis of the problem and evaluate the proposed solution on real-world networks of several countries.","PeriodicalId":44932,"journal":{"name":"Journal of Location Based Services","volume":"14 1","pages":"1 - 27"},"PeriodicalIF":1.2000,"publicationDate":"2020-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/17489725.2019.1682202","citationCount":"2","resultStr":"{\"title\":\"Optimal route planning for stochastic time-dependent hitchhiker’s problem\",\"authors\":\"O. Vedernikov, L. Kulik, K. Ramamohanarao\",\"doi\":\"10.1080/17489725.2019.1682202\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT Hitchhiking is a travel mode characterised by unpredictable travel times involving several possible combinations of lifts on roads. In this paper, we formulate a hitchhiker’s problem and develop a time-dependent stochastic route planning algorithm for hitchhikers. Namely, we introduce a concept of the stochastic time-dependent hitchhiking graph to find hitchhiking strategies with the least expected travel time or maximised reliability. We introduce various heuristics to prune the original hitchhiking graph to improve computational efficiency. We provide a complexity analysis of the problem and evaluate the proposed solution on real-world networks of several countries.\",\"PeriodicalId\":44932,\"journal\":{\"name\":\"Journal of Location Based Services\",\"volume\":\"14 1\",\"pages\":\"1 - 27\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2020-01-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1080/17489725.2019.1682202\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Location Based Services\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/17489725.2019.1682202\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"TELECOMMUNICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Location Based Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/17489725.2019.1682202","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}

引用次数: 2

摘要

搭便车是一种旅行方式，其特征是不可预测的旅行时间，涉及道路上几种可能的电梯组合。本文提出了一个搭便车者问题，并提出了一个随时间变化的随机路线规划算法。也就是说，我们引入随机时间相关搭便车图的概念来寻找具有最小期望旅行时间或最大可靠性的搭便车策略。为了提高计算效率，我们引入了各种启发式方法对原始搭便车图进行剪枝。我们对该问题进行了复杂性分析，并在几个国家的实际网络中评估了提出的解决方案。

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

查看原文本刊更多论文

Optimal route planning for stochastic time-dependent hitchhiker’s problem

ABSTRACT Hitchhiking is a travel mode characterised by unpredictable travel times involving several possible combinations of lifts on roads. In this paper, we formulate a hitchhiker’s problem and develop a time-dependent stochastic route planning algorithm for hitchhikers. Namely, we introduce a concept of the stochastic time-dependent hitchhiking graph to find hitchhiking strategies with the least expected travel time or maximised reliability. We introduce various heuristics to prune the original hitchhiking graph to improve computational efficiency. We provide a complexity analysis of the problem and evaluate the proposed solution on real-world networks of several countries.

求助全文

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

来源期刊

Journal of Location Based Services TELECOMMUNICATIONS-

CiteScore

3.70

自引率

8.70%

发文量

期刊介绍： The aim of this interdisciplinary and international journal is to provide a forum for the exchange of original ideas, techniques, designs and experiences in the rapidly growing field of location based services on networked mobile devices. It is intended to interest those who design, implement and deliver location based services in a wide range of contexts. Published research will span the field from location based computing and next-generation interfaces through telecom location architectures to business models and the social implications of this technology. The diversity of content echoes the extended nature of the chain of players required to make location based services a reality.