Time-based Voronoi Diagram and Transportation Network Pricing
Date Issued
2006
Date
2006
Author(s)
Wang, Wei-Bung
DOI
zh-TW
Abstract
We have two main topics in this thesis. These topics are concerned with a model that involves straight-line highways.
In chapter 2 we consider a variation of Voronoi diagram, or time-based Voronoi diagram, for a set S of sites in the presence of transportation lines or highways in the plane. A shortest time-distance path from a query point to any given sites in S is a path that takes the least travelling time. The travelling speeds and hence travelling times of the subpaths along the highways and in the plane are different. Using different distance metrics will change the characteristics of the Voronoi diagram.
In chapter 3 we consider a game model called Stackelberg game [1]. With a set of source-destination pairs in the presence of transportation network in the plane, the owner of the network can decide a fare charge on the usage of the transportation network. We assume that each customer at a source will try to minimize his cost when travelling to the destination, with or without using the network. Under this assumption we play the role of the transportation network owner and try to maximize our profit by deciding a good fare.
Subjects
Voronoi diagram
price
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-95-R93922006-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):6003c96bf5aba3bec83377a75391a606