Loading…
Time-optimal and privacy preserving route planning for carpool policy
To alleviate the traffic congestion caused by the sharp increase in the number of private cars and save commuting costs, taxi carpooling service has become the choice of many people. Current research on taxi carpooling services has focused on shortening the detour distances. While with the developme...
Saved in:
Published in: | World wide web (Bussum) 2022-05, Vol.25 (3), p.1151-1168 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c363t-b4a875b2cc2be98392b0f2cbf4ab1eed526602b83caef4c54c7bd0bbb1702a583 |
---|---|
cites | cdi_FETCH-LOGICAL-c363t-b4a875b2cc2be98392b0f2cbf4ab1eed526602b83caef4c54c7bd0bbb1702a583 |
container_end_page | 1168 |
container_issue | 3 |
container_start_page | 1151 |
container_title | World wide web (Bussum) |
container_volume | 25 |
creator | Zhu, Congcong Ye, Dayong Zhu, Tianqing Zhou, Wanlei |
description | To alleviate the traffic congestion caused by the sharp increase in the number of private cars and save commuting costs, taxi carpooling service has become the choice of many people. Current research on taxi carpooling services has focused on shortening the detour distances. While with the development of intelligent cities, efficiently match passengers and vehicles and planning routes become urgent. And the privacy between passengers in the taxi carpooling service also needs to be considered. In this paper, we propose a time-optimal and privacy-preserving carpool route planning system via deep reinforcement learning. This system uses the traffic information around the carpooling vehicle to optimize passengers’ travel time, not only to efficiently match passengers and vehicles but also to generate detailed route planning for carpooling vehicles. We conducted experiments on an Internet of Vehicles simulator CARLA, and the results demonstrate that our method is better than other advanced methods and has better performance in complex environments. |
doi_str_mv | 10.1007/s11280-022-01026-1 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2662167862</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2662167862</sourcerecordid><originalsourceid>FETCH-LOGICAL-c363t-b4a875b2cc2be98392b0f2cbf4ab1eed526602b83caef4c54c7bd0bbb1702a583</originalsourceid><addsrcrecordid>eNp9kE9LAzEQxYMoWKtfwNOC5-jMZDe7PUqpVih4qeAtJGm2bNlu1mRb6Lc3dQVvnuYP771hfozdIzwiQPkUEakCDkQcEEhyvGATLErBMUdxmXpRpWVefF6zmxh3ACDFDCdssW72jvt-aPa6zXS3yfrQHLU9peqiC8em22bBHwaX9a3uuvNY-5BZHXrv26z3bWNPt-yq1m10d791yj5eFuv5kq_eX9_mzytuhRQDN7muysKQtWTcrBIzMlCTNXWuDTq3KUhKIFMJq12d2yK3pdmAMQZLIF1UYsoextw--K-Di4Pa-UPo0kmVrISyrCQlFY0qG3yMwdUq_bTX4aQQ1BmXGnGphEv94FKYTGI0xSTuti78Rf_j-ganHG5D</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2662167862</pqid></control><display><type>article</type><title>Time-optimal and privacy preserving route planning for carpool policy</title><source>Springer Nature:Jisc Collections:Springer Nature Read and Publish 2023-2025: Springer Reading List</source><creator>Zhu, Congcong ; Ye, Dayong ; Zhu, Tianqing ; Zhou, Wanlei</creator><creatorcontrib>Zhu, Congcong ; Ye, Dayong ; Zhu, Tianqing ; Zhou, Wanlei</creatorcontrib><description>To alleviate the traffic congestion caused by the sharp increase in the number of private cars and save commuting costs, taxi carpooling service has become the choice of many people. Current research on taxi carpooling services has focused on shortening the detour distances. While with the development of intelligent cities, efficiently match passengers and vehicles and planning routes become urgent. And the privacy between passengers in the taxi carpooling service also needs to be considered. In this paper, we propose a time-optimal and privacy-preserving carpool route planning system via deep reinforcement learning. This system uses the traffic information around the carpooling vehicle to optimize passengers’ travel time, not only to efficiently match passengers and vehicles but also to generate detailed route planning for carpooling vehicles. We conducted experiments on an Internet of Vehicles simulator CARLA, and the results demonstrate that our method is better than other advanced methods and has better performance in complex environments.</description><identifier>ISSN: 1386-145X</identifier><identifier>EISSN: 1573-1413</identifier><identifier>DOI: 10.1007/s11280-022-01026-1</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Airline security ; Automobiles ; Car pools ; Computer Science ; Database Management ; Information Systems Applications (incl.Internet) ; Internet of Vehicles ; Operating Systems ; Optimization ; Passengers ; Privacy ; Route planning ; Special Issue on Web Intelligence = Artificial Intelligence in the Connected World ; Taxicabs ; Traffic congestion ; Traffic information ; Traffic planning ; Travel time</subject><ispartof>World wide web (Bussum), 2022-05, Vol.25 (3), p.1151-1168</ispartof><rights>The Author(s) 2022</rights><rights>The Author(s) 2022. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c363t-b4a875b2cc2be98392b0f2cbf4ab1eed526602b83caef4c54c7bd0bbb1702a583</citedby><cites>FETCH-LOGICAL-c363t-b4a875b2cc2be98392b0f2cbf4ab1eed526602b83caef4c54c7bd0bbb1702a583</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Zhu, Congcong</creatorcontrib><creatorcontrib>Ye, Dayong</creatorcontrib><creatorcontrib>Zhu, Tianqing</creatorcontrib><creatorcontrib>Zhou, Wanlei</creatorcontrib><title>Time-optimal and privacy preserving route planning for carpool policy</title><title>World wide web (Bussum)</title><addtitle>World Wide Web</addtitle><description>To alleviate the traffic congestion caused by the sharp increase in the number of private cars and save commuting costs, taxi carpooling service has become the choice of many people. Current research on taxi carpooling services has focused on shortening the detour distances. While with the development of intelligent cities, efficiently match passengers and vehicles and planning routes become urgent. And the privacy between passengers in the taxi carpooling service also needs to be considered. In this paper, we propose a time-optimal and privacy-preserving carpool route planning system via deep reinforcement learning. This system uses the traffic information around the carpooling vehicle to optimize passengers’ travel time, not only to efficiently match passengers and vehicles but also to generate detailed route planning for carpooling vehicles. We conducted experiments on an Internet of Vehicles simulator CARLA, and the results demonstrate that our method is better than other advanced methods and has better performance in complex environments.</description><subject>Airline security</subject><subject>Automobiles</subject><subject>Car pools</subject><subject>Computer Science</subject><subject>Database Management</subject><subject>Information Systems Applications (incl.Internet)</subject><subject>Internet of Vehicles</subject><subject>Operating Systems</subject><subject>Optimization</subject><subject>Passengers</subject><subject>Privacy</subject><subject>Route planning</subject><subject>Special Issue on Web Intelligence = Artificial Intelligence in the Connected World</subject><subject>Taxicabs</subject><subject>Traffic congestion</subject><subject>Traffic information</subject><subject>Traffic planning</subject><subject>Travel time</subject><issn>1386-145X</issn><issn>1573-1413</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><recordid>eNp9kE9LAzEQxYMoWKtfwNOC5-jMZDe7PUqpVih4qeAtJGm2bNlu1mRb6Lc3dQVvnuYP771hfozdIzwiQPkUEakCDkQcEEhyvGATLErBMUdxmXpRpWVefF6zmxh3ACDFDCdssW72jvt-aPa6zXS3yfrQHLU9peqiC8em22bBHwaX9a3uuvNY-5BZHXrv26z3bWNPt-yq1m10d791yj5eFuv5kq_eX9_mzytuhRQDN7muysKQtWTcrBIzMlCTNXWuDTq3KUhKIFMJq12d2yK3pdmAMQZLIF1UYsoextw--K-Di4Pa-UPo0kmVrISyrCQlFY0qG3yMwdUq_bTX4aQQ1BmXGnGphEv94FKYTGI0xSTuti78Rf_j-ganHG5D</recordid><startdate>20220501</startdate><enddate>20220501</enddate><creator>Zhu, Congcong</creator><creator>Ye, Dayong</creator><creator>Zhu, Tianqing</creator><creator>Zhou, Wanlei</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>C6C</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7XB</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope></search><sort><creationdate>20220501</creationdate><title>Time-optimal and privacy preserving route planning for carpool policy</title><author>Zhu, Congcong ; Ye, Dayong ; Zhu, Tianqing ; Zhou, Wanlei</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c363t-b4a875b2cc2be98392b0f2cbf4ab1eed526602b83caef4c54c7bd0bbb1702a583</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Airline security</topic><topic>Automobiles</topic><topic>Car pools</topic><topic>Computer Science</topic><topic>Database Management</topic><topic>Information Systems Applications (incl.Internet)</topic><topic>Internet of Vehicles</topic><topic>Operating Systems</topic><topic>Optimization</topic><topic>Passengers</topic><topic>Privacy</topic><topic>Route planning</topic><topic>Special Issue on Web Intelligence = Artificial Intelligence in the Connected World</topic><topic>Taxicabs</topic><topic>Traffic congestion</topic><topic>Traffic information</topic><topic>Traffic planning</topic><topic>Travel time</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhu, Congcong</creatorcontrib><creatorcontrib>Ye, Dayong</creatorcontrib><creatorcontrib>Zhu, Tianqing</creatorcontrib><creatorcontrib>Zhou, Wanlei</creatorcontrib><collection>Springer Nature OA Free Journals</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>World wide web (Bussum)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhu, Congcong</au><au>Ye, Dayong</au><au>Zhu, Tianqing</au><au>Zhou, Wanlei</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Time-optimal and privacy preserving route planning for carpool policy</atitle><jtitle>World wide web (Bussum)</jtitle><stitle>World Wide Web</stitle><date>2022-05-01</date><risdate>2022</risdate><volume>25</volume><issue>3</issue><spage>1151</spage><epage>1168</epage><pages>1151-1168</pages><issn>1386-145X</issn><eissn>1573-1413</eissn><abstract>To alleviate the traffic congestion caused by the sharp increase in the number of private cars and save commuting costs, taxi carpooling service has become the choice of many people. Current research on taxi carpooling services has focused on shortening the detour distances. While with the development of intelligent cities, efficiently match passengers and vehicles and planning routes become urgent. And the privacy between passengers in the taxi carpooling service also needs to be considered. In this paper, we propose a time-optimal and privacy-preserving carpool route planning system via deep reinforcement learning. This system uses the traffic information around the carpooling vehicle to optimize passengers’ travel time, not only to efficiently match passengers and vehicles but also to generate detailed route planning for carpooling vehicles. We conducted experiments on an Internet of Vehicles simulator CARLA, and the results demonstrate that our method is better than other advanced methods and has better performance in complex environments.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11280-022-01026-1</doi><tpages>18</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1386-145X |
ispartof | World wide web (Bussum), 2022-05, Vol.25 (3), p.1151-1168 |
issn | 1386-145X 1573-1413 |
language | eng |
recordid | cdi_proquest_journals_2662167862 |
source | Springer Nature:Jisc Collections:Springer Nature Read and Publish 2023-2025: Springer Reading List |
subjects | Airline security Automobiles Car pools Computer Science Database Management Information Systems Applications (incl.Internet) Internet of Vehicles Operating Systems Optimization Passengers Privacy Route planning Special Issue on Web Intelligence = Artificial Intelligence in the Connected World Taxicabs Traffic congestion Traffic information Traffic planning Travel time |
title | Time-optimal and privacy preserving route planning for carpool policy |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T16%3A32%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Time-optimal%20and%20privacy%20preserving%20route%20planning%20for%20carpool%20policy&rft.jtitle=World%20wide%20web%20(Bussum)&rft.au=Zhu,%20Congcong&rft.date=2022-05-01&rft.volume=25&rft.issue=3&rft.spage=1151&rft.epage=1168&rft.pages=1151-1168&rft.issn=1386-145X&rft.eissn=1573-1413&rft_id=info:doi/10.1007/s11280-022-01026-1&rft_dat=%3Cproquest_cross%3E2662167862%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c363t-b4a875b2cc2be98392b0f2cbf4ab1eed526602b83caef4c54c7bd0bbb1702a583%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2662167862&rft_id=info:pmid/&rfr_iscdi=true |