A multiagent-based approach for vehicle routing by considering both arriving on time and total travel time

Arriving on time and total travel time are two important properties for vehicle routing. Existing route guidance approaches always consider them independently, because they may conflict with each other. In this article, we develop a semi-decentralized multiagent-based vehicle routing approach where...

全面介紹

Saved in:
書目詳細資料
Main Authors: Cao, Zhiguang, Guo, Hongliang, Zhang, Jie
其他作者: School of Computer Science and Engineering
格式: Article
語言:English
出版: 2019
主題:
在線閱讀:https://hdl.handle.net/10356/84440
http://hdl.handle.net/10220/49185
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Nanyang Technological University
語言: English
id sg-ntu-dr.10356-84440
record_format dspace
spelling sg-ntu-dr.10356-844402020-03-07T11:48:56Z A multiagent-based approach for vehicle routing by considering both arriving on time and total travel time Cao, Zhiguang Guo, Hongliang Zhang, Jie School of Computer Science and Engineering Intelligent Transportation Systems Multiagent-based Route Guidance Engineering::Computer science and engineering Arriving on time and total travel time are two important properties for vehicle routing. Existing route guidance approaches always consider them independently, because they may conflict with each other. In this article, we develop a semi-decentralized multiagent-based vehicle routing approach where vehicle agents follow the local route guidance by infrastructure agents at each intersection, and infrastructure agents perform the route guidance by solving a route assignment problem. It integrates the two properties by expressing them as two objective terms of the route assignment problem. Regarding arriving on time, it is formulated based on the probability tail model, which aims to maximize the probability of reaching destination before deadline. Regarding total travel time, it is formulated as a weighted quadratic term, which aims to minimize the expected travel time from the current location to the destination based on the potential route assignment. The weight for total travel time is designed to be comparatively large if the deadline is loose. Additionally, we improve the proposed approach in two aspects, including travel time prediction and computational efficiency. Experimental results on real road networks justify its ability to increase the average probability of arriving on time, reduce total travel time, and enhance the overall routing performance. MOE (Min. of Education, S’pore) Accepted version 2019-07-09T01:46:33Z 2019-12-06T15:45:16Z 2019-07-09T01:46:33Z 2019-12-06T15:45:16Z 2018 Journal Article Cao, Z., Guo, H., & Zhang, J. (2018). A multiagent-based approach for vehicle routing by considering both arriving on time and total travel time. ACM Transactions on Intelligent Systems and Technology, 9(3), 25-. doi:10.1145/3078847 2157-6904 https://hdl.handle.net/10356/84440 http://hdl.handle.net/10220/49185 10.1145/3078847 en ACM Transactions on Intelligent Systems and Technology © 2017 ACM. All rights reserved. This paper was published by ACM in ACM Transactions on Intelligent Systems and Technology and is made available with permission of ACM. 22 p. application/pdf
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic Intelligent Transportation Systems
Multiagent-based Route Guidance
Engineering::Computer science and engineering
spellingShingle Intelligent Transportation Systems
Multiagent-based Route Guidance
Engineering::Computer science and engineering
Cao, Zhiguang
Guo, Hongliang
Zhang, Jie
A multiagent-based approach for vehicle routing by considering both arriving on time and total travel time
description Arriving on time and total travel time are two important properties for vehicle routing. Existing route guidance approaches always consider them independently, because they may conflict with each other. In this article, we develop a semi-decentralized multiagent-based vehicle routing approach where vehicle agents follow the local route guidance by infrastructure agents at each intersection, and infrastructure agents perform the route guidance by solving a route assignment problem. It integrates the two properties by expressing them as two objective terms of the route assignment problem. Regarding arriving on time, it is formulated based on the probability tail model, which aims to maximize the probability of reaching destination before deadline. Regarding total travel time, it is formulated as a weighted quadratic term, which aims to minimize the expected travel time from the current location to the destination based on the potential route assignment. The weight for total travel time is designed to be comparatively large if the deadline is loose. Additionally, we improve the proposed approach in two aspects, including travel time prediction and computational efficiency. Experimental results on real road networks justify its ability to increase the average probability of arriving on time, reduce total travel time, and enhance the overall routing performance.
author2 School of Computer Science and Engineering
author_facet School of Computer Science and Engineering
Cao, Zhiguang
Guo, Hongliang
Zhang, Jie
format Article
author Cao, Zhiguang
Guo, Hongliang
Zhang, Jie
author_sort Cao, Zhiguang
title A multiagent-based approach for vehicle routing by considering both arriving on time and total travel time
title_short A multiagent-based approach for vehicle routing by considering both arriving on time and total travel time
title_full A multiagent-based approach for vehicle routing by considering both arriving on time and total travel time
title_fullStr A multiagent-based approach for vehicle routing by considering both arriving on time and total travel time
title_full_unstemmed A multiagent-based approach for vehicle routing by considering both arriving on time and total travel time
title_sort multiagent-based approach for vehicle routing by considering both arriving on time and total travel time
publishDate 2019
url https://hdl.handle.net/10356/84440
http://hdl.handle.net/10220/49185
_version_ 1681047374398488576