LOCOMOTIVE ASSIGNMENT PROBLEM WITH TRAIN PRECEDENCE USING GENETIC 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.

NOORI SIAMAK; GHANNADPOUR SEYED FARID

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL Year:2012 | Volume:8 | Issue:8 Page(s): 1-13

Download Full-Text

View:

286

Download:

125

Cites:

Information Journal Paper

Title

LOCOMOTIVE ASSIGNMENT PROBLEM WITH TRAIN PRECEDENCE USING GENETIC ALGORITHM

Author(s)

NOORI SIAMAK | GHANNADPOUR SEYED FARID | Issue Writer Certificate

Keywords

LOCOMOTIVE ASSIGNMENT PROBLEM

VEHICLE ROUTING AND SCHEDULING

FUZZY TIME WINDOWS

GENETIC ALGORITHM

Abstract

This paper aims to study the LOCOMOTIVE ASSIGNMENT PROBLEM which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations. These trains have different degrees of priority for servicing, and the high class of trains should be serviced earlier than others. This problem is modeled using VEHICLE ROUTING AND SCHEDULING problem where trains representing the customers are supposed to be serviced in pre-specified hard/soft FUZZY TIME WINDOWS.A two-phase approach is used which, in the first phase, the multi-depot locomotive assignment is converted to a set of single depot problems, and after that, each single depot problem is solved heuristically by a hybrid GENETIC ALGORITHM. In the GENETIC ALGORITHM, various heuristics and efficient operators are used in the evolutionary search. The suggested algorithm is applied to solve the medium sized numerical example to check capabilities of the model and algorithm. Moreover, some of the results are compared with those solutions produced by branch-and-bound technique to determine validity and quality of the model. Results show that suggested approach is rather effective in respect of quality and time.

Cites

No record.

References

Cite

APA: Copy

NOORI, SIAMAK, & GHANNADPOUR, SEYED FARID. (2012). LOCOMOTIVE ASSIGNMENT PROBLEM WITH TRAIN PRECEDENCE USING GENETIC ALGORITHM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, 8(8), 1-13. SID. https://sid.ir/paper/309894/en

Vancouver: Copy

NOORI SIAMAK, GHANNADPOUR SEYED FARID. LOCOMOTIVE ASSIGNMENT PROBLEM WITH TRAIN PRECEDENCE USING GENETIC ALGORITHM. JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL[Internet]. 2012;8(8):1-13. Available from: https://sid.ir/paper/309894/en

IEEE: Copy

SIAMAK NOORI, and SEYED FARID GHANNADPOUR, “LOCOMOTIVE ASSIGNMENT PROBLEM WITH TRAIN PRECEDENCE USING GENETIC ALGORITHM,” JOURNAL OF INDUSTRIAL ENGINEERING INTERNATIONAL, vol. 8, no. 8, pp. 1–13, 2012, [Online]. Available: https://sid.ir/paper/309894/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops