scholarly journals Optimal Route Computation for Public Transport with Minimum Travelling Time & Travel Cost: A Case Study of Pokhara City

2019 ◽  
Vol 1 (1) ◽  
pp. 79-86
Author(s):  
R. Thapa ◽  
J.K. Shrestha
Keyword(s):  
Travel Time ◽  
Shortest Path ◽  
Public Transportation ◽  
Transportation Network ◽  
Optimal Path ◽  
Travel Cost ◽  
Transit Network ◽  
Final Destination ◽  
Travelling Time

In road networks, it is imperative to discover a shortest way to reach the final destination. When an individual is new to a place, lots of time is wasted in finding the destination. With the advancement of technology, various navigation applications have been developed for guiding private vehicles, but few are designed for public transportation. This study is solely concentrated on finding the possible shortest path in terms of minimum time and cost to reach specific destination for an individual. It requires an appropriate algorithm to search the shortest path. With the implementation of Dijkstra’s algorithm, the shortest path with respect to minimum travel time and travel cost was computed. Public transportation network of Pokhara city was taken for the case study of this research. The results of this analysis indicated that when the “time” impedance was used by the algorithm, it generated the shortest path between the origin and destination along with the path to be followed. This study formulates a framework for generating itinerary for passengers in a transit network that allows the user to find the optimal path with minimum travel time and cost.

Transit networks, social contacts and open data meet public transportation plans for post-COVID-19: A Canadian case study

2021 ◽  
Author(s):  
Oliver Benning ◽  
Jonathan Calles ◽  
Burak Kantarci ◽  
Shahzad Khan
Keyword(s):  
Public Transportation ◽  
Population Distribution ◽  
Open Data ◽  
Practical Method ◽  
Municipal Services ◽  
Transit Network ◽  
Research Findings ◽  
Pandemic Response ◽  
The Impact

This article presents a practical method for the assessment of the risk profiles of communities by tracking / acquiring, fusing and analyzing data from public transportation, district population distribution, passenger interactions and cross-locality travel data. The proposed framework fuses these data sources into a realistic simulation of a transit network for a given time span. By shedding credible insights into the impact of public transit on pandemic spread, the research findings will help to set the groundwork for tools that could provide pandemic response teams and municipalities with a robust framework for the evaluations of city districts most at risk, and how to adjust municipal services accordingly.

Simulating individual work trips for transit-facilitated accessibility study

2017 ◽  
Vol 46 (1) ◽  
pp. 84-102 ◽  
Author(s):  
Ruihong Huang
Keyword(s):  
Inner City ◽  
Public Transportation ◽  
Road Network ◽  
Agent Based ◽  
Census Tracts ◽  
Transit Network ◽  
Demographic Profiles ◽  
Individual Work ◽  
Job Opportunities

To measure job accessibility, person-based approaches have the advantage to capture all accessibility components: land use, transportation system, individual’s mobility and travel preference, as well as individual’s space and time constraints. This makes person-based approaches more favorable than traditional aggregated approaches in recent years. However, person-based accessibility measures require detailed individual trip data which are very difficult and expensive to acquire, especially at large scales. In addition, traveling by public transportation is a highly time sensitive activity, which can hardly be handled by traditional accessibility measures. This paper presents an agent-based model for simulating individual work trips in hoping to provide an alternative or supplementary solution to person-based accessibility study. In the model, population is simulated as three levels of agents: census tracts, households, and individual workers. And job opportunities (businesses) are simulated as employer agents. Census tract agents have the ability to generate household and worker agents based on their demographic profiles and a road network. Worker agents are the most active agents that can search jobs and find the best paths for commuting. Employer agents can estimate the number of transit-dependent employees, hire workers, and update vacancies. A case study is conducted in the Milwaukee metropolitan area in Wisconsin. Several person-based accessibility measures are computed based on simulated trips, which disclose low accessibility inner city neighborhoods well covered by a transit network.

scholarly journals The Effect of Route-choice Strategy on Transit Travel Time Estimates

2019 ◽  
Author(s):  
Nate Wessel ◽  
Steven Farber
Keyword(s):  
Travel Time ◽  
Shortest Path ◽  
Imperfect Information ◽  
Optimal Path ◽  
Shortest Paths ◽  
Route Choice ◽  
Travel Times ◽  
Selection Strategies ◽  
Time Estimates ◽  
Average Travel Time

Estimates of travel time by public transit often rely on the calculation of a shortest-path between two points for a given departure time. Such shortest-paths are time-dependent and not always stable from one moment to the next. Given that actual transit passengers necessarily have imperfect information about the system, their route selection strategies are heuristic and cannot be expected to achieve optimal travel times for all possible departures. Thus an algorithm that returns optimal travel times at all moments will tend to underestimate real travel times all else being equal. While several researchers have noted this issue none have yet measured the extent of the problem. This study observes and measures this effect by contrasting two alternative heuristic routing strategies to a standard shortest-path calculation. The Toronto Transit Commission is used as a case study and we model actual transit operations for the agency over the course of a normal week with archived AVL data transformed into a retrospective GTFS dataset. Travel times are estimated using two alternative route-choice assumptions: 1) habitual selection of the itinerary with the best average travel time and 2) dynamic choice of the next-departing route in a predefined choice set. It is shown that most trips present passengers with a complex choice among competing itineraries and that the choice of itinerary at any given moment of departure may entail substantial travel time risk relative to the optimal outcome. In the context of accessibility modelling, where travel times are typically considered as a distribution, the optimal path method is observed in aggregate to underestimate travel time by about 3-4 minutes at the median and 6-7 minutes at the \nth{90} percentile for a typical trip.

scholarly journals Cairo Public Transport Route Finder – A Pilot System

2016 ◽  
Vol 4 (4) ◽  
pp. 26
Author(s):  
Khaled Ahmed Ahmed Mohamed Hassan ◽  
Ghada Nasr Hassan
Keyword(s):  
Shortest Path ◽  
Public Transport ◽  
Public Transportation ◽  
Transportation Network ◽  
Android Application ◽  
Network Graph ◽  
The Public ◽  
Shortest Route ◽  
Greater Cairo ◽  
Starting Location

Aiming to facilitate the choice of transport links leading from a starting location to a destination in greater Cairo, we propose in this work a public transportation mobile (android) application to assist users of public transport. The system is a pilot application that considers the public mini-buses network in three areas of Cairo, and builds the database of the mini-bus network verified on the ground. From this database, the transportation network graph consisting of nodes and possible links between them is constructed. Upon request, the system then identifies the series of public transport possible, calculates the shortest path between the two chosen locations, and displays the bus, or series of buses, and the routes to the user, ordered by distance. The specialized algorithm Dijkstra was implemented to find the shortest route.

scholarly journals Economic evaluation of natural forest park using the travel cost method (case study; Masouleh forest park, north of Iran)

2014 ◽  
Vol 60 (No. 6) ◽  
pp. 254-261 ◽  
Author(s):  
S. Mohammadi Limaei ◽  
H. Ghesmati ◽  
R. Rashidi ◽  
N. Yamini
Keyword(s):  
Willingness To Pay ◽  
Travel Time ◽  
Travel Cost ◽  
Travel Cost Method ◽  
Round Trip ◽  
Significant Relation ◽  
Forest Park ◽  
Travel Costs ◽  
North Of Iran

We evaluated recreational and socioeconomic values of Masouleh forest park, north of Iran. Travel Cost Method (TCM) or Clawson method was used for evaluation. Therefore, 96 questionnaires were distributed among the visitors. The results indicated that the variables such as travel time to the park, travel costs, age and education were effective variables in using the park. The results show that there is a significant relation between travel time and the number of visitors whereas by increasing travel time the number of visitors decreased. Furthermore, there is a significant relation between the number of visitors as a dependent variable and travel costs whereas when the travel cost increases, the number of visitors decreases. Results indicated that the willingness to pay decreased by increasing the entrance fee. The models estimated an average willingness to pay 12,500 Iranian Rials per visit. The results also indicated that the average round trip travel cost was 85.5 (10,000 Iranian Rials).  

Clark as an Alternative Destination for Warehouse Storage in Manila, Philippines

2015 ◽  
Vol 14 (1) ◽  
Author(s):  
LOK TAK MING JAFY
Keyword(s):  
Information Sources ◽  
Transportation Network ◽  
Demographic Characteristics ◽  
Destination Image ◽  
Similar Argument ◽  
Economic Activities ◽  
Storage Location ◽  
Travelling Time ◽  
Warehouse Storage

This paper is to apply the concept of the destination image to a decision on warehouse storage location. With a proper transportation network, people in Manila could reach Clark in one to one and a half hours.  However, currently, the customers in Manila are reluctant to use the warehouse services in Clark.  One of the main concerns is on the unexpected travelling time. The objective of this paper is to explore whether people will consider Clark as an alternative destination for warehouse storage in Manila if there is a proper transportation network. The results of the three case studies confirm the model of the formation of the destination image being the information sources, experience, psychologically nature and socio-demographic characteristics. The results also confirm the influence of the linked transportation network to Clark as a destination image. It is concluded that propositions are supported, and literal replication is expected. With a properly linked transportation network, consumers are willing to consider Clark as a warehouse storage location. With a similar argument, Clark could be considered for other business and other economic activities if there is properly linked transportation network between Clark and Manila. Keywords- Destination image, linked transportation network, case study, Manila, Clark

scholarly journals OPTIMIZING THE CONTAINER TRUCK PATHS WITH UNCERTAIN TRAVEL TIME IN CONTAINER PORTS

Transport ◽  
2021 ◽  
Vol 36 (6) ◽  
pp. 444-462
Author(s):  
Jiaming Liu ◽  
Bin Yu ◽  
Wenxuan Shan ◽  
Baozhen Yao ◽  
Yao Sun
Keyword(s):  
Travel Time ◽  
Shortest Path ◽  
Programming Model ◽  
Mixed Integer ◽  
A Algorithm ◽  
Shuffled Complex Evolution ◽  
Proposed Model ◽  
Container Ports ◽  
Yard Template

The yard template problem in container ports determines the assignment of space to store containers for the vessels, which could impact container truck paths. Actually, the travel time of container truck paths is uncertain. This paper considers the uncertainty from two perspectives: (1) the yard congestion in the context of yard truck interruptions, (2) the correlation among adjacent road sections (links). A mixed-integer programming model is proposed to minimize the travel time of container trucks. The reliable shortest path, which takes the correlation among links into account is firstly discussed. To settle the problem, a Shuffled Complex Evolution Approach (SCE-UA) algorithm is designed to work out the assignment of yard template, and the A* algorithm is presented to find the reliable shortest path according to the port operator’s attitude. In our case study, one yard in Dalian (China) container port is chosen to test the applicability of the model. The result shows the proposed model can save 9% of the travel time of container trucks, compared with the model without considering the correlation among adjacent links.

Sign in / Sign up

Export Citation Format

Share Document