Solving the Fixed Charge Transportation Problem by New Heuristic Approach

سال انتشار: 1398
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 413

فایل این مقاله در 12 صفحه با فرمت PDF قابل دریافت می باشد

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

لینک ثابت به این مقاله:

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

JR_JOIE-12-1_005

تاریخ نمایه سازی: 21 خرداد 1398

چکیده مقاله:

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, the computational time grows exponentially as the size of the problem increases. In this paper, we propose a new heuristic along with well-known metaheuristic like Geneticalgorithm (GA), simulated annealing (SA) and recently developed one, Keshtel algorithm (KA) to solve the FCTP. Contrary to previous works, we develop a simple and strong heuristic according to the nature of the problem and compare the result with metaheuristics. 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 metaheuristics and compare the results with the proposed heuristic. Furthermore, we apply the Taguchi experimental design method to set the proper values of algorithms in order to improve their performances. Finally, computational results of heuristic and metaheuristics with different encoding approaches, both in terms of the solution quality and computation time, are studied in different problem sizes.

کلیدواژه ها:

Fixed charge Transportation problem ، Heuristic ، Metaheuristic algorithms ، Priority-based

نویسندگان

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

مراجع و منابع این مقاله:

لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :
  • Adlakha, V., & Kowalski, K. (2003). A simple heuristic for ...
  • Aguado, J. S. (2009). Fixed Charge Transportation Problems: a new ...
  • Balinski, M. L. (1961). Fixed‐cost transportation problems. Naval Research Logistics (NRL), 8(1), ...
  • Buson, E., Roberti, R., & Toth, P. (2014). A reduced-cost ...
  • Dwyer, P. S. (1966). Use of completely reduced matrices in ...
  • El-Sherbiny, M. M., & Alhamali, R. M. (2013). A hybrid ...
  • Gen, M., & Cheng, R. (1997). Foundations of genetic algorithms. Genetic ...
  • Gen, M., & Cheng, R. (2000). Genetic algorithms and engineering optimization (Vol. ...
  • Gen, M., & Li, Y. (1999). Spanning tree-based genetic algorithm ...
  • Gen, M., Altiparmak, F., & Lin, L. (2006). A genetic ...
  • Glover, F. (2005). Parametric ghost image processes for fixed-charge problems: ...
  • Guignard, M. (1988). A Lagrangean dual ascent algorithm for simple ...
  • Hajiaghaei-Keshteli, M. (2011). The allocation of customers to potential distribution ...
  • Hajiaghaei-Keshteli, M., & Aminnayeri, M. (2014). Solving the integrated scheduling ...
  • Hajiaghaei-Keshteli, M., Molla-Alizadeh-Zavardehi, S., & Tavakkoli-Moghaddam, R. (2010). Addressing a ...
  • Hirsch, Warren M., and George B. Dantzig.(1968). The fixed charge ...
  • Holland, J. H. (1975). Adaptation in natural and artificial systems. ...
  • Hwang, R. K., Katayama, H., & Gen, M. (2008). U-shaped ...
  • Jawahar, N., Gunasekaran, A., & Balaji, N. (2012). A simulated ...
  • Jo, J. B., Li, Y., & Gen, M. (2007). Nonlinear ...
  • Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). ...
  • Klose, A. (2008). Algorithms for solving the single-sink fixed-charge transportation ...
  • Lee, J. E., Gen, M., & Rhee, K. G. (2009). ...
  • Loch, G. V., & da Silva, A. C. L. (2014). ...
  • Loch, G. V., & da Silva, A. C. L. (2014). ...
  • Lotfi, M. M., & Tavakkoli-Moghaddam, R. (2013). A genetic algorithm ...
  • Mahmoodi-Rad, A., Molla-Alizadeh-Zavardehi, S., Dehghan, R., Sanei, M., & Niroomand, ...
  • Molla-Alizadeh-Zavardehi, S., Hajiaghaei-Keshteli, M., & Tavakkoli-Moghaddam, R. (2011). Solving a ...
  • Shetty, B. (1990). A relaxation/decomposition algorithm for the fixed charged ...
  • Steinberg, D. I. (1970). The fixed charge problem. Naval Research Logistics ...
  • Sun, M., & McKeown, P. G. (1993). Tabu search applied ...
  • Sun, M., Aronson, J. E., McKeown, P. G., & Drinka, ...
  • Sun, M., Aronson, J. E., McKeown, P. G., & Drinka, ...
  • Taguchi, G. (1986). Introduction to quality engineering: designing quality into products ...
  • Tari, F. G., & Hashemi, Z. (2016). A priority based ...
  • Walker, W. E. (1976). A heuristic adjacent extreme point algorithm ...
  • Wright DD, Haehling von Lanzenauer C (1989) Solving the fixed ...
  • Wright, D., & von Lanzenauer, C. H. (1991). COAL: A ...
  • Xie, Fanrong, and Renan Jia. Nonlinear fixed charge transportation problem ...
  • Yadegari, E., Zandieh, M., & Najmi, H. (2015). A hybrid ...
  • Yaghini, M., Momeni, M., & Sarmadi, M. (2012). A simplex-based ...
  • نمایش کامل مراجع