A Novel Approach for the Solution of Multi Objective Interval Transportation Problem
G. Ramesh, G. Sudha, K. Ganesan
Abstract
Open-access reader
G. Ramesh, G. Sudha, K. Ganesan
Abstract
Open-access reader
In this paper, we propose a Multi-objective transportation problem where the source and destination parameters are chosen as interval numbers.The main objective of the problem is to minimize the total transportation cost and total delivery time.A new algorithm is proposed to determine initial allocation to the basic cells and the corresponding Multiobjective interval transportation cost without converting the problem to its classical version.The initial interval transportation cost may vary during optimality test when allocations are changed.Numerical examples are presented to illustrate the proposed method.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we propose a Multi-objective transportation problem where the source and destination parameters are chosen as interval numbers.The main objective of the problem is to minimize the total transportation cost and total delivery time.A new algorithm is proposed to determine initial allocation to the basic cells and the corresponding Multiobjective interval transportation cost without converting the problem to its classical version.The initial interval transportation cost may vary during optimality test when allocations are changed.Numerical examples are presented to illustrate the proposed method.
Key concepts: Interval (graph theory), Transportation theory, Mathematical optimization, Computer science, Total cost, Operations research, Mathematics, Economics