A HEURISTIC METHOD FOR PUBLIC TRANSPORTATION NETWORK DESIGN USING ROUTE GENERATION ALGORITHM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SEYEDABRISHAMI SEYED EHSAN; KHANZAD IRAN; ZARINMEHR AMIRALI; MAMDOUHI AMIRREZA

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Transportation Engineering Year:2017 | Volume:8 | Issue:3 Page(s): 643-654

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

1,251

Download:

Cites:

Information Journal Paper

Title

A HEURISTIC METHOD FOR PUBLIC TRANSPORTATION NETWORK DESIGN USING ROUTE GENERATION ALGORITHM

Author(s)

SEYEDABRISHAMI SEYED EHSAN | KHANZAD IRAN | ZARINMEHR AMIRALI | MAMDOUHI AMIRREZA | Issue Writer Certificate

Keywords

PUBLIC TRANSPORTATIONQ2

NETWORK DESIGNQ2

ROUTE GENERATIONQ2

Abstract

PUBLIC TRANSPORTATION NETWORK DESIGN is one of the most complex issues in transportation engineering where researchers usually apply simple heuristic methods to solve the complicated problem. ROUTE GENERATION algorithm is one of the heuristic methods that use the shortest path between high transit demand O-D pairs and expand the shortest path, called ROUTE GENERATION algorithm, to cover more transit demand. In this paper, the expanding ROUTE GENERATION algorithm has been revised in order to consider restrictions on minimum route travel time and length to the primary ROUTE GENERATION algorithm. The proposed algorithm for ROUTE GENERATION has been coded in a computer programs and used for transit NETWORK DESIGN in Sioux Falls test network. The results show that the algorithm reduces the number of transit routes in the test network by 70 percent and route overlaps length by one-third compare with the previous ROUTE GENERATION algorithms used for transit NETWORK DESIGN on Sioux Falls.

Cites

No record.

References

No record.

Cite

APA: Copy

SEYEDABRISHAMI, SEYED EHSAN, KHANZAD, IRAN, ZARINMEHR, AMIRALI, & MAMDOUHI, AMIRREZA. (2017). A HEURISTIC METHOD FOR PUBLIC TRANSPORTATION NETWORK DESIGN USING ROUTE GENERATION ALGORITHM. JOURNAL OF TRANSPORTATION ENGINEERING, 8(3 ), 643-654. SID. https://sid.ir/paper/357650/en

Vancouver: Copy

SEYEDABRISHAMI SEYED EHSAN, KHANZAD IRAN, ZARINMEHR AMIRALI, MAMDOUHI AMIRREZA. A HEURISTIC METHOD FOR PUBLIC TRANSPORTATION NETWORK DESIGN USING ROUTE GENERATION ALGORITHM. JOURNAL OF TRANSPORTATION ENGINEERING[Internet]. 2017;8(3 ):643-654. Available from: https://sid.ir/paper/357650/en

IEEE: Copy

SEYED EHSAN SEYEDABRISHAMI, IRAN KHANZAD, AMIRALI ZARINMEHR, and AMIRREZA MAMDOUHI, “A HEURISTIC METHOD FOR PUBLIC TRANSPORTATION NETWORK DESIGN USING ROUTE GENERATION ALGORITHM,” JOURNAL OF TRANSPORTATION ENGINEERING, vol. 8, no. 3 , pp. 643–654, 2017, [Online]. Available: https://sid.ir/paper/357650/en

Related Journal Papers