Interactive fuzzy goal programming for multi-objective transportation problems

This paper presents an interactive fuzzy goal programming approach to determine the preferred compromise solution for the multi-objective transportation problem. The proposed approach considers the imprecise nature of the input data by implementing the minimum operator and also assumes that each obj...

Full description

Saved in:
Bibliographic Details
Published in:Omega (Oxford) Vol. 34; no. 2; pp. 158 - 166
Main Authors: Abd El-Wahed, Waiel F., Lee, Sang M.
Format: Journal Article
Language:English
Published: Exeter Elsevier Ltd 01.04.2006
Elsevier
Elsevier Science Publishers
Pergamon Press Inc
Series:Omega
Subjects:
ISSN:0305-0483, 1873-5274
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents an interactive fuzzy goal programming approach to determine the preferred compromise solution for the multi-objective transportation problem. The proposed approach considers the imprecise nature of the input data by implementing the minimum operator and also assumes that each objective function has a fuzzy goal. The approach focuses on minimizing the worst upper bound to obtain an efficient solution which is close to the best lower bound of each objective function. The solution procedure controls the search direction via updating both the membership values and the aspiration levels. An important characteristic of the approach is that the decision maker's role is concentrated only in evaluating the efficient solution to limit the influences of his/her incomplete knowledge about the problem domain. In addition, the proposed approach can be applied to solve other multi-objective decision making problems. The performance of this solution approach is evaluated by comparing its results with that of the two existing methods in the literature.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0305-0483
1873-5274
DOI:10.1016/j.omega.2004.08.006