New heuristic Approach to Solve the fixed charge transportation problem with incremental Discont

Publish Year: 1396
نوع سند: مقاله کنفرانسی
زبان: English
View: 391

This Paper With 11 Page And PDF Format Ready To Download

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

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

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

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

ICIORS10_113

تاریخ نمایه سازی: 11 شهریور 1397

Abstract:

The fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is considered as an NP-hard, in this paper we propose new heuristic along with well-known metaheuristic to solve the FCTP with incremental discount on both fixed and variable charges. In addition, since the researchers recently used the priority-based representation to encode the transportation graphs and achieved very good results, we consider this representation in metaheuristic and compare the results with the proposed heuristic. Furthermore, we apply the Taguchi experimental design method to set the proper values of algorithm in order to improve its performance. Finally, computational results of heuristic and metaheuristic, both in terms of the solution quality and computation time, are studied in different problem sizes.

Keywords:

Fixed charge transportation problem , Incremental discount , Heuristic , Priority-based

Authors

Komeil Yousefi

۱Department of Industrial Engineering, Shomal University, Amol, Iran

Ahmad J. Afshari

Department of Industrial Engineering, Shomal University, Amol, Iran

Mostafa Hajiaghaei-Keshteli

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