A GENETIC ALGORITHM TO SOLVE INTEGRATED PROBLEM OF SELECTING AND SCHEDULING TRANSPORTATION INVESTMENT PROJECTS

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.

HOSSEININASAB S.M.R.; SHETAB BOUSHEHRI SAYED NADER; KHERMANI NODEHI R.

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

Journal Paper

Paper Information

Journal: JOURNAL OF TRANSPORTATION RESEARCH Year:2016 | Volume:13 | Issue:1 (46) Page(s): 9-28

Download Full-Text

Persian Verion

View:

1,131

Download:

Cites:

Information Journal Paper

Title

A GENETIC ALGORITHM TO SOLVE INTEGRATED PROBLEM OF SELECTING AND SCHEDULING TRANSPORTATION INVESTMENT PROJECTS

Author(s)

HOSSEININASAB S.M.R. | SHETAB BOUSHEHRI SAYED NADER | KHERMANI NODEHI R. | Issue Writer Certificate

Keywords

TRANSPORTATION PLANNING

PROJECTS SELECTION

PROJECTS SCHEDULING

GENETIC ALGORITHM

TAGUCHI METHOD

Abstract

One of the most important issues which transportation authorities are always confronted with is investment PROJECTS SELECTION. After PROJECTS SELECTION, due to resource constraints, selected projects require to be scheduled during the planning horizon. Integration of selecting and scheduling projects in a single model increases the accuracy of the results, but on the other hand increases complexity. In this paper, integrated model of selecting and scheduling transportation investment projects is introduced as a bi-level discrete network design problem. In this model, duration time and annual costs of candidate projects are unknown at first, but they will be determined by solving the model. A new measure to evaluate projects according to the threshold of user satisfaction is developed that in combination with the total travel time form the upper level objective function. Given the great complexity of the exact solution, a GENETIC ALGORITHM (GA) is proposed to solve the model in a reasonable time. Also to optimize the GA parameters, the TAGUCHI METHOD has been used. In order to evaluate the performance of the proposed algorithm, Sioux Falls urban transportation network is considered and three sample problems in different scales have been produced. The proposed GA and complete count method used to solve the problems. Numerical results show that proposed GA has an acceptable performance in both solution quality and solution time, especially in the large-scale problem.

Cites

No record.

References

No record.

Cite

APA: Copy

HOSSEININASAB, S.M.R., SHETAB BOUSHEHRI, SAYED NADER, & KHERMANI NODEHI, R.. (2016). A GENETIC ALGORITHM TO SOLVE INTEGRATED PROBLEM OF SELECTING AND SCHEDULING TRANSPORTATION INVESTMENT PROJECTS. JOURNAL OF TRANSPORTATION RESEARCH, 13(1 (46)), 9-28. SID. https://sid.ir/paper/83763/en

Vancouver: Copy

HOSSEININASAB S.M.R., SHETAB BOUSHEHRI SAYED NADER, KHERMANI NODEHI R.. A GENETIC ALGORITHM TO SOLVE INTEGRATED PROBLEM OF SELECTING AND SCHEDULING TRANSPORTATION INVESTMENT PROJECTS. JOURNAL OF TRANSPORTATION RESEARCH[Internet]. 2016;13(1 (46)):9-28. Available from: https://sid.ir/paper/83763/en

IEEE: Copy

S.M.R. HOSSEININASAB, SAYED NADER SHETAB BOUSHEHRI, and R. KHERMANI NODEHI, “A GENETIC ALGORITHM TO SOLVE INTEGRATED PROBLEM OF SELECTING AND SCHEDULING TRANSPORTATION INVESTMENT PROJECTS,” JOURNAL OF TRANSPORTATION RESEARCH, vol. 13, no. 1 (46), pp. 9–28, 2016, [Online]. Available: https://sid.ir/paper/83763/en

Related Journal Papers