A novel approximation method to obtain initial basic feasible solution of transportation problem

Karagül, Kenan; Sahin, Yusuf

doi:10.1016/j.jksues.2019.03.003

Cited by 28 publications

(24 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Furthermore, the solving of TP example used Algorithm 2 (KSAM [18]) showed also the potential to generate not only one or more on IFS. It is caused by weighted transportation cost matrix by demand (WCD) or weighted transportation cost matrix by supply (WCS) which is assigned to select the smallest as a base cell has equal value.…”

Section: Discussionmentioning

confidence: 99%

“…TDM 1 and KSAM add criteria by freely selected the equal highest penalty (Algorithm 1) and equal value of WCD or WCS (Algorithm 2) so that IFS will be obtained. Therefore, the result comparison Of IFS between the new proposed method (Algorithm 3) with the existing methods (Algorithm 1 [12] and Algorithm 2 [18]) is shown Table 5. In this table can be seen the new proposed algorithm solved the TP example better than TDM 1 and KSAM.…”

Section: Discussionmentioning

confidence: 99%

“…Total Opportunity Cost Matrix -Supreme Cell [17]. The novel approximation method is called Karagul-Sahin Approximation Method (KSAM) [18]. Zack algorithm [19] and Key Cell method (KCM) based avoiding maximum cost cells for making allocation [20].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A combination of TDM and KSAM to determine initial feasible solution of transportation problems

Sam'an

Ifriza

2021

joscex

View full text Add to dashboard Cite

In case of the Transportation Problem (TP), it was found that TP had equal the smallest so that the existing methods will be generated two or more IFS values. The newly developed algorithm is generated through a combination of Total Difference Method (TDM) and Karagul-Sahin Approximation Method (KSAM) algorithm, is capable to determine the initial feasible solution of TP. Based on the numerical illustration of the TP example to evaluate the performance of the new proposed algorithm. The computational performances have been compared to the existing methods (TDM1 and KSAM) and the results shown this algorithm achieved better performance than the existing methods for TP example. The recommendation of the research is the new proposed algorithm integration with Stepping Stone and MODI methods in future research to evaluate the optimal solution of TP and determination of optimal solution in the event of information uncertainty about the parameters of the TP.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

A combination of TDM and KSAM to determine initial feasible solution of transportation problems

Sam'an

Ifriza

2021

joscex

View full text Add to dashboard Cite

show abstract

“…In [28], an alternative method of solving the balanced transport problem, so-called TCM (Tuncay Can Approximation Method), based on the geometric average of transportation costs, was used. A novel method called KSAM (Karagul-Sahin Approximation Method) used to find an initial solution to the transportation problem was proposed in [29]. The solutions obtained by KSAM were as good as the solutions obtained with the VAM method and as fast as the northwest corner method.…”

Section: Modifications Of Existing Methodsmentioning

confidence: 99%

Mathematical Programming and Solution Approaches for Transportation Optimisation in Supply Network

et al. 2021

View full text Add to dashboard Cite

The problem of transport is a special type of mathematical programming designed to search for the optimal distribution network, taking into account the set of suppliers and the set of recipients. This article proposes an innovative approach to solving the transportation problem and devises source codes in GNU Octave (version 3.4.3) to avoid the necessity of carrying out enormous calculations in traditional methods and to minimize transportation costs, fuel consumption, and CO2 emission. The paper presents a numerical example of a solution to the transportation problem using: the northwest corner, the least cost in the matrix, the row minimum, and Vogel’s Approximation Methods (VAM). The joint use of mathematical programming and optimization was applicable to real conditions. The transport was carried out with medium load trucks. Both suppliers and recipients of materials were located geographically within the territory of the Republic of Poland. The presented model was supported by a numerical example with interpretation and visualization of the obtained results. The implementation of the proposed solution enables the user to develop an optimal transport plan for individually defined criteria.

show abstract

“…Amaliah et al [4] suggested finding the initial basic feasible solution based on the heuristic method. Karagul and Sahin [5] established the Karagul-Sahin approximation method to arrive at an efficient initial basic feasible solution while dealing with the TP. Instead of the optimal solution, the optimal compromise solution or effective solution is found for the MOTPs.…”

Section: Introductionmentioning

confidence: 99%

Solving the Multiobjective Fractional Transportation Problem through the Neutrosophic Goal Programming Approach

Veeramani

Edalatpanah

Sharanya

2021

Discrete Dynamics in Nature and Society

View full text Add to dashboard Cite

Nowadays, the transportation problem is a multiobjective decision-making problem. It involves deciding to determine the ideal transportation setup that matches the decision maker’s preferences while taking into account competing objectives/criteria such as transportation cost, transportation time, and environmental and social concerns. This study presents a general framework of the multiobjective fractional transportation problem (MOFTP) to deal with such complex scenarios. This paper’s major goal is to propose a solution methodology to solve the MOFTP based on a neutrosophic goal programming (NGP) approach. By obtaining the optimal compromise solution using three memberships, namely, truth membership, indeterminacy membership, and falsity membership, the suggested technique gives a novel insight into solving the MOFTP. A real-world problem such as selling wind turbine blades’ problem and a numerical example are used to demonstrate the efficacy and superiority of the proposed method.

show abstract

A novel approximation method to obtain initial basic feasible solution of transportation problem

Cited by 28 publications

References 8 publications

A combination of TDM and KSAM to determine initial feasible solution of transportation problems

A combination of TDM and KSAM to determine initial feasible solution of transportation problems

Mathematical Programming and Solution Approaches for Transportation Optimisation in Supply Network

Solving the Multiobjective Fractional Transportation Problem through the Neutrosophic Goal Programming Approach

Contact Info

Product

Resources

About