RAILWAY CREW SCHEDULING WITHGROUPING EVOLUTIONARY 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.

SEPEHRI M.M.; HAJI FATHALIHA A.; MEMARIANI A.

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

Journal Paper

Paper Information

Journal: AMIRKABIR Year:2003 | Volume:14 | Issue:54-D Page(s): 565-577

Download Full-Text

Persian Verion

View:

1,106

Download:

Cites:

Information Journal Paper

Title

RAILWAY CREW SCHEDULING WITHGROUPING EVOLUTIONARY ALGORITHM

Author(s)

SEPEHRI M.M. | HAJI FATHALIHA A. | MEMARIANI A. | Issue Writer Certificate

Keywords

CREW SCHEDULINGQ4

RAILWAY CREW SCLLEDULINGQ4

HEURISTIC MODELQ4

EVOLUTIONARY ALGORITLLMQ4

ROUTINGQ3

Abstract

In this paper, with emphasis on scheduling of head of crews for coach trains, a CREW SCHEDULING problem is presented in a network form with task arcs. To solve the problem, a meta heuristic algorithm based on grouping evolutionary algorithm is developed. The grouping evolutionary algorithm contains two search methods which generate offspring from a parent chromosome; one of these methods is based on a logic constraints heuristic algorithm, and the other one is relied on branch and bound approach. Computational results showed that combining grouping evolutionary algorithm and branch and bound approach generates good solutions, and for the problems that we knew their optimal solutions accomplish optimal outcomes. It is also shown that the algorithm provides goods results for large scale real world problems.

Cites

No record.

References

No record.

Cite

APA: Copy

SEPEHRI, M.M., HAJI FATHALIHA, A., & MEMARIANI, A.. (2003). RAILWAY CREW SCHEDULING WITHGROUPING EVOLUTIONARY ALGORITHM. AMIRKABIR, 14(54-D), 565-577. SID. https://sid.ir/paper/684/en

Vancouver: Copy

SEPEHRI M.M., HAJI FATHALIHA A., MEMARIANI A.. RAILWAY CREW SCHEDULING WITHGROUPING EVOLUTIONARY ALGORITHM. AMIRKABIR[Internet]. 2003;14(54-D):565-577. Available from: https://sid.ir/paper/684/en

IEEE: Copy

M.M. SEPEHRI, A. HAJI FATHALIHA, and A. MEMARIANI, “RAILWAY CREW SCHEDULING WITHGROUPING EVOLUTIONARY ALGORITHM,” AMIRKABIR, vol. 14, no. 54-D, pp. 565–577, 2003, [Online]. Available: https://sid.ir/paper/684/en

Related Journal Papers