2013
DOI: 10.12732/ijam.v26i5.4
|View full text |Cite
|
Sign up to set email alerts
|

A New Method to Solve Bi-Objective Transportation Problem

Abstract: In this paper a new method, namely the MMK-method is proposed for finding non-degenerate compromise optimal solution for Bi-objective transportation problem (BTP). The MMK-method derives the set of all possible non-degenerate efficient solutions and it uses the concept of the distance between two points in (x, y) coordinate for finding non-degenerate compromise optimal solution to BTP. A numerical example is given to illustrate the proposed method. A comparative study has also been made between the existing me… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0
1

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(21 citation statements)
references
References 2 publications
0
10
0
1
Order By: Relevance
“…The analyst solves the resulting problem by methods such as goal programming and lexicographic goal programming (Quddoos, Javaid, Ali, & Khalid, 2013), and present the solution to the DM.…”
Section: Priori Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…The analyst solves the resulting problem by methods such as goal programming and lexicographic goal programming (Quddoos, Javaid, Ali, & Khalid, 2013), and present the solution to the DM.…”
Section: Priori Methodsmentioning
confidence: 99%
“…Researchers proposed methods and algorithms to find the best compromise solution such as Hu, Teng, and Li (2007), Yadav (2011), Quddoos, Javaid, Ali, andKhalid (2013), El-Wahed and Lee (2006) and Li and Lai (2000). Here the question arises for DMs: what should be the criteria of the best compromise solution?…”
Section: Proposed Criteria For Best Compromise Solutionmentioning
confidence: 99%
See 1 more Smart Citation
“…Unfortunately, Verduzco-Garza [12] did not consider the use of simultaneously deterministic, stochastic and fuzzy parameters that determine the objective function. Quddoos [13] proposed a method of finding a compromise variant of the route by determining the weight of different possible variants. In [14], multi-objective linear programming is used to minimize the distances between ideal objectives to a possible target space by transforming intermediate targets into constraints.…”
Section: Introductionmentioning
confidence: 99%
“…Since there is no connection between the cost parameter of various objectives of the Transportation Problem: these are considered as conflicting and commensurable model of the multi objective transportation problem [MOTP]. Well known researchers like Lee et al 1973 [3], Pandian et al 2011 [4], Quddoos et al 2013 [5] and Nomani et al 2017 [6] etc., therefore worked on more efficient process to solve MOTP.…”
Section: Introductionmentioning
confidence: 99%