A GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE TO SOLVE THE TRAIN SEQUENCING AND STOP SCHEDULING PROBLEM IN DOUBLE TRACK RAILWAY LINES

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.

HASSANNAYEBI E.; KIYANFAR F.

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

Journal Paper

Paper Information

Journal: JOURNAL OF TRANSPORTATION RESEARCH Year:2012 | Volume:9 | Issue:3 (32) Page(s): 235-257

Download Full-Text

Persian Verion

View:

1,058

Download:

Cites:

Information Journal Paper

Title

A GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE TO SOLVE THE TRAIN SEQUENCING AND STOP SCHEDULING PROBLEM IN DOUBLE TRACK RAILWAY LINES

Author(s)

HASSANNAYEBI E. | KIYANFAR F. | Issue Writer Certificate

Keywords

TRAIN SEQUENCINGQ2

STOPPING SCHEDULEQ3

DOUBLE TRACK LINESQ2

GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDUREQ2

Abstract

Optimizing the railway capacity is one of the most important goals in the train scheduling field, and literature shows that optimizing the use of the existing railway capacity is a more costeffective solution than capital investment on upgrading or installing new railway infrastructure. The sequence of dispatching trains and STOPPING SCHEDULEs are the main factors that can affect therailway capacity on DOUBLE TRACK LINES, and in this thesis, a TRAIN SEQUENCING and stop scheduling problem is studied in order to maximize the use of existing railway capacity. The main decision variables are the sequence of dispatches from the origin station and the selection of the best station for the scheduled stops in order to minimize the makespan. This research proposes a flexible flow shop scheduling formulation, which considers block section and station as single and parallel machines. In addition, an integer programming model is presented for solving the TRAIN SEQUENCING problem in double track railway lines by considering the station infrastructure and STOPPING SCHEDULE policies in Iran’s railway systems. The problem is of very high complexity, and therefore a GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE (GRASP) is used for finding the near optimal solution. Three meta-heuristic algorithms based on GRASP are developed and tested on randomly generated test problems, and the output results show the effectiveness of the proposed meta-heuristic algorithm in solving real-sized problems.

Cites

No record.

References

A TRAIN SCHEDULING MODEL BY CONSIDERING THE TRAIN STOPS FOR PRAYER

Cite

APA: Copy

HASSANNAYEBI, E., & KIYANFAR, F.. (2012). A GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE TO SOLVE THE TRAIN SEQUENCING AND STOP SCHEDULING PROBLEM IN DOUBLE TRACK RAILWAY LINES. JOURNAL OF TRANSPORTATION RESEARCH, 9(3 (32)), 235-257. SID. https://sid.ir/paper/83706/en

Vancouver: Copy

HASSANNAYEBI E., KIYANFAR F.. A GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE TO SOLVE THE TRAIN SEQUENCING AND STOP SCHEDULING PROBLEM IN DOUBLE TRACK RAILWAY LINES. JOURNAL OF TRANSPORTATION RESEARCH[Internet]. 2012;9(3 (32)):235-257. Available from: https://sid.ir/paper/83706/en

IEEE: Copy

E. HASSANNAYEBI, and F. KIYANFAR, “A GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE TO SOLVE THE TRAIN SEQUENCING AND STOP SCHEDULING PROBLEM IN DOUBLE TRACK RAILWAY LINES,” JOURNAL OF TRANSPORTATION RESEARCH, vol. 9, no. 3 (32), pp. 235–257, 2012, [Online]. Available: https://sid.ir/paper/83706/en

Related Journal Papers