SOLVING DYNAMIC RAIL-CAR FLEET SIZING PROBLEM BY A HYBRID METAHEURISTIC 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.

YAGHINI M.; KHANDAGHABADI Z.

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

Journal Paper

Paper Information

Journal: JOURNAL OF TRANSPORTATION RESEARCH Year:2011 | Volume:8 | Issue:1 (26) Page(s): 75-90

Download Full-Text

Persian Verion

View:

1,368

Download:

Cites:

Information Journal Paper

Title

SOLVING DYNAMIC RAIL-CAR FLEET SIZING PROBLEM BY A HYBRID METAHEURISTIC ALGORITHM

Author(s)

YAGHINI M. | KHANDAGHABADI Z. | Issue Writer Certificate

Keywords

OPTIMIZATIONQ2

FLEET SIZINGQ3

RAIL TRANSPORTATIONQ2

GENETIC ALGORITHMQ2

SIMULATED ANNEALINGQ2

Abstract

The aim of this paper is to present a new solution method to optimize rail-car FLEET SIZING problem. The model is a dynamic and multi-periodic and car demands and travel times are assumed to be deterministic. There are important interactions between decisions on sizing a rail car fleet and utilizing that fleet. Consequently, using empty rail-cars is considered in the proposed model that leads to a high decrease of fleets number and costs. The model also provides rail network information such as unmet demands, number of stationed rail-car in each station and each time period, and number of loaded and empty traveling rail-car at any given time. In this paper, the proposed solution procedure is combining GENETIC ALGORITHM (GA) and SIMULATED ANNEALING (SA) algorithms. GA is used for determining the number of fleets in each station at the beginning of the planning horizon, and SA is used for assigning rail-cars to demands in the length of the planning horizon. Computational results demonstrate the applicability of the proposed approach. For evaluating the proposed solution method, a comparison between results of the hybrid metaheuristic algorithm and optimum results of CPLEX software is done. The efficiency and effectiveness of the proposed hybrid algorithm is revealed.

Cites

No record.

References

No record.

Cite

APA: Copy

YAGHINI, M., & KHANDAGHABADI, Z.. (2011). SOLVING DYNAMIC RAIL-CAR FLEET SIZING PROBLEM BY A HYBRID METAHEURISTIC ALGORITHM. JOURNAL OF TRANSPORTATION RESEARCH, 8(1 (26)), 75-90. SID. https://sid.ir/paper/375788/en

Vancouver: Copy

YAGHINI M., KHANDAGHABADI Z.. SOLVING DYNAMIC RAIL-CAR FLEET SIZING PROBLEM BY A HYBRID METAHEURISTIC ALGORITHM. JOURNAL OF TRANSPORTATION RESEARCH[Internet]. 2011;8(1 (26)):75-90. Available from: https://sid.ir/paper/375788/en

IEEE: Copy

M. YAGHINI, and Z. KHANDAGHABADI, “SOLVING DYNAMIC RAIL-CAR FLEET SIZING PROBLEM BY A HYBRID METAHEURISTIC ALGORITHM,” JOURNAL OF TRANSPORTATION RESEARCH, vol. 8, no. 1 (26), pp. 75–90, 2011, [Online]. Available: https://sid.ir/paper/375788/en

Related Journal Papers