Bicriteria Transportation Problem
In a transportation problem, generally, a single criterion of minimizing the total cost is considered. But in certain practical situations two or more objectives are relevant. For example, the objectives may be minimizations of total cost, consumption of certain scarce resources such as energy, total deterioration of goods during transportation, etc. Clearly, this problem can be solved using any of the multiobjective linear programming techniques; but the computational efforts needed would be prohibitive in many cases. The computational complexity in these techniques arises from the fact that each of the methods finds the set of nondominated extreme points in the solution space where such extreme points are, generally, many. Therefore, this paper develops a method of finding the nondominated extreme points in the criteria space. Such extreme points in the criteria space would be generally less and only these are needed while choosing a nondominated solution for implementation. The method involves a parametric search in the criteria space. Although the method is developed with respect to a bicriteria transportation problem, it is applicable to any bicriteria linear program in general. The bottleneck criterion included as a third objective is particularly significant in time bound transportation schedules. A numerical example is included.
Volume (Year): 25 (1979)
Issue (Month): 1 (January)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:25:y:1979:i:1:p:73-78. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.