Finding the 'faster' path in vehicle routing
In this study, the authors improve the faster criterion in vehicle routing by extending the bi-delta distribution to the bi-normal distribution, which is a reasonable assumption for travel time on each road link. Based on this assumption, theoretical models are built for an arbitrary path and subseq...
Saved in:
Main Authors: | , , , , , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2017
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/8206 https://ink.library.smu.edu.sg/context/sis_research/article/9209/viewcontent/Finding_the__faster__path_in_vehicle_routing.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-9209 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-92092023-10-04T05:36:04Z Finding the 'faster' path in vehicle routing GUO, Jing WU, Yaoxin ZHANG, Xuexi ZHANG, Le CHEN, Wei CAO, Zhiguang GUO, Hongliang In this study, the authors improve the faster criterion in vehicle routing by extending the bi-delta distribution to the bi-normal distribution, which is a reasonable assumption for travel time on each road link. Based on this assumption, theoretical models are built for an arbitrary path and subsequently adopted to evaluate two candidate paths through probabilistic comparison. Experimental results demonstrate the bi-normal behaviour of link travel time in practice, and verify the faster criterion's superiority in determining the optimal path either on an artificial network with bi-normal distribution modelling link travel time or on a real road network with real traffic data. This study also validates that when the link number of one path is large, the probability density function of the whole path can be simplified by a normal distribution which approximates the sum of bi-normal distributions for each link. 2017-12-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/8206 info:doi/10.1049/iet-its.2016.0288 https://ink.library.smu.edu.sg/context/sis_research/article/9209/viewcontent/Finding_the__faster__path_in_vehicle_routing.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Vehicle routing Normal distribution Vehicle routing Bidelta distribution Road link Theoretical models Arbitrary path Link travel time Artificial network Binormal distribution modelling Real road network Real traffic data Probability density function Operations Research, Systems Engineering and Industrial Engineering |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Vehicle routing Normal distribution Vehicle routing Bidelta distribution Road link Theoretical models Arbitrary path Link travel time Artificial network Binormal distribution modelling Real road network Real traffic data Probability density function Operations Research, Systems Engineering and Industrial Engineering |
spellingShingle |
Vehicle routing Normal distribution Vehicle routing Bidelta distribution Road link Theoretical models Arbitrary path Link travel time Artificial network Binormal distribution modelling Real road network Real traffic data Probability density function Operations Research, Systems Engineering and Industrial Engineering GUO, Jing WU, Yaoxin ZHANG, Xuexi ZHANG, Le CHEN, Wei CAO, Zhiguang GUO, Hongliang Finding the 'faster' path in vehicle routing |
description |
In this study, the authors improve the faster criterion in vehicle routing by extending the bi-delta distribution to the bi-normal distribution, which is a reasonable assumption for travel time on each road link. Based on this assumption, theoretical models are built for an arbitrary path and subsequently adopted to evaluate two candidate paths through probabilistic comparison. Experimental results demonstrate the bi-normal behaviour of link travel time in practice, and verify the faster criterion's superiority in determining the optimal path either on an artificial network with bi-normal distribution modelling link travel time or on a real road network with real traffic data. This study also validates that when the link number of one path is large, the probability density function of the whole path can be simplified by a normal distribution which approximates the sum of bi-normal distributions for each link. |
format |
text |
author |
GUO, Jing WU, Yaoxin ZHANG, Xuexi ZHANG, Le CHEN, Wei CAO, Zhiguang GUO, Hongliang |
author_facet |
GUO, Jing WU, Yaoxin ZHANG, Xuexi ZHANG, Le CHEN, Wei CAO, Zhiguang GUO, Hongliang |
author_sort |
GUO, Jing |
title |
Finding the 'faster' path in vehicle routing |
title_short |
Finding the 'faster' path in vehicle routing |
title_full |
Finding the 'faster' path in vehicle routing |
title_fullStr |
Finding the 'faster' path in vehicle routing |
title_full_unstemmed |
Finding the 'faster' path in vehicle routing |
title_sort |
finding the 'faster' path in vehicle routing |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2017 |
url |
https://ink.library.smu.edu.sg/sis_research/8206 https://ink.library.smu.edu.sg/context/sis_research/article/9209/viewcontent/Finding_the__faster__path_in_vehicle_routing.pdf |
_version_ |
1779157225034481664 |