In this paper, a proposed method, namely, zero average method is used for solving fuzzy transportation problems by assuming that a decision-maker is uncertain about the precise values of the transportation costs, demand, and supply of the product. In the proposed method, transportation costs, demand, and supply are represented by generalized trapezoidal fuzzy numbers. To illustrate the proposed method, a numerical example is solved. The proposed method is easy to understand and apply to real-life transportation problems for the decision-makers.
A New Method to Solving Generalized Fuzzy Transportation Problem-Harmonic Mea...AI Publications
Transportation Problem is one of the models in the Linear Programming problem. The objective of this paper is to transport the item from the origin to the destination such that the transport cost should be minimized, and we should minimize the time of transportation. To achieve this, a new approach using harmonic mean method is proposed in this paper. In this proposed method transportation costs are represented by generalized trapezoidal fuzzy numbers. Further comparative studies of the new technique with other existing algorithms are established by means of sample problems.
Multi – Objective Two Stage Fuzzy Transportation Problem with Hexagonal Fuzzy...IJERA Editor
Fuzzy geometric programming approach is used to determine the optimal solution of a multi-objective two stage fuzzy transportation problem in which supplies, demands are hexagonal fuzzy numbers and fuzzy membership of the objective function is defined. This paper aims to find out the best compromise solution among the set of feasible solutions for the multi-objective two stage transportation problem. To illustrate the proposed method, example is used
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
Heptagonal Fuzzy Numbers by Max Min MethodYogeshIJTSRD
In this paper, we propose another methodology for the arrangement of fuzzy transportation problem under a fuzzy environment in which transportation costs are taken as fuzzy Heptagonal numbers. The fuzzy numbers and fuzzy values are predominantly used in various fields. Here, we are converting fuzzy Heptagonal numbers into crisp value by using range technique and then solved by the MAX MIN method for the transportation problem. M. Revathi | K. Nithya "Heptagonal Fuzzy Numbers by Max-Min Method" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-3 , April 2021, URL: https://www.ijtsrd.com/papers/ijtsrd38280.pdf Paper URL: https://www.ijtsrd.com/mathemetics/applied-mathamatics/38280/heptagonal-fuzzy-numbers-by-maxmin-method/m-revathi
Transportation Problem (TP) is an important network structured linear programming problem that arises in several contexts and has deservedly received a great deal of attention in the literature. The central concept in this problem is to find the least total transportation cost of a commodity in order to satisfy demands at destinations using available supplies at origins in a crisp environment. In real life situations, the decision maker may not be sure about the precise values of the coefficients belonging to the transportation problem. The aim of this paper is to introduce a formulation of TP involving Triangular fuzzy numbers for the transportation costs and values of supplies and demands. We propose a two-step method for solving fuzzy transportation problem where all of the parameters are represented by non-negative triangular fuzzy numbers i.e., an Interval Transportation Problems (TPIn) and a Classical Transport Problem (TP). Since the proposed approach is based on classical approach it is very easy to understand and to apply on real life transportation problems for the decision makers. To illustrate the proposed approach two application examples are solved. The results show that the proposed method is simpler and computationally more efficient than existing methods in the literature.
A New Method to Solving Generalized Fuzzy Transportation Problem-Harmonic Mea...AI Publications
Transportation Problem is one of the models in the Linear Programming problem. The objective of this paper is to transport the item from the origin to the destination such that the transport cost should be minimized, and we should minimize the time of transportation. To achieve this, a new approach using harmonic mean method is proposed in this paper. In this proposed method transportation costs are represented by generalized trapezoidal fuzzy numbers. Further comparative studies of the new technique with other existing algorithms are established by means of sample problems.
Multi – Objective Two Stage Fuzzy Transportation Problem with Hexagonal Fuzzy...IJERA Editor
Fuzzy geometric programming approach is used to determine the optimal solution of a multi-objective two stage fuzzy transportation problem in which supplies, demands are hexagonal fuzzy numbers and fuzzy membership of the objective function is defined. This paper aims to find out the best compromise solution among the set of feasible solutions for the multi-objective two stage transportation problem. To illustrate the proposed method, example is used
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
Heptagonal Fuzzy Numbers by Max Min MethodYogeshIJTSRD
In this paper, we propose another methodology for the arrangement of fuzzy transportation problem under a fuzzy environment in which transportation costs are taken as fuzzy Heptagonal numbers. The fuzzy numbers and fuzzy values are predominantly used in various fields. Here, we are converting fuzzy Heptagonal numbers into crisp value by using range technique and then solved by the MAX MIN method for the transportation problem. M. Revathi | K. Nithya "Heptagonal Fuzzy Numbers by Max-Min Method" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-3 , April 2021, URL: https://www.ijtsrd.com/papers/ijtsrd38280.pdf Paper URL: https://www.ijtsrd.com/mathemetics/applied-mathamatics/38280/heptagonal-fuzzy-numbers-by-maxmin-method/m-revathi
Transportation Problem (TP) is an important network structured linear programming problem that arises in several contexts and has deservedly received a great deal of attention in the literature. The central concept in this problem is to find the least total transportation cost of a commodity in order to satisfy demands at destinations using available supplies at origins in a crisp environment. In real life situations, the decision maker may not be sure about the precise values of the coefficients belonging to the transportation problem. The aim of this paper is to introduce a formulation of TP involving Triangular fuzzy numbers for the transportation costs and values of supplies and demands. We propose a two-step method for solving fuzzy transportation problem where all of the parameters are represented by non-negative triangular fuzzy numbers i.e., an Interval Transportation Problems (TPIn) and a Classical Transport Problem (TP). Since the proposed approach is based on classical approach it is very easy to understand and to apply on real life transportation problems for the decision makers. To illustrate the proposed approach two application examples are solved. The results show that the proposed method is simpler and computationally more efficient than existing methods in the literature.
The paper talks about the pentagonal Neutrosophic sets and its operational law. The paper presents the cut of single valued pentagonal Neutrosophic numbers and additionally introduced the arithmetic operation of single-valued pentagonal Neutrosophic numbers. Here, we consider a transportation problem with pentagonal Neutrosophic numbers where the supply, demand and transportation cost is uncertain. Taking the benefits of the properties of ranking functions, our model can be changed into a relating deterministic form, which can be illuminated by any method. Our strategy is easy to assess the issue and can rank different sort of pentagonal Neutrosophic numbers. To legitimize the proposed technique, some numerical tests are given to show the adequacy of the new model.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
We give a modified version of a heuristic, available in the relevant literature, of the capacitated facility
location problem. A numerical experiment is performed to compare the two heuristics. The study would
help to design heuristics for different generalizations of the problem.
We all make choices between alternatives every day in many contexts - not just transport. There is theory to help planners forecast those decisions, but it is generally poorly understood. The aim of this presentation is to be of particular relevance to all PhD students and early career researchers - who should know something about DCM even if not planning to work in that area. No prior knowledge necessary.
Tony Fowkes first joined ITS in September 1976, coming from the University's School of Economic Studies, where he had been lecturing. Initially he worked on Car Ownership Forecasting, before working in a wide variety of areas of Transport Planning. In 1982 he joined the first UK Value of Time study, as well as a parallel project on Business Travel which led to pioneering work on Business Value of Time. On both those projects he helped to develop the new technique of Stated Preference estimation. In 1984 he began 4 years here as British Railways Senior Rail Research Fellow. He then moved to a mix of teaching and research, jointly with LUBS. He has published widely and contributed to many influential reports for government bodies. He retired in October 2016 as Reader in Transport Econometrics, and is now a Visiting Reader at ITS.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
In this paper, Assignment problem with crisp, fuzzy and intuitionistic fuzzy numbers as cost coefficients is investigated. In conventional assignment problem, cost is always certain. This paper develops an approach to solve a mixed intuitionistic fuzzy assignment problem where cost is considered real, fuzzy and an intuitionistic fuzzy numbers. Ranking procedure of Annie Varghese and Sunny Kuriakose [4] is used to transform the mixed intuitionistic fuzzy assignment problem into a crisp one so that the conventional method may be applied to solve the assignment problem. The method is illustrated by a numerical example. The proposed method is very simple and easy to understand. Numerical examples show that an intuitionistic fuzzy ranking method offers an effective tool for handling an intuitionistic fuzzy assignment problem.
Multi-Index Bi-Criterion Transportation Problem: A Fuzzy ApproachIJAEMSJORNAL
This paper represents a non linear bi-criterion generalized multi-index transportation problem (BGMTP) is considered. The generalized transportation problem (GTP) arises in many real-life applications. It has the form of a classical transportation problem, with the additional assumption that the quantities of goods change during the transportation process. Here the fuzzy constraints are used in the demand and in the budget. An efficient new solution procedure is developed keeping the budget as the first priority. All efficient time-cost trade-off pairs are obtained. D1-distance is calculated to each trade-off pair from the ideal solution. Finally optimum solution is reached by using D1-distance.
Algorithm Finding Maximum Concurrent Multicommodity Linear Flow with Limited ...IJCNCJournal
Graphs and extended networks are is powerful mathematical tools applied in many fields as transportation,
communication, informatics, economy, … Algorithms to find Maximum Concurrent Multicommodity Flow
with Limited Cost on extended traffic networks are introduced in the works we did. However, with those
algorithms, capacities of two-sided lines are shared fully for two directions. This work studies the more
general and practical case, where flows are limited to use two-sided lines with a single parameter called
regulating coefficient. The algorithm is presented in the programming language Java. The algorithm is
coded in programming language Java with extended network database in database management system
MySQL and offers exact results.
Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
(Prefer mailing. Call in emergency )
A wide variety of combinatorial problems can be viewed as Weighted Constraint Satisfaction Problems (WCSPs). All resolution methods have an exponential time complexity for big instances. Moreover, they combine several techniques, use a wide variety of concepts and notations that are difficult to understand and implement. In this paper, we model this problem in terms of an original 0-1 quadratic programming subject to linear constraints. This model is validated by the proposed and demonstrated theorem. View its performance, we use the Hopfield neural network to solve the obtained model basing on original energy function. To validate our model, we solve several instances of benchmarking WCSP. Our approach has the same memory complexity as the HNN and the same time complexity as Euler-Cauchy method. In this regard, our approach recognizes the optimal solution of the said instances.
A Minimum Spanning Tree Approach of Solving a Transportation Probleminventionjournals
: This work centered on the transportation problem in the shipment of cable troughs for an underground cable installation from three supply ends to four locations at a construction site where they are needed; in which case, we sought to minimize the cost of shipment. The problem was modeled into a bipartite network representation and solved using the Kruskal method of minimum spanning tree; after which the solution was confirmed with TORA Optimization software version 2.00. The result showed that the cost obtained in shipping the cable troughs under the application of the method, which was AED 2,022,000 (in the United Arab Emirate Dollar), was more effective than that obtained from mere heuristics when compared
In conventional transportation problem (TP), all the parameters are always certain. But, many of the real life situations in industry or organization, the parameters (supply, demand and cost) of the TP are not precise which are imprecise in nature in different factors like the market condition, variations in rates of diesel, traffic jams, weather in hilly areas, capacity of men and machine, long power cut, labourer’s over time work, unexpected failures in machine, seasonal changesandmanymore. Tocountertheseproblems,dependingonthenatureoftheparameters, theTPisclassifiedintotwocategoriesnamelytype-2andtype-4fuzzytransportationproblems (FTPs) under uncertain environment and formulates the problem and utilizes the trapezoidal fuzzy number (TrFN) to solve the TP. The existing ranking procedure of Liou and Wang (1992)isusedtotransformthetype-2andtype-4FTPsintoacrisponesothattheconventional method may be applied to solve the TP. Moreover, the solution procedure differs from TP to type-2 and type-4 FTPs in allocation step only. Therefore a simple and efficient method denoted by PSK (P. Senthil Kumar) method is proposed to obtain an optimal solution in terms of TrFNs. From this fuzzy solution, the decision maker (DM) can decide the level of acceptance for the transportation cost or profit. Thus, the major applications of fuzzy set theory are widely used in areas such as inventory control, communication network, aggregate planning, employment scheduling, and personnel assignment and so on.
Modified Procedure to Solve Fuzzy Transshipment Problem by using Trapezoidal ...inventionjournals
This paper deals with the large scale transshipment problem in Fuzzy Environment. Here we determine the efficient solutions for the large scale Fuzzy transshipment problem. Vogel’s approximation method (VAM) is a technique for finding the good initial feasible solution to allocation problem. Here Vogel’s Approximation Method (VAM) is used to find the efficient initial solution for the large scale transshipment problem.
The paper talks about the pentagonal Neutrosophic sets and its operational law. The paper presents the cut of single valued pentagonal Neutrosophic numbers and additionally introduced the arithmetic operation of single-valued pentagonal Neutrosophic numbers. Here, we consider a transportation problem with pentagonal Neutrosophic numbers where the supply, demand and transportation cost is uncertain. Taking the benefits of the properties of ranking functions, our model can be changed into a relating deterministic form, which can be illuminated by any method. Our strategy is easy to assess the issue and can rank different sort of pentagonal Neutrosophic numbers. To legitimize the proposed technique, some numerical tests are given to show the adequacy of the new model.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
We give a modified version of a heuristic, available in the relevant literature, of the capacitated facility
location problem. A numerical experiment is performed to compare the two heuristics. The study would
help to design heuristics for different generalizations of the problem.
We all make choices between alternatives every day in many contexts - not just transport. There is theory to help planners forecast those decisions, but it is generally poorly understood. The aim of this presentation is to be of particular relevance to all PhD students and early career researchers - who should know something about DCM even if not planning to work in that area. No prior knowledge necessary.
Tony Fowkes first joined ITS in September 1976, coming from the University's School of Economic Studies, where he had been lecturing. Initially he worked on Car Ownership Forecasting, before working in a wide variety of areas of Transport Planning. In 1982 he joined the first UK Value of Time study, as well as a parallel project on Business Travel which led to pioneering work on Business Value of Time. On both those projects he helped to develop the new technique of Stated Preference estimation. In 1984 he began 4 years here as British Railways Senior Rail Research Fellow. He then moved to a mix of teaching and research, jointly with LUBS. He has published widely and contributed to many influential reports for government bodies. He retired in October 2016 as Reader in Transport Econometrics, and is now a Visiting Reader at ITS.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
In this paper, Assignment problem with crisp, fuzzy and intuitionistic fuzzy numbers as cost coefficients is investigated. In conventional assignment problem, cost is always certain. This paper develops an approach to solve a mixed intuitionistic fuzzy assignment problem where cost is considered real, fuzzy and an intuitionistic fuzzy numbers. Ranking procedure of Annie Varghese and Sunny Kuriakose [4] is used to transform the mixed intuitionistic fuzzy assignment problem into a crisp one so that the conventional method may be applied to solve the assignment problem. The method is illustrated by a numerical example. The proposed method is very simple and easy to understand. Numerical examples show that an intuitionistic fuzzy ranking method offers an effective tool for handling an intuitionistic fuzzy assignment problem.
Multi-Index Bi-Criterion Transportation Problem: A Fuzzy ApproachIJAEMSJORNAL
This paper represents a non linear bi-criterion generalized multi-index transportation problem (BGMTP) is considered. The generalized transportation problem (GTP) arises in many real-life applications. It has the form of a classical transportation problem, with the additional assumption that the quantities of goods change during the transportation process. Here the fuzzy constraints are used in the demand and in the budget. An efficient new solution procedure is developed keeping the budget as the first priority. All efficient time-cost trade-off pairs are obtained. D1-distance is calculated to each trade-off pair from the ideal solution. Finally optimum solution is reached by using D1-distance.
Algorithm Finding Maximum Concurrent Multicommodity Linear Flow with Limited ...IJCNCJournal
Graphs and extended networks are is powerful mathematical tools applied in many fields as transportation,
communication, informatics, economy, … Algorithms to find Maximum Concurrent Multicommodity Flow
with Limited Cost on extended traffic networks are introduced in the works we did. However, with those
algorithms, capacities of two-sided lines are shared fully for two directions. This work studies the more
general and practical case, where flows are limited to use two-sided lines with a single parameter called
regulating coefficient. The algorithm is presented in the programming language Java. The algorithm is
coded in programming language Java with extended network database in database management system
MySQL and offers exact results.
Dear students get fully solved assignments
Send your semester & Specialization name to our mail id :
“ help.mbaassignments@gmail.com ”
or
Call us at : 08263069601
(Prefer mailing. Call in emergency )
A wide variety of combinatorial problems can be viewed as Weighted Constraint Satisfaction Problems (WCSPs). All resolution methods have an exponential time complexity for big instances. Moreover, they combine several techniques, use a wide variety of concepts and notations that are difficult to understand and implement. In this paper, we model this problem in terms of an original 0-1 quadratic programming subject to linear constraints. This model is validated by the proposed and demonstrated theorem. View its performance, we use the Hopfield neural network to solve the obtained model basing on original energy function. To validate our model, we solve several instances of benchmarking WCSP. Our approach has the same memory complexity as the HNN and the same time complexity as Euler-Cauchy method. In this regard, our approach recognizes the optimal solution of the said instances.
A Minimum Spanning Tree Approach of Solving a Transportation Probleminventionjournals
: This work centered on the transportation problem in the shipment of cable troughs for an underground cable installation from three supply ends to four locations at a construction site where they are needed; in which case, we sought to minimize the cost of shipment. The problem was modeled into a bipartite network representation and solved using the Kruskal method of minimum spanning tree; after which the solution was confirmed with TORA Optimization software version 2.00. The result showed that the cost obtained in shipping the cable troughs under the application of the method, which was AED 2,022,000 (in the United Arab Emirate Dollar), was more effective than that obtained from mere heuristics when compared
In conventional transportation problem (TP), all the parameters are always certain. But, many of the real life situations in industry or organization, the parameters (supply, demand and cost) of the TP are not precise which are imprecise in nature in different factors like the market condition, variations in rates of diesel, traffic jams, weather in hilly areas, capacity of men and machine, long power cut, labourer’s over time work, unexpected failures in machine, seasonal changesandmanymore. Tocountertheseproblems,dependingonthenatureoftheparameters, theTPisclassifiedintotwocategoriesnamelytype-2andtype-4fuzzytransportationproblems (FTPs) under uncertain environment and formulates the problem and utilizes the trapezoidal fuzzy number (TrFN) to solve the TP. The existing ranking procedure of Liou and Wang (1992)isusedtotransformthetype-2andtype-4FTPsintoacrisponesothattheconventional method may be applied to solve the TP. Moreover, the solution procedure differs from TP to type-2 and type-4 FTPs in allocation step only. Therefore a simple and efficient method denoted by PSK (P. Senthil Kumar) method is proposed to obtain an optimal solution in terms of TrFNs. From this fuzzy solution, the decision maker (DM) can decide the level of acceptance for the transportation cost or profit. Thus, the major applications of fuzzy set theory are widely used in areas such as inventory control, communication network, aggregate planning, employment scheduling, and personnel assignment and so on.
Modified Procedure to Solve Fuzzy Transshipment Problem by using Trapezoidal ...inventionjournals
This paper deals with the large scale transshipment problem in Fuzzy Environment. Here we determine the efficient solutions for the large scale Fuzzy transshipment problem. Vogel’s approximation method (VAM) is a technique for finding the good initial feasible solution to allocation problem. Here Vogel’s Approximation Method (VAM) is used to find the efficient initial solution for the large scale transshipment problem.
A Minimum Spanning Tree Approach of Solving a Transportation Probleminventionjournals
: This work centered on the transportation problem in the shipment of cable troughs for an underground cable installation from three supply ends to four locations at a construction site where they are needed; in which case, we sought to minimize the cost of shipment. The problem was modeled into a bipartite network representation and solved using the Kruskal method of minimum spanning tree; after which the solution was confirmed with TORA Optimization software version 2.00. The result showed that the cost obtained in shipping the cable troughs under the application of the method, which was AED 2,022,000 (in the United Arab Emirate Dollar), was more effective than that obtained from mere heuristics when compared.
Transportation problem is an important network structured linear programming problem that arises in several contexts and has deservedly received a great deal of attention in the literature. The central concept in this problem is to find the least total transportation cost of a commodity in order to satisfy demands at destinations using available supplies at origins in a crisp environment. In real life situations, the decision maker may not be sure about the precise values of the coefficients belonging to the transportation problem. The aim of this paper is to introduce a formulation of fully fuzzy transportation problem involving trapezoidal fuzzy numbers for the transportation costs and values of supplies and demands. We propose a two-step method for solving fuzzy transportation problem where all of the parameters are represented by triangular fuzzy numbers i.e. two interval transportation problems. Since the proposed approach is based on classical approach it is very easy to understand and to apply on real life transportation problems for the decision makers. To illustrate the proposed approach four application examples are solved. The results show that the proposed method is simpler and computationally more efficient than existing methods in the literature.
Examining the trend of the global economy shows that global trade is moving towards high-tech products. Given that these products generate very high added value, countries that can produce and export these products will have high growth in the industrial sector. The importance of investing in advanced technologies for economic and social growth and development is so great that it is mentioned as one of the strong levers to achieve development. It should be noted that the policy of developing advanced technologies requires consideration of various performance aspects, risks and future risks in the investment phase. Risk related to high-tech investment projects has a meaning other than financial concepts only. In recent years, researchers have focused on identifying, analyzing, and prioritizing risk. There are two important components in measuring investment risk in high-tech industries, which include identifying the characteristics and criteria for measuring system risk and how to measure them. This study tries to evaluate and rank the investment risks in advanced industries using fuzzy TOPSIS technique based on verbal variables.
A New Approach to Solve Initial Basic Feasible Solution for the Transportatio...Dr. Amarjeet Singh
In transportation problem the main requirement is
to find the Initial Basic Feasible Solution for the transportation
problem. The objective of the transportation problem is to
minimize the cost. In this paper, a new algorithm (i.e.) Row
Implied Cost Method(RICM) which is proposed to find an
initial basic feasible solution for the transportation problem.
This method is illustrated with numerical examples.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Solving real world delivery problem using improved max-min ant system with lo...ijaia
This paper presents a solution to real-world delive
ry problems (RWDPs) for home delivery services wher
e
a large number of roads exist in cities and the tra
ffic on the roads rapidly changes with time. The
methodology for finding the shortest-travel-time to
ur includes a hybrid meta-heuristic that combines a
nt
colony optimization (ACO) with Dijkstra’s algorithm
, a search technique that uses both real-time traff
ic
and predicted traffic, and a way to use a real-worl
d road map and measured traffic in Japan. We
previously proposed a hybrid ACO for RWDPs that use
d a MAX-MIN Ant System (MMAS) and proposed a
method to improve the search rate of MMAS. Since tr
affic on roads changes with time, the search rate i
s
important in RWDPs. In the current work, we combine
the hybrid ACO method with the improved MMAS.
Experimental results using a map of central Tokyo a
nd historical traffic data indicate that the propos
ed
method can find a better solution than conventional
methods.
The article presents different approaches to finding the optimal solution for a problem, which extends the classical traveling salesman problem. Takes into consideration the possibility of choosing a toll highway and the standard road between two cities. Describes the experimentation system. Provides mathematical model, results of the investigation, and a conclusion.
Traveling Salesman Problem in Distributed Environmentcsandit
In this paper, we focus on developing parallel algorithms for solving the traveling salesman problem (TSP) based on Nicos Christofides algorithm released in 1976. The parallel algorithm
is built in the distributed environment with multi-processors (Master-Slave). The algorithm is installed on the computer cluster system of National University of Education in Hanoi,
Vietnam (ccs1.hnue.edu.vn) and uses the library PJ (Parallel Java). The results are evaluated and compared with other works.
TRAVELING SALESMAN PROBLEM IN DISTRIBUTED ENVIRONMENTcscpconf
In this paper, we focus on developing parallel algorithms for solving the traveling salesman
problem (TSP) based on Nicos Christofides algorithm released in 1976. The parallel algorithm
is built in the distributed environment with multi-processors (Master-Slave). The algorithm is
installed on the computer cluster system of National University of Education in Hanoi,
Vietnam (ccs1.hnue.edu.vn) and uses the library PJ (Parallel Java). The results are evaluated
and compared with other works.
Computer Science
Active and Programmable Networks
Active safety systems
Ad Hoc & Sensor Network
Ad hoc networks for pervasive communications
Adaptive, autonomic and context-aware computing
Advance Computing technology and their application
Advanced Computing Architectures and New Programming Models
Advanced control and measurement
Aeronautical Engineering,
Agent-based middleware
Alert applications
Automotive, marine and aero-space control and all other control applications
Autonomic and self-managing middleware
Autonomous vehicle
Biochemistry
Bioinformatics
BioTechnology(Chemistry, Mathematics, Statistics, Geology)
Broadband and intelligent networks
Broadband wireless technologies
CAD/CAM/CAT/CIM
Call admission and flow/congestion control
Capacity planning and dimensioning
Changing Access to Patient Information
Channel capacity modelling and analysis
Civil Engineering,
Cloud Computing and Applications
Collaborative applications
Communication application
Communication architectures for pervasive computing
Communication systems
Computational intelligence
Computer and microprocessor-based control
Computer Architecture and Embedded Systems
Computer Business
Computer Sciences and Applications
Computer Vision
Computer-based information systems in health care
Computing Ethics
Computing Practices & Applications
Congestion and/or Flow Control
Content Distribution
Context-awareness and middleware
Creativity in Internet management and retailing
Cross-layer design and Physical layer based issue
Cryptography
Data Base Management
Data fusion
Data Mining
Data retrieval
Data Storage Management
Decision analysis methods
Decision making
Digital Economy and Digital Divide
Digital signal processing theory
Distributed Sensor Networks
Drives automation
Drug Design,
Drug Development
DSP implementation
E-Business
E-Commerce
E-Government
Electronic transceiver device for Retail Marketing Industries
Electronics Engineering,
Embeded Computer System
Emerging advances in business and its applications
Emerging signal processing areas
Enabling technologies for pervasive systems
Energy-efficient and green pervasive computing
Environmental Engineering,
Estimation and identification techniques
Evaluation techniques for middleware solutions
Event-based, publish/subscribe, and message-oriented middleware
Evolutionary computing and intelligent systems
Expert approaches
Facilities planning and management
Flexible manufacturing systems
Formal methods and tools for designing
Fuzzy algorithms
Fuzzy logics
GPS and location-based app
In conventional transportation problem (TP), supplies, demands and costs are always certain. This paper develops an approach to solve the unbalanced transportation problem where as all the parameters are not in deterministic numbers but imprecise ones. Here, all the parameters of the TP are considered to the triangular intuitionistic fuzzy numbers (TIFNs). The existing ranking procedure of Varghese and Kuriakose is used to transform the unbalanced intuitionistic fuzzy transportation problem (UIFTP) into a crisp one so that the conventional method may be applied to solve the TP. The occupied cells of unbalanced crisp TP that we obtained are as same as the occupied cells of UIFTP.
On the basis of this idea the solution procedure is differs from unbalanced crisp TP to UIFTP in allocation step only. Therefore, the new method and new multiplication operation on triangular intuitionistic fuzzy number (TIFN) is proposed to find the optimal solution in terms of TIFN. The main advantage of this method is computationally very simple, easy to understand and also the optimum objective value obtained by our method is physically meaningful.
The assignment problem is a special type of linear programming problem and it is sub class of transportation problem. Assignment problems are defined with two sets of inputs i.e. set of resources and set of demands. Hungarian algorithm is able to solve assignment problems with precisely defined demands and resources.Nowadays, many organizations and competition companies consider markets of their products. They use many salespersons to improve their organizations marketing. Salespersons travel form one city to another city for their markets. There are some problems in travelling which salespeople should go which city in minimum cost. So, travelling assignment problem is a main process for many business functions. Mie Mie Aung | Yin Yin Cho | Khin Htay | Khin Soe Myint "Minimization of Assignment Problems" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd26712.pdfPaper URL: https://www.ijtsrd.com/computer-science/other/26712/minimization-of-assignment-problems/mie-mie-aung
“An Alternate Approach to Find an Optimal Solution of a Transportation Problem.”IOSRJM
The Transportation Problem is the special class of Linear Programming Problem. It arises when the situation in which a commodity is shipped from sources to destinations. The main object is to determine the amounts shipped from each sources to each destinations which minimize the total shipping cost while satisfying both supply criteria and demand requirements. In this paper, we are giving the idea about to finding the Initial Basic Feasible solution as well as the optimal solution or near to the optimal solution of a Transportation problem using the method known as “An Alternate Approach to find an optimal Solution of a Transportation Problem”. An Algorithm provided here, concentrate at unoccupied cells and proceeds further. Also, the numerical examples are provided to explain the proposed algorithm. However, the above method gives a step by step development of the solution procedure for finding an optimal solution.
Similar to New Method for Finding an Optimal Solution of Generalized Fuzzy Transportation Problems (20)
Introduction to AI for Nonprofits with Tapp NetworkTechSoup
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
Instructions for Submissions thorugh G- Classroom.pptxJheel Barad
This presentation provides a briefing on how to upload submissions and documents in Google Classroom. It was prepared as part of an orientation for new Sainik School in-service teacher trainees. As a training officer, my goal is to ensure that you are comfortable and proficient with this essential tool for managing assignments and fostering student engagement.
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
The Roman Empire A Historical Colossus.pdfkaushalkr1407
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
Honest Reviews of Tim Han LMA Course Program.pptxtimhan337
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
A Strategic Approach: GenAI in EducationPeter Windle
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
New Method for Finding an Optimal Solution of Generalized Fuzzy Transportation Problems
1. www.ajms.com 19
ISSN 2581-3463
RESEARCH ARTICLE
New Method for Finding an Optimal Solution of Generalized Fuzzy Transportation
Problems
Srinivasarao Thota1
, P. Raja2
1
Department of Applied Mathematics, School of Applied Natural Sciences, Adama Science and Technology
University, Post Box No. 1888, Adama, Ethiopia, 2
Department of Mathematics, Periyar University College Arts
and Science, Dharmapuri, Tamil Nadu, India
Received: 20-04-2020; Revised: 15-05-2020; Accepted: 01-06-2020
ABSTRACT
In this paper, a proposed method, namely, zero average method is used for solving fuzzy transportation
problems by assuming that a decision-maker is uncertain about the precise values of the transportation
costs, demand, and supply of the product. In the proposed method, transportation costs, demand, and
supply are represented by generalized trapezoidal fuzzy numbers. To illustrate the proposed method,
a numerical example is solved. The proposed method is easy to understand and apply to real-life
transportation problems for the decision-makers.
Key words: Fuzzy transportation problem, generalized trapezoidal fuzzy number, ranking function,
zero average method
INTRODUCTION
Thetransportationproblemisanimportantnetwork
structured in linear programming (LP) problem
that arises in several contexts and has deservedly
received a great deal of attention in the literature.
Thecentralconceptintheproblemistofindtheleast
total transportation cost of a commodity to satisfy
demands at destinations using available supplies
at origins. Transportation problem can be used for
a wide variety of situations such as scheduling,
production, investment, plant location, inventory
control, employment scheduling, and many others.
In general, transportation problems are solved
with the assumptions that the transportation costs
and values of supplies and demands are specified
in a precise way, that is, in a crisp environment.
However, in many cases, the decision-makers
have no crisp information about the coefficients
belonging to the transportation problem. In these
cases, the corresponding coefficients or elements
defining the problem can be formulated by means
Address for correspondence:
Srinivasarao Thota
E-mail: srinivasarao.thota@astu.edu.et
of fuzzy sets, and the fuzzy transportation problem
(FTP) appears in a natural way.
The basic transportation problem was originally
developed by Hitchcock.[1]
The transportation
problemscanbemodeledasastandardLPproblem,
which can then be solved by the simplex method.
However, due to its very special mathematical
structure, it was recognized early that the
simplex method applied to the transportation
problem can be made quite efficient in terms of
how to evaluate the necessary simplex method
information (variable to enter the basis, variable
to leave the basis and optimality conditions).
Charnes and Cooper[2]
developed a stepping
stone method which provides an alternative way
of determining the simplex method information.
Dantzig and Thapa[3]
used the simplex method to
the transportation problem as the primal simplex
transportation method. An Initial Basic Feasible
Solution for the transportation problem can be
obtained by using the Northwest corner rule,
row minima, column minima, matrix minima,
or Vogel’s approximation method. The Modified
Distribution Method is useful for finding the
optimal solution to the transportation problem. In
general, the transportation problems are solved
with the assumptions that the coefficients or cost
2. Thota and Raja: A method for optimal solution of generalized fuzzy transportation problems
AJMS/Apr-Jun-2020/Vol 4/Issue 2 20
parameters are specified in a precise way, that is,
in a crisp environment.
In real life, there are many diverse situations due
to uncertainty in judgments, lack of evidence, etc.
Sometimes, it is not possible to get relevant precise
data for the cost parameter. This type of imprecise
data is not always well represented by a random
variable selected from a probability distribution.
Fuzzy number[4]
may represent the data. Hence,
the fuzzy decision-making method is used here.
Zimmermann[5]
showed that solutions obtained
by the fuzzy LP method and are always efficient.
Subsequently, Zimmermann’s fuzzy LP has
developed into several fuzzy optimization methods
for solving transportation problems. Chanas et al.[6]
presentedafuzzyLPmodelforsolvingtransportation
problems with a crisp cost coefficient, fuzzy
supply, and demand values. Chanas and Kuchta[7]
proposed the concept of the optimal solution for
the transportation problem with fuzzy coefficients
expressed as fuzzy numbers and developed an
algorithm for obtaining the optimal solution. Saad
and Abbas[8]
discussed the solution algorithm
for solving the transportation problem in fuzzy
environment. Liu and Kao[9]
described a method
for solving FTP based on extension principle. Gani
and Razak[10]
presented a two stage cost minimizing
FTP, in which supplies and demands are trapezoidal
fuzzy numbers. A parametric approach is used to
obtain a fuzzy solution, and the aim is to minimize
the sum of the transportation costs in two stages.
Lin[11]
introduced a genetic algorithm to solve
the transportation problem with fuzzy objective
functions. Dinagar and Palanivel[12]
investigated
FTP, with the aid of trapezoidal fuzzy numbers.
Fuzzy modified that the distribution method is
proposed to find the optimal solution in terms of
fuzzy numbers. Pandian and Natarajan[13]
proposed
a new algorithm, namely, fuzzy zero point method
for finding a fuzzy optimal solution for a FTP, where
the transportation cost, supply, and demand are
represented by trapezoidal fuzzy numbers. Edward
Samuel[14-16]
showed the unbalanced FTPs without
converting into a balanced one getting an optimal
solution, where the transportation cost, demand, and
supply are represented by a triangular fuzzy number.
Edward Samuel[17]
proposed algorithmic approach
to unbalanced FTPs, where the transportation cost,
demand, and supply are represented by a triangular
fuzzy number. Edward Samuel[16]
proposed a new
procedure for solving generalized trapezoidal FTP,
where precise values of the transportation costs
only, but there is no uncertainty about the demand
and supply. Edward Samuel[18]
proposed a dual
based approach for solving unbalanced FTP, where
precise values of the transportation cost only, but
there is no uncertainty about the demand and supply.
In the literature, there are many other problems
whicharesolvedbyvariousmethodsviageneralized
trapezoidal fuzzy numbers, for example, see.[19,20-25]
In this paper, a proposed method, namely, zero
averagemethod(ZAM),isusedforsolvingaspecial
type of FTP by assuming that a decision-maker is
uncertain about the precise values of transportation
costs, demand, and supply of the product. In the
proposed method, ZAM transportation costs,
demand, and supply of the product are represented
by generalized trapezoidal fuzzy numbers. To
illustrate the proposed method ZAM, a numerical
example is solved. The proposed method ZAM
is easy to understand and to apply in real-life
transportation problems for the decision-makers.
PRELIMINARIES
In this section, some basic definitions, arithmetic
operations, and an existing method for comparing
generalized fuzzy numbers are presented.
Definition 1:[11]
A fuzzy set à defined on the
universal set of real numbers ℜ is said to be
fuzzy number if its membership function has the
following characteristics:
(i) ( )
A
x
µ : ℜ → [0,1] is continuous.
(ii) µ
A
x
( ) = 0 for all x a d
∈ −∞ ∪ ∞
( , ] [ , ).
(iii) ( )
A
x
µ Strictly increasing on [a, b] and
strictly decreasing on [c, d]
(iv) ( )
A
x
µ =1 for all
x b c where a b c d
∈
[ , ], .
Definition 2: [11]
A fuzzy number à = (a, b, c,
d) is said to be trapezoidal fuzzy number if its
membership function is given by
µ
A
x
x a
b a
a x b
b x c
x d
c d
c x d
o otherwi
( )
( )
( )
, ,
, ,
( )
( )
, ,
,
=
−
−
≤
≤ ≤
−
−
≤
1
s
se.
Definition 3: [12]
A fuzzy set à defined on the
universal set of real numbers ℜ , is said to be
3. Thota and Raja: A method for optimal solution of generalized fuzzy transportation problems
AJMS/Apr-Jun-2020/Vol 4/Issue 2 21
a generalized fuzzy number if its membership
function has the following characteristics:
(i) ( )
A
x
µ : ℜ → [0,ω ] is continuous.
(ii) µ
A
x
( ) = 0 for all x a d
∈ −∞ ∪ ∞
( , ] [ , ).
(iii) ( )
A
x
µ Strictly increasing on [a, b] and
strictly decreasing on [c, d]
(iv) ( )
A
x
µ =ω , for all
x b c where
∈ ≤
[ , ], .
0 1
ω
Definition 4: [12]
A fuzzy number à = (a, b, c, d;
ω) is said to be a generalized trapezoidal fuzzy
number if its membership function is given by
µ
ω
ω
ω
A
x
x a
b a
a x b
b x c
x d
c d
c x d
o other
( )
( )
( )
, ,
, ,
( )
( )
, ,
,
=
−
−
≤
≤ ≤
−
−
≤
w
wise.
Arithmetic operations
In this section, arithmetic operations between two
generalized trapezoidal fuzzy numbers, defined
on the universal set of real numbersℜ , are
presented.[12,18]
LetÃ1
=(a1
,b1
,c1
,d1
;ω1
)andÃ2
=(a2
,
b2
, c2
, d2
; ω2
) are two generalized trapezoidal fuzzy
numbers; then, the following is obtained.
i. Ã1
+ Ã2
= (a1
+ a2
, b1
+ b2
, c1
+ c2
, d1
+ d2
; min
(ω1
, ω2
)),
ii. Ã1
− Ã2
= (a1
− d2
, b1
− b2
, c1
− c2
, d1
− a2
; min
(ω1
, ω2
)),
iii. Ã1
⨂ Ã2 ≅
(a, b, c, d; min (ω1
, ω2
))
Where
a = min (a1
a2
, a1
d2
, a2
d1
, d1
d2
), b = min (b1
b2
, b1
c2
,
c2
b2
, c1
c2
),
c = max (b1
b2
, b1
c2
, c1
b2
, c1
c2
), d = max (a1
a2
, a1
d2
,
a2
d1
, d1
d2
)
iv. λ
λ λ λ λ ω λ
λ λ λ λ ω λ
A
a b c d
d c b a
1
1 1 1 1 1
1 1 1 1 1
0
0
=
( , , , ; ), ,
( , , , ; ), .
Ranking function
An efficient approach for comparing the fuzzy
numbers is by the use of the ranking function,[18,9,13]
ℜ ℜ → ℜ
: ( )
F , where F(ℜ ) is a set of fuzzy
numbers defined on the set of real numbers, which
maps each fuzzy number into the real line, where
a natural order exists, that is,
(i)
A B
ℜ if and only if ℜ ℜ
( ) ( )
A B
(ii)
A B
ℜ if and only if ℜ ℜ
( ) ( )
A B
(iii)
A B
=ℜ if and only if ℜ = ℜ
( ) ( )
A B
Let Ã1
= (a1
, b1
, c1
, d1
; ω1
) and Ã2
= (a2
, b2
, c2
, d2
;
ω2
) be two generalized trapezoidal fuzzy numbers
and ω = min (ω1
, ω2
).
1 1 1 1
1
2 2 2 2
2
( )
( )
4
( )
( ) .
4
a b c d
A
a b c d
A
Then and
ω
ω
+ + +
ℜ =
+ + +
ℜ =
PROPOSED METHOD
In this section, we present the proposed method,
namely ZAM for finding a fuzzy optimal solution,
in which the transportation costs, demand,
and supply are represented by the generalized
trapezoidal fuzzy numbers.
Step 1. Check whether the given FTP is balanced,
go to step 3 if-else go to step 2
Step 2.
• If the given FTP is unbalanced, then any one
of the following two cases may arise
• If the total demand exceeds total supply, then
go to case1 if-else go to case 2.
Case 1.
• Locate the smallest fuzzy cost in each row of
the given cost table and then subtract that from
each fuzzy cost of that row
• Convert into balanced one and then replace
the dummy fuzzy cost of the largest unit fuzzy
transportation cost in the reduced matrix
obtain from case 1 of a
• In the reduced matrix obtained from case 1
of b, locate the smallest fuzzy cost in each
column, and then subtract that from each fuzzy
cost of that column and then go to step 4.
Case 2.
• Locate the smallest fuzzy cost in each column
of the given cost table and then subtract that
from each fuzzy cost of that column
• Convert into balanced one and then replace
the dummy fuzzy cost of the largest unit fuzzy
transportation cost in the reduced matrix
obtain from case 2 of a
• In the reduced matrix obtained from case 2 of
b, locate the smallest fuzzy cost in each row,
and then subtract that from each fuzzy cost of
that row and then go to step 4.
4. Thota and Raja: A method for optimal solution of generalized fuzzy transportation problems
AJMS/Apr-Jun-2020/Vol 4/Issue 2 22
Step 3.
• Locate the smallest fuzzy cost in each row of
the given cost table and then subtract that from
each fuzzy cost of that row, and
• In the reduced matrix obtained from 3(a),
locate the smallest fuzzy cost in each column
and then subtract that from each fuzzy cost of
that column.
Step 4. Select the smallest fuzzy costs (not equal
to zero) in the reduced matrix obtained from step
2 or step 3 and then subtract it by selected smallest
fuzzy cost only. Each row and column now have
at least one fuzzy zero value; if there is no fuzzy
zero, then repeat step 3.
Step 5.
• Select the fuzzy zero (row-wise) and count the
number of fuzzy zeros (excluding selected one)
in row and column and record as a subscript of
selected zero. Repeat the process for all zeros
in the matrix
• Now, choose the value of subscript is minimum
and allocate maximum to that cell. If a tie
occurs for some fuzzy zero values, then find
the average of demand and supply value and
then choose with minimum one.
Step 6. Adjust the supply and demand and cross
out the satisfied the row or column.
Step7.Checkwhethertheresultantmatrixpossesses
at least one fuzzy zero in each and column. If not,
repeat step 3, otherwise go to step 8.
Step 8. Repeat step 3 and step 5 to step 7 until all
the demand and supply are exhausted.
Step 9. Compute total fuzzy transportation cost
for the feasible allocation from the original fuzzy
cost table.
Remark 1: If there is a tie in the values of the
average of demand and supply, then calculate their
corresponding row and column value and select
one with minimum.
NUMERICAL EXAMPLE
To illustrate, the proposed method, namely, ZAM,
the following FTP is solved
Table 1: Fuzzy Transportation Problem for Example 1
Source D1
D2
D3
Supply (ai
)
S1
(11, 13, 14, 18; 0.5) (20, 21, 24, 27; 0.7) (14, 15, 16, 17; 0.4) 13
S2
(6, 7, 8, 11; 0.2) (9, 11, 12, 13; 0.2) (20, 21, 24, 27; 0.7) 20
S3
(14, 15, 17, 18; 0.4) (15, 16, 18, 19; 0.5) (10, 11, 12, 13; 0.6) 5
Demand (bj
) 12 15 11
Example 1: Table 1 gives the availability of
the product available at three sources and their
demand at three destinations, and the approximate
unit transportation cost of the product from each
source to each destination is represented by a
generalized trapezoidal fuzzy number. Determine
the fuzzy optimal transportation of the products
such that the total transportation cost is minimum.
Using step 1, a b
i j
j
i
= =
=
=
∑
∑ 1
3
1
3
38, so the chosen
problem is a balanced FTP.
Iteration 1. Using step 3 and step 4, we get:
Source D1
D2
D3
Supply
(ai
)
S1
(−14, –2, 2,
14; 0.5)
(−5, 2, 8, 18;
0.2)
(−16, –4, 4,
16; 0.4)
13
S2
(−12, –2, 2,
12; 0.2)
(−9, –2, 2, 9;
0.2)
(6, 12, 18,
24; 0.2)
20
S3
(−6, 2, 7, 15;
0.4)
(−5, –1, 4,
11; 0.2)
(−6, –2, 2, 6;
0.6)
5
Demand
(bj
)
12 15 11
Iteration 2. Using step 5 and step 6, we get:
Source D1
D2
D4
Supply
(ai
)
S1
(−14, –2,
2, 14; 0.5)
(−5, 2, 8,
18; 0.2)
(−16, –4, 4, 16;
0.4)
13
S2
(−12, –2,
2, 12; 0.2)
(−9, –2, 2,
9; 0.2)
(6, 12, 18, 24;
0.2)
20
S3
* * (−6, –2, 2, 6;
0.6)5
*
Demand
(bj
)
12 15 6
Iteration 3. Using step 7 and step 8, allocate the
values:
Source D1
D2
D4
Supply
(ai
)
S1
(11, 13, 14,
18; 0.5)7
(20, 21, 24,
27; 0.7)
(14, 15, 16,
17; 0.4)6
*
S2
(6, 7, 8, 11;
0.2)5
(9, 11, 12,
13; 0.2)15
(20, 21, 24,
27; 0.7)
*
S3
(14, 15, 17,
18; 0.4)
(15, 16, 18,
19; 0.5)
(10, 11, 12,
13; 0.6)5
*
Demand
(bj
)
* * *
5. Thota and Raja: A method for optimal solution of generalized fuzzy transportation problems
AJMS/Apr-Jun-2020/Vol 4/Issue 2 23
0
20
40
60
80
100
120
140
160
PROBLEM-1 PROBLEM-2 PROBLEM-3
NWCR
MMM
VAM
MODI
ZAM
Graph 1: Graphical comparisons of ZAM with various existing methods
Table 2: Comparisons of ZAM with existing methods.
Row Column NWCR MMM VAM MODI ZAM
3 3 108.80 99.50 97.50 91.45 91.45
3 4 134.18 95.00 83.00 75.60 75.60
3 3 64.35 73.10 67.60 64.35 64.35
ZAM: Zero Average Method
Example 2:
Source D1
D2
D3
D4
Supply
(ai
)
S1
(11, 12,
13, 15;
0.5)
(16, 17,
19, 21;
0.6)
(28, 30,
34, 35;
0.7)
(4, 5, 8,
9; 0.2)
8
S2
(49, 53,
55, 60;
0.8)
(18, 20,
21, 23;
0.4)
(18, 22,
25, 27;
0.6)
(25, 30,
35, 42;
0.7)
10
S3
(28, 30,
34, 35;
0.7)
(2, 4, 6,
8; 0.2)
(36, 42,
48, 52;
0.8)
(6, 7, 9,
11; 0.3)
11
Demand
(bj
)
4 7 6 12
COMPARATIVE STUDY AND RESULT
ANALYSIS
From the investigations and the results are given in
Table 2, it clear that ZAM is better than NWCR,[6]
MMM,[6]
and VAM[26]
for solving FTP and also,
the solution of the FTP is given by ZAM that is an
optimal solution.
Table
2 represents the solution obtained by
NWCR,[6]
MMM,[6]
VAM,[26]
MODI,[3]
and ZAM.
This data speaks the better performance of the
proposed method. The graphical representation of
the solution obtained by various methods of this
performance, displayed in Graph 1.
CONCLUSION
In this paper, a new method, namely, ZAM, is
proposed for finding an optimal solution of FTPs,
in which the transportation costs, demand, and
supplyoftheproductarerepresentedasgeneralized
Iteration 4. Using step 9 we get:
Source D1
D2
D3
Supply
(ai
)
S1
(11, 13, 14,
18; 0.5)7
(20, 21, 24,
27; 0.7)
(14, 15, 16,
17; 0.4)6
*
S2
(6, 7, 8, 11;
0.2)5
(9, 11, 12,
13; 0.2)15
(20, 21, 24,
27; 0.7)
*
S3
(14, 15, 17,
18; 0.4)
(15, 16, 18,
19; 0.5)
(10, 11, 12,
13; 0.6)5
*
Demand
(bj
)
* * *
The minimum fuzzy transportation cost is equal
to 7 (11, 13, 14, 18; 0.5) + 6 (14, 15, 16, 17; 0.4)
+ 5 (6, 7, 8, 11; 0.2) +15 (9, 11, 12, 13; 0.2) + 5
(10, 11, 12, 13; 0.6) = (376, 436, 474, 543; 0.2).
Therefore, the ranking function R(A) = 91.45
Results with normalization process
If all the values of the parameters used in problem
1 are first normalized and then the problem is
solved by using the ZAM, then the fuzzy optimal
value is is
x0 376 436 474 543 1
= ( , , , ; ).
Results without normalization process
If all the values of the parameters of the same
problem 1 are not normalized and then the problem
is solved using the ZAM, then the fuzzy optimal
value is
x0 376 436 474 543 2
=( , , , ;. ).
Remark 2: Results with normalization process
represent the overall level of satisfaction
of decision-maker about the statement that
minimum transportation cost will lie between
436 and 474 units as 100% while without
normalization process, the overall level of
satisfaction of the decision-maker for the
same range is 20%. Hence, it is better to use
generalized fuzzy numbers instead of normal
fuzzy numbers obtained using the normalization
process.
6. Thota and Raja: A method for optimal solution of generalized fuzzy transportation problems
AJMS/Apr-Jun-2020/Vol 4/Issue 2 24
method for solving fuzzy transportation problems using
ranking function. Far East J Math Sci 2013;75:85-100.
13. Gani A, Razak KA. Two stage fuzzy transportation
problem. J Phys Sci 2006;10:63-9.
14. Hitchcock FL. The distribution of a product from
several sources to numerouslocalities. J Math Phys
1941;20:224-30.
15. Kaufmann A, Gupta MM. Introduction to Fuzzy
Arithmetics: Theory and Applications. New York: Van
Nostrand Reinhold; 1991.
16. Lin FT. Solving the Transportation Problem with
Fuzzy Coefficients Using Genetic Algorithms. India:
Proceedings IEEE International Conference on Fuzzy
Systems; 2009. p. 20-4.
17. Liou TS, Wang MJ. Ranking fuzzy number with integral
values. Fuzzy Sets Syst 1992;50:247-55.
18. Liu ST, Kao C. Solving fuzzy transportation problems
based on extension principle. Eur J Oper Res 2004;
153:661-74.
19.
Mahapatra GS, Roy TK. Fuzzy multi-objective
mathematical programming on reliability optimization
model. Appl Math Comput 2006;174:643-59.
20. Pandian P, Natarajan G. A new algorithm for finding
a fuzzy optimal solution for fuzzy transportation
problems. Appl Math Sci 2010;4:79-90.
21. Reinfeld NV, Vogel WR. Mathematical Programming.
Englewood Clifts, New Jersey: Prentice-Hall; 1958. p.
59-70.
22.
Saad OM, Abbas SA. A parametric study on
transportation problem under fuzzy environment. J
Fuzzy Math 2003;11:115-24.
23. Zadeh LA. Fuzzy sets. Inform Control 1965;8:338-53.
24. Zimmermann HJ. Fuzzy programming and linear
programming with several objective functions. Fuzzy
Sets Syst 1978;1:45-55.
25. Kumar SS, Raja P, Shanmugasundram P, Thota S. A
new method to solving generalized fuzzy transportation
problem-harmonic mean method. Int J Chem Math
Phys 2020;4:51-6.
26. Samuel AE, Raja P, Thota S. A new technique for
solving unbalanced intuitionistic fuzzy transportation
problems. Appl Math Inf Sci 2020;14:459-65.
trapezoidal fuzzy numbers. The advantage of the
proposed method is discussed, and a numerical
example is solved to illustrate the ZAM. The
ZAM is easy to understand and apply for solving
the FTPs occurring in real-life situations.
REFERENCES
1. Kaur A, Kumar A. A new approach for solving fuzzy
transportation problems using generalized trapezoidal
fuzzy numbers. Appl Soft Comput 2012;12:1201-13.
2. Chanas S, Kolodziejckzy W, Machaj AA. A fuzzy
approach to the transportation problem. Fuzzy Sets Syst
1984;13:211-21.
3. Chanas S, Kuchta D.Aconcept of the optimal solution of
the transportation problem with fuzzy cost coefficients.
Fuzzy Sets Syst 1996;82:299-305.
4. Charnes A, Cooper WW. The stepping-stone method
for explaining linear programming calculation in
transportation problem. Manage Sci 1954;l:49-69.
5. Charnes A, Cooper WW, Henderson A. An Introduction
to Linear Programming. New York: Willey; 1953. p. 113.
6. Chen SJ, Chen SM. Fuzzy risk analysis on the ranking
of generalized trapezoidal fuzzy numbers. Appl Intell
2007;26:1-11.
7. Chen SM, Chen JH. Fuzzy risk analysis based on the
ranking generalized fuzzy numbers withdifferent heights
and different spreads. Expert SystAppl 2009;36:6833-42.
8. Dantzig GB, Thapa MN. Linear Programming, Theory
and Extensions. New Jersey: Princeton University
Press, Springer; 1963.
9. Dinagar DS, Palanivel K. The transportation problem
in fuzzy environment. Int J Algorithms Comput Math
2009;2:65-71.
10. Samuel AE, Venkatachalapathy M. A new dual based
approach for the unbalanced fuzzy transportation
problem. Appl Math Sci 2012;6:4443-55.
11. Samuel AE, Venkatachalapathy M. A new procedure
for solving generalized trapezoidal fuzzy transportation
problem. Adv Fuzzy Sets Syst 2012;12:111-25.
12. Samuel AE, Venkatachalapathy M. Improved zero point