TRAIN SCHEDULING PROBLEM WITH CONSIDERATION OF PRAYING CONSTRAINT AS AN APPLICATION OF JOB SHOP SCHEDULING PROBLEM

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.

JAMILI A.; GHANNADPOUR S.F.; GHORESHINEJAD M.R.

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

Journal Paper

Paper Information

Journal: International Journal of Engineering Year:2014 | Volume:27 | Issue:7 TRANSACTIONS A: BASICS Page(s): 1091-1098

Download Full-Text

View:

284

Download:

118

Cites:

Information Journal Paper

Title

TRAIN SCHEDULING PROBLEM WITH CONSIDERATION OF PRAYING CONSTRAINT AS AN APPLICATION OF JOB SHOP SCHEDULING PROBLEM

Author(s)

JAMILI A. | GHANNADPOUR S.F. | GHORESHINEJAD M.R. | Issue Writer Certificate

Keywords

JOB SHOP SCHEDULING

TRAIN SCHEDULING

MUSLIM PRAYING CONSTRAINT

ELECTROMAGNETISM-LIKE ALGORITHM

Abstract

The present paper extends the idea of JOB SHOP SCHEDULING problem with resting constraints to the TRAIN SCHEDULING problem with the Muslim praying considerations. For this purpose, after proposing the new mathematical model, a heuristic algorithm based on the ELECTROMAGNETISM-LIKE ALGORITHM (EM) which is well adjusted to scheduling problems is employed to solve the large-size practical cases. The effectiveness of the proposed algorithm is then validated by comparing with optimum solution using small-size instances and simulated annealing algorithm, and Particle swarm Optimization (PSO) using medium and large-size instances. At the end, a practical case from Iranian railway network is studied and the results are reported. The results indicate that in the case of considering the MUSLIM PRAYING CONSTRAINT, the ratios of total tardiness of trains, and the total praying times are 14.5%, and 3.5%, respectively, while in the case of relaxing this constraint; the first ratio reduces to 12.3%. This result demonstrates that the proposed algorithm is able to schedule the praying times so that in many cases the trains with different directions meet each other during the praying times.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

JAMILI, A., GHANNADPOUR, S.F., & GHORESHINEJAD, M.R.. (2014). TRAIN SCHEDULING PROBLEM WITH CONSIDERATION OF PRAYING CONSTRAINT AS AN APPLICATION OF JOB SHOP SCHEDULING PROBLEM. INTERNATIONAL JOURNAL OF ENGINEERING, 27(7 TRANSACTIONS A: BASICS), 1091-1098. SID. https://sid.ir/paper/644902/en

Vancouver: Copy

JAMILI A., GHANNADPOUR S.F., GHORESHINEJAD M.R.. TRAIN SCHEDULING PROBLEM WITH CONSIDERATION OF PRAYING CONSTRAINT AS AN APPLICATION OF JOB SHOP SCHEDULING PROBLEM. INTERNATIONAL JOURNAL OF ENGINEERING[Internet]. 2014;27(7 TRANSACTIONS A: BASICS):1091-1098. Available from: https://sid.ir/paper/644902/en

IEEE: Copy

A. JAMILI, S.F. GHANNADPOUR, and M.R. GHORESHINEJAD, “TRAIN SCHEDULING PROBLEM WITH CONSIDERATION OF PRAYING CONSTRAINT AS AN APPLICATION OF JOB SHOP SCHEDULING PROBLEM,” INTERNATIONAL JOURNAL OF ENGINEERING, vol. 27, no. 7 TRANSACTIONS A: BASICS, pp. 1091–1098, 2014, [Online]. Available: https://sid.ir/paper/644902/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops