A Solution Proposal To Indefinite Quadratic Interval Transportation Problem (original) (raw)
Related papers
A New Method to Solve Interval Transportation Problems
Pakistan Journal of Statistics and Operation Research, 2020
transportation problem (ITP) in which the cost-coefficients of the objective function, source and destination parameters are all in the form of interval. In this paper, the single objective interval transportation problem is transformed into an equivalent crisp bi-objective transportation problem where the left-limit and width of the interval are to be minimized. The solution to this bi-objective model is then obtained with the help of fuzzy programming technique. The proposed solution procedure has been demonstrated with the help of a numerical example. A comparative study has also been made between the proposed solution method and the method proposed by Das et al.(1999) .
International Journal of Advanced Science and Engineering, 2018
In this paper, a comparison of optimum solution between transportation and transhipment problem where the cost coefficients are the objective functions, and the source and destination parameters is expressed as interval values. The objective is to minimize the total transportation cost and the solution is obtained by converting the interval transportation problem into an equivalent interval transhipment problem. In some circumstances, interval transhipment will be less expensive than interval transportation , explained by means of numerical example.
A Solution Algorithm for Interval Transportation Problems via Time-Cost Tradeoff
JOURNAL OF ADVANCES IN MATHEMATICS
In this paper, an algorithm for solving interval time-cost tradeoff transportation problemsis presented. In this problem, all the demands are defined as intervalto determine more realistic duration and cost. Mathematical methods can be used to convert the time-cost tradeoff problems to linear programming, integer programming, dynamic programming, goal programming or multi-objective linear programming problems for determining the optimum duration and cost. Using this approach, the algorithm is developed converting interval time-cost tradeoff transportation problem to the linear programming problem by taking into consideration of decision maker (DM).
A New Approach for Finding an Optimal Solution for Integer Interval Transportation Problems
2010
In this paper a difierent approach namely separation method based on zero su‐x method is applied for flnding an optimal solution for integer transportation problems where transportation cost, supply and demand are intervals. The proposed method is a non fuzzy method. The solution procedure is illustrated with a numerical example. The separation method can be served as an important tool for the decision makers when they are handling various types of logistic problems having interval parameters.
Solid transportation problem with budget constraints under interval uncertain environments
International Journal of Process Management and Benchmarking, 2017
A solid transportation problem is formulated in the form of an interval linear programming problem, where transportation cost, availability, requirement, conveyance capacity and budget for destinations are represented as closed intervals. This problem is converted into a deterministic linear programming problem using some positive weight functions and establishes the relation between the solutions of both problems. Further, a novel methodology is developed to study the existence of solutions in interval solid transportation problems. Numerical example is illustrated to justify the efficiency of the proposed method.
An Interval Solid Transportation Problem with Vehicle Cost, Fixed Charge and Budget
2014
In this paper, we made an investigation on interval solid transportation problem (STP).A capacitated, interval valued solid transportation problem with interval nature of resources, demands, capacity of conveyance and costs. Here transportation cost inversely varies with the quantity-to be transported from plants to warehouses in addition to a fixed per unit cost and a small vehicle cost. We develop this paper under unit transportation cost, resources, demands, conveyances capacities etc. as interval numbers. To erect this manuscript, an additional constraint is imposed on the total budget at each goal. We employ two interval approaches as Hu and Wang’s and Mahato and Bhunia’s approaches. The interval transportation model is converted into its crisp equivalent by using Weighted Tchebycheff method and also the model is illustrated with numerical example using the LINGO.13 optimization software.
Multiobjective transportation problem with interval cost, source and destination parameters
European Journal of Operational Research, 1999
In this paper, we focus on the solution procedure of the multiobjective transportation problem (MOTP) where the cost coecients of the objective functions, and the source and destination parameters have been expressed as interval values by the decision maker. This problem has been transformed into a classical MOTP where to minimize the interval objective function, the order relations that represent the decision maker's preference between interval pro®ts have been de®ned by the right limit, left limit, centre, and half-width of an interval. The constraints with interval source and destination parameters have been converted into deterministic ones. Finally, the equivalent transformed problem has been solved by fuzzy programming technique. Numerical examples have been provided to illustrate the solution procedure for three possible cases of the original problem.
2007
We present interval-flow networks, network flow models in which the flow on an arc may be required to be either zero or within a specified range. The addition of such conditional lower bounds creates a mixed-integer program that captures such well-known restrictions as time windows and minimum load sizes. This paper builds on previous research [1] that described the mathematical properties of interval-flow networks and based on those designed an efficient new heuristic approach that incorporated the conditional bounds into the simplex pivoting process and exploits the efficient, specialized pure-network simplex technologies. The algorithm is applied to interval-flow transportation problems with a variable conditional lower bound and tested on problems with up to 100 nodes and 2000 arcs. Empirical comparisons with CPLEX demonstrate the effectiveness of this methodology, both in terms of solution quality and processing time.
Solving Integer Interval Transportation Problem with Mixed Constraints
In this paper the Transportation problem with mixed constraints having all parameters as integer intervals is considered. Here we solve the fully integer interval transportation problem without converting it to the crisp transportation problem. Numerical example is illustrated to validate the argument and the results are compared with the existing methods.
Trisectional fuzzy trapezoidal approach to optimize interval data based transportation problem
Journal of King Saud University - Science, 2018
This research article puts forward a combination of two new thoughts to solve interval data based transportation problems (IBTPs). Firstly IBTP is converted to fuzzy transportation problem using trisectional approach and secondly a newly proposed ranking technique based on in-centre concept is applied for conversion to crisp number. It is supported with numerical illustrations to test the relevance of the scheme. Comparison with other existing methods confirms its significance for transportation problems having interval data.