Addressing the Freight Consolidation and Containerization Problem by Recent and Hybridized Meta-heuristic Algorithms

Publish Year: 1395
نوع سند: مقاله ژورنالی
زبان: English
View: 380

This Paper With 8 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

JR_IJE-30-3_010

تاریخ نمایه سازی: 6 شهریور 1396

Abstract:

Nowadays, in global free market, third-party logistics providers (3PLs) are becoming increasingly important. Hence, this study aims to develop the freight consolidation and containerization problem, which consists of loading items into containers and then shipping these containers to differentwarehouse they are delivered to their final destinations. In order to handle the proposed problem, this research not only uses the traditional and recent algorithms, but also the two new hybridized methodsare introduced in order to strengthen the advantages of recent ones. In this regard, this study considers the two important phases in meta-heuristic to develop new ones. Besides, Taguchi experimental designmethod is utilized to set and estimate the proper values of the algorithms’ parameters to improve their performance. For the purpose of performance evaluation of the proposed algorithms, various problemsizes are employed and the computational results of the algorithms are compared with each other. Finally, the impacts of the rise in the problem size on the performance of the proposed algorithms are investigated.

Keywords:

Freight Consolidation and Containerization , Problem , Red Deer Algorithm , Stochastic Fractal Search , Hybridized Methods , Intensification and Diversification Phases

Authors

e Nasiri

Department of Industrial Engineering, Shomal University, Amol, Iran

a.j Afshari

Department of Industrial Engineering, Shomal University, Amol, Iran

m Hajiaghaei-Keshteli

Department of Industrial Engineering and Management System, University of Science and Technology of Mazandaran, Behshahr, Iran