Skip to the main content

Engineering Review : International journal for publishing of original researches from the aspect of structural analysis, materials and new technologies in the field of mechanical engineering, shipbuilding, fundamental engineering sciences, computer sciences, electrical engin, Vol. 45 No. 2, 2025.

Original scientific paper

https://doi.org/10.30765/er.2661

An accelerated Benders decomposition algorithm for the multi-item fixed-charge transportation problem

Ali Mahmoodirad ; Department of Mathematics, Babol Branch, Islamic Azad University, Babol, Iran
Dragan Pamucar orcid id orcid.org/0000-0001-8522-1942 ; Széchenyi István University, Győr, Hungary
Dragan Marinković orcid id orcid.org/0000-0002-3583-9434 ; Faculty of Mechanical and Transport Systems, Technische Universität Berlin, Germany; Mechanical Science Institute, Vilnius Gediminas Technical University-VILNIUS TECH, Plytinės st. 25, LT-10105 Vilnius, Lithuania
Sadegh Niroomand ; Department of Industrial Engineering, Firouzabad Higher Education Center, Shiraz University of Technology, Shiraz, Iran *

* Corresponding author.

Full text: english pdf 1.097 Kb

page 52-66

downloads: 53

cite

Abstract

In today’s industrial and service sectors the role of transportation is unavoidable. Due to this importance, an optimized transportation plan with minimum transportation costs can be a favor for the managers. In this study a multi-item fixed-charge transportation problem with capacitated multiple transportation mode is considered. As such problem is of high degree of complexity, we focus on the Benders decomposition approach to solve it. For this aim, first the classical Benders decomposition approach is developed for the problem. This is the first time in the literature that the Benders decomposition algorithm is developed for this problem. In continue, as another novelty, an accelerated benders decomposition algorithm is developed for the problem by adding some valid inequalities to the classical Benders decomposition algorithm. These valid inequalities can effectively influence the performance of the classical Benders decomposition algorithm. Several test problems with various sizes are generated to test the proposed solution approaches. The test problems are solved by the classical branch and bound algorithm and the proposed classical and accelerated Benders decomposition algorithms. According to the obtained results the accelerated Benders decomposition algorithm performs better than others in terms of reporting optimal solution and CPU running time.

Keywords

transportation problem; multi-product; multiple transportation mode; complexity; benders decomposition algorithm

Hrčak ID:

335590

URI

https://hrcak.srce.hr/335590

Publication date:

16.5.2025.

Visits: 528 *