A SIMULATED ANNEALING ALGORITHM FOR SOLVING RAILROAD BLOCKING PROBLEM IN FREIGHT RAILROADS

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.

YAGHINI M.; POURSEYYED AGHAEI M.; NADJARI B.

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

Journal Paper

Paper Information

Journal: JOURNAL OF TRANSPORTATION RESEARCH Year:2010 | Volume:7 | Issue:2 (23) Page(s): 185-196

Download Full-Text

Persian Verion

View:

1,322

Download:

Cites:

Information Journal Paper

Title

A SIMULATED ANNEALING ALGORITHM FOR SOLVING RAILROAD BLOCKING PROBLEM IN FREIGHT RAILROADS

Author(s)

YAGHINI M. | POURSEYYED AGHAEI M. | NADJARI B. | Issue Writer Certificate

Keywords

RAILROAD BLOCKINGQ3

FREIGHT RAILROADQ3

SIMULATED ANNEALINGQ3

OPTIMIZATIONQ2

KTH SHORTEST PATHQ3

CPLEXQ3

Abstract

The RAILROAD BLOCKING problem is one of the most important problems in FREIGHT RAILROAD areas. Solving the RAILROAD BLOCKING problem reduces the operational cost of railroads considerably and saves time in moving the freight as well. However, RAILROAD BLOCKING problem in medium and large size is not solved by any of the commercial software available in the market. This research presents an algorithm based on SIMULATED ANNEALING Algorithm for solving the RAILROAD BLOCKING algorithm that is able to solve the problem in a reasonable CPU time. To analyze the efficiency of the algorithm and check for the quality of solutions, experimental analyses are conducted. Two sets of small and large sized problems that were generated randomly are solved. Results on the set of problems are compared to those of solutions generated via CPLEX, one of the well-known solvers for solving both linear and mix integer programming problems.

Cites

No record.

References

No record.

Cite

APA: Copy

YAGHINI, M., POURSEYYED AGHAEI, M., & NADJARI, B.. (2010). A SIMULATED ANNEALING ALGORITHM FOR SOLVING RAILROAD BLOCKING PROBLEM IN FREIGHT RAILROADS. JOURNAL OF TRANSPORTATION RESEARCH, 7(2 (23)), 185-196. SID. https://sid.ir/paper/83929/en

Vancouver: Copy

YAGHINI M., POURSEYYED AGHAEI M., NADJARI B.. A SIMULATED ANNEALING ALGORITHM FOR SOLVING RAILROAD BLOCKING PROBLEM IN FREIGHT RAILROADS. JOURNAL OF TRANSPORTATION RESEARCH[Internet]. 2010;7(2 (23)):185-196. Available from: https://sid.ir/paper/83929/en

IEEE: Copy

M. YAGHINI, M. POURSEYYED AGHAEI, and B. NADJARI, “A SIMULATED ANNEALING ALGORITHM FOR SOLVING RAILROAD BLOCKING PROBLEM IN FREIGHT RAILROADS,” JOURNAL OF TRANSPORTATION RESEARCH, vol. 7, no. 2 (23), pp. 185–196, 2010, [Online]. Available: https://sid.ir/paper/83929/en

Related Journal Papers