DYNAMIC CARGO TRAINS SCHEDULING FOR TACKLING NETWORK CONSTRAINTS AND COSTS EMANATING FROM TARDINESS AND EARLINESS

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.

RAZMI JAFAR; OSTADI BAKHTIAR

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

Journal Paper

Paper Information

Journal: JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING) Year:2009 | Volume:4 | Issue:PRE. NO. 4 Page(s): 19-27

Download Full-Text

View:

295

Download:

127

Cites:

Information Journal Paper

Title

DYNAMIC CARGO TRAINS SCHEDULING FOR TACKLING NETWORK CONSTRAINTS AND COSTS EMANATING FROM TARDINESS AND EARLINESS

Author(s)

RAZMI JAFAR | OSTADI BAKHTIAR | Issue Writer Certificate

Keywords

MULTI-OBJECTIVES PROBLEM

DYNAMIC PROGRAMMING

RAIL-WAY/CARGO TRAIN SCHEDULING

DELIVERY DECISION

Abstract

This paper aims to develop a multi-objective model for scheduling cargo trains faced by the costs of tardiness and earliness, time limitations, queue priority and limited station lines. Based upon the Islamic Republic of Iran Railway Corporation (IRIRC) regulations, passenger trains enjoy priority over other trains for departure. Therefore, the timetable of cargo trains must be determined based on certain passenger trains. In addition, the introduced model considers extra platforms in each station through the travel route. This model has been run in IRIRC and the results have illustrated a great improvement in comparison to status quo. The model has been verified and validated against the real system by conducting t-tests. Furthermore, sensitivity analysis of the model reveals a set of optimization alternatives for scheduling cargo trains. Reduced routing traffic, optimum number of cargo trains, enhanced customer lead times, maximum trains capacity are retrieved from the model in order to obtain an integrated scheduling for cargo and passenger trains.

Cites

No record.

References

Cite

APA: Copy

RAZMI, JAFAR, & OSTADI, BAKHTIAR. (2009). DYNAMIC CARGO TRAINS SCHEDULING FOR TACKLING NETWORK CONSTRAINTS AND COSTS EMANATING FROM TARDINESS AND EARLINESS. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 4(PRE. NO. 4), 19-27. SID. https://sid.ir/paper/584989/en

Vancouver: Copy

RAZMI JAFAR, OSTADI BAKHTIAR. DYNAMIC CARGO TRAINS SCHEDULING FOR TACKLING NETWORK CONSTRAINTS AND COSTS EMANATING FROM TARDINESS AND EARLINESS. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2009;4(PRE. NO. 4):19-27. Available from: https://sid.ir/paper/584989/en

IEEE: Copy

JAFAR RAZMI, and BAKHTIAR OSTADI, “DYNAMIC CARGO TRAINS SCHEDULING FOR TACKLING NETWORK CONSTRAINTS AND COSTS EMANATING FROM TARDINESS AND EARLINESS,” JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 4, no. PRE. NO. 4, pp. 19–27, 2009, [Online]. Available: https://sid.ir/paper/584989/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops