Goal programming approach for solving transportation problem with interval cost

2014 ◽  
Vol 26 (3) ◽  
pp. 1143-1154 ◽  
Author(s):  
Samayan Narayanamoorthy ◽  
Paraman Anukokila
2020 ◽  
Vol 30 (1) ◽  
Author(s):  
Hamiden Abd El-Wahed Khalifa

Transportation problem (TP) is a special type of linear programming problem (LPP) where the objective is to minimize the cost of distributing a product from several sources (or origins) to some destinations. This paper addresses a transportation problem in which the costs, supplies, and demands are represented as heptagonal fuzzy numbers. After converting the problem into the corresponding crisp TP using the ranking method, a goal programming (GP) approach is applied for obtaining the optimal solution. The advantage of GP for the decision-maker is easy to explain and implement in real life transportation. The stability set of the first kind corresponding to the optimal solution is determined. A numerical example is given to highlight the solution approach.


2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
C. Veeramani ◽  
S. A. Edalatpanah ◽  
S. Sharanya

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.


2019 ◽  
Vol 53 (1) ◽  
pp. 157-178 ◽  
Author(s):  
Paraman Anukokila ◽  
Bheeman Radhakrishnan ◽  
Antony Anju

In this paper, authors studied a goal programming approach for solving multi-objective fractional transportation problem by representing the parameters (γ, δ) in terms of interval valued fuzzy numbers. Fuzzy goal programming problem with multiple objectives is difficult for the decision makers to determine the goal valued of each objective precisely. The proposed model presents a special type of non-linear (hyperbolic) membership functions to solve multi-objective fractional transportation problem with fuzzy parameters. To illustrate the proposed method numerical examples are solved.


2017 ◽  
Vol 09 (06) ◽  
pp. 1750076 ◽  
Author(s):  
Gurupada Maity ◽  
Sankar Kumar Roy

This paper explores the study of fuzzy transportation problem (FTP) using multi-choice goal-programming approach. Generally, the decision variable in transportation problem (TP) is considered as real variable, but here the decision variable in each node is chosen from a set of multi-choice fuzzy numbers. Here, we formulate a mathematical model of FTP considering fuzzy goal to the objective function. Thereafter, the solution procedure of the proposed model is developed through multi-choice goal programming approach. The proposed approach is not only improved the applicability of goal programming in real world situations but also provided useful insight about the solution of a new class of TP. A real-life numerical experiment is incorporated to analyze the feasibility and usefulness of this paper. The conclusions about our proposed work including future studies are discussed last.


2019 ◽  
Vol 2019 ◽  
pp. 1-6 ◽  
Author(s):  
Hadeel Al Qahtani ◽  
Ali El–Hefnawy ◽  
Maha M. El–Ashram ◽  
Aisha Fayomi

This paper presents the study of a multichoice multiobjective transportation problem (MCMOTP) when at least one of the objectives has multiple aspiration levels to achieve, and the parameters of supply and demand are random variables which are not predetermined. The random variables shall be assumed to follow extreme value distribution, and the demand and supply constraints will be converted from a probabilistic case to a deterministic one using a stochastic approach. A transformation method using binary variables reduces the MCMOTP into a multiobjective transportation problem (MOTP), selecting one aspiration level for each objective from multiple levels. The reduced problem can then be solved with goal programming. The novel adapted approach is significant because it enables the decision maker to handle the many objectives and complexities of real-world transportation problem in one model and find an optimal solution. Ultimately, a mixed-integer mathematical model has been formulated by utilizing GAMS software, and the optimal solution of the proposed model is obtained. A numerical example is presented to demonstrate the solution in detail.


2010 ◽  
Vol 37 (9) ◽  
pp. 1597-1609 ◽  
Author(s):  
Fernando García ◽  
Francisco Guijarro ◽  
Ismael Moya

Sign in / Sign up

Export Citation Format

Share Document