VEHICLE ROUTING PROBLEM IN CROSS-DOCK USING GENETIC ALGORITHM, CASE: IRAN KHODRO COMPANY

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.

OLFAT LAYA; AMIRI MAGHSOD; JAFARIAN AHMAD

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL MANAGEMENT STUDIES Year:2017 | Volume:15 | Issue:45 Page(s): 97-120

Download Full-Text

Persian Verion

View:

906

Download:

Cites:

Information Journal Paper

Title

VEHICLE ROUTING PROBLEM IN CROSS-DOCK USING GENETIC ALGORITHM, CASE: IRAN KHODRO COMPANY

Author(s)

OLFAT LAYA | AMIRI MAGHSOD | JAFARIAN AHMAD | Issue Writer Certificate

Keywords

CROSS-DOCKQ1

VEHICLE ROUTING PROBLEMQ1

GENETIC ALGORITHMQ2

META-HEURISTICSQ1

Abstract

CROSS-DOCKing is one of the lean logistics tools that is used for uniting the shipments during the loops replacement. CROSS-DOCKing is the process of product movement form distribution centers without storage function. VEHICLE ROUTING PROBLEM in CROSS-DOCK external environment has much influence on CROSS-DOCK costs. This paper provides a model for minimizing total distance traveled by vehicles in the external environment of a CROSS-DOCK. In this paper, Vehicles routes was modeled with capacitated VEHICLE ROUTING PROBLEM (CVRP) and GENETIC ALGORITHM (GA) was used to solve the model. To validate responses obtained by GA, simulated annealing (SA) was used. Also, to evaluate the efficacy of two algorithms (SA & GA) in different CVRP problems in CROSS-DOCK, 10 problems with different dimensions are evaluated. The results show that in problems with smaller size GA is more efficient, whereas in large size problems SA is more efficient.

Cites

No record.

References

No record.

Cite

APA: Copy

OLFAT, LAYA, AMIRI, MAGHSOD, & JAFARIAN, AHMAD. (2017). VEHICLE ROUTING PROBLEM IN CROSS-DOCK USING GENETIC ALGORITHM, CASE: IRAN KHODRO COMPANY. JOURNAL OF INDUSTRIAL MANAGEMENT STUDIES, 15(45 ), 97-120. SID. https://sid.ir/paper/213273/en

Vancouver: Copy

OLFAT LAYA, AMIRI MAGHSOD, JAFARIAN AHMAD. VEHICLE ROUTING PROBLEM IN CROSS-DOCK USING GENETIC ALGORITHM, CASE: IRAN KHODRO COMPANY. JOURNAL OF INDUSTRIAL MANAGEMENT STUDIES[Internet]. 2017;15(45 ):97-120. Available from: https://sid.ir/paper/213273/en

IEEE: Copy

LAYA OLFAT, MAGHSOD AMIRI, and AHMAD JAFARIAN, “VEHICLE ROUTING PROBLEM IN CROSS-DOCK USING GENETIC ALGORITHM, CASE: IRAN KHODRO COMPANY,” JOURNAL OF INDUSTRIAL MANAGEMENT STUDIES, vol. 15, no. 45 , pp. 97–120, 2017, [Online]. Available: https://sid.ir/paper/213273/en

Related Journal Papers