|
|
|
Best Route Finding Based on Cost in Multimodal Network With Care of Networks Constraints
Azadeh Keshtiarast
M.Sc. Student,
Department of Survey Engineering
K,N, Toosi university of Technology
a_keshtiarast@yahoo.com
Ali A. Alesheikh
Assistant Professor,
Faculty of Geodesy and Geomatics Eng.,
K,N, Toosi university of Technology
alesheikh@kntu.ac.ir
Ahad Kheirabadi
M.Sc. Student,
Faculty of Geodesy and Geomatics Eng.,
K,N, Toosi university of Technology
a_kheirabadi0@yahoo.com
Abstract:
Many people in metropolitans have to use different modes of transportation systems in daily intercity journey. Because of complicated, compacted and dynamic networks of public transportation in metropolitans, travelers face many problems to find the best route based on cost, time, and mode of transportation.
A traveler in intercity journey from an origin to a destination can use various mode of transportation such as private vehicle, walking, bus, metro, taxi or combination of these modes (Chulmin, 2001). So it is so essential to design an algorithm to solve the problem in multimodal network. Moreover the best route should be checked for being viable based on logical constraints and sequence of different modes.
The aim of this work is the consideration of various modes of transportation and their constraints and presents an algorithm to find the best route with combination of various modes of transportation based on cost and minimum change of mode in traveling.
Introduction
In most routes finding application in intercity transportation the base is on privately-owned car. In this manner, a person can find the best route for traveling from the origin to destination in shortest way and shortest time.
An efficient public transportation must take into consideration, the extension of metropolitans, the ever-increasing population and the expansion of air pollution spreading. The main difference between route finding in public-transportation network and privately-owned car is that a passenger in public transportation, in traveling between origin and destination, can use different modes of transportation such as metro, taxi, bus, minibus and even walking.
So for measuring time in best route finding, the time of changing modes of transportation for example metro to bus should be considered. The feasibility of the route is an important parameter in finding the best route. This quality is defined by some terms and constraint of the system. For example since metro network is connected, its trains boards and its speed in traveling is the best choice for modes of transportation, so a passenger should use it as much as possible. As a result a passenger can use the mode of metro only one time.
Since in some route finding algorithms, a collection of answer is made, the user preference can be act as a filter of achieving the one answer through all choices. Many users do not have a tendency to change their transportation mode in a travel. So the maximum number of changing mode enter as a system constraint to take the routes, and the minimum number of changing mode is the best route through all answers(Lozano and Storchi,1999). In large cities of Iran, for example Tehran as a metropolis, with high mass traffic and air pollution there are many problems for people in their daily intercity journey. So it is vitally importance to improve the public transportation system to decrease the privately-owned car journey in urban area. Moreover, In Tehran, because of restricted traffic area in downtown, there is no possibilities for people to go there with their private car.
On one hand, metro network with does not cover all over the city. On the other hand, bus network is so scattered all over the city, hence it is possible to achieve anywhere in the city by bus.
So the passengers have many problems in daily intercity journey to choose the best route in a multimodal network based on their time and cost and other preference terms.
In this work the condition and constraints of route finding in a multi modal network contained bus, metro and private car are considered and finally an algorithm to models these conditions in route finding are presented.
|
|
|