\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Fuzzy Goal Programming Method for SolvingMulti-Objective Transportation Problems},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2011-02-15 (revised: 15 February 2011)}
\def\TheID{\makeatother }
\def\TheDate{2011-02-15}
\title{Fuzzy Goal Programming Method for SolvingMulti-Objective Transportation Problems}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{S G  Acharyulu}

             \author[2]{Dr. K V V Chandra  Mouli}

             \affil[1]{  GITAM Institute of Technology, GITAM University}

\renewcommand\Authands{ and }

\date{\small \em Received: 13 January 2011 Accepted: 3 February 2011 Published: 15 February 2011}

\maketitle


\begin{abstract}
        


The multi-objective transportation problem refers to a special class of vector minimum linear programming problem, in which constraints are of inequality type and all the objectives are non-commensurable and conflict with each other. A common problem encountered in solving such multi-objective problems is that to identify a compromise solution among a large number of non-dominated solutions, the decision maker has to develop a utility function for meeting the desired goal. In this paper, fuzzy membership functions are considered and deviation goals also taken for each objective function. Fuzzy max-min operator is implemented to show the effectiveness of the proposed methodology. LINGO software package is used to solve constrained optimization problem. To illustrate the proposed method, two numerical examples are solved and the results have been compared with interactive, fuzzy and deviation criterion approaches.

\end{abstract}


\keywords{}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 
\section[{INTRODUCTION}]{INTRODUCTION}\par
he classical transportation problem is one of the sub classes of linear programming problem in which all constraints are inequality type. \hyperref[b7]{Hitchcock (1941)} developed transportation model. Because of the complexity of the social and economic environment requires explicit consideration of criteria other than cost, the single objective transportation problems in real world cases can be formulated as multi-objective models. \hyperref[b3]{Charnes and Cooper (1961)} first discussed on various approaches to solutions of managerial level problems involving multiple conflicting objectives. \hyperref[b9]{Ignizio (1978)} applied goal programming for multiobjective optimization problems and solved twoobjective optimization problem. Some of the authors (see \hyperref[b5]{Garfinkl \& Rao 1971}; \hyperref[b20]{Swaroop et al., 1976}) have solved the two objective problem by giving high and low priorities to the objectives. \hyperref[b0]{Belenson and Kapur (1973)} presented two person-zero sum game approach consists of a p x p pay off matrix and solved each objective function individually finally developed best compromise solution using proper weights to the objective functions. Jimmenez and Vudegay (1999) solved a multi-criteria transportation problem using parametric approach by developing auxiliary solutions. Rakesh \hyperref[b16]{Varma et al., (1997)} used fuzzy min operator approach to develop a compromise solution for the multi-objective problem. \hyperref[b18]{Ringuest and Rinks (1987)} proposed two interactive algorithms for generating all non-dominated solutions and identified minimum cost solution as a best compromise solution. Gen et al., (1998) solved a bi-criteria transportation problem using hybrid genetic algorithm adopting spanning tree based prufer number to generate all possible basic solutions. Waiel. (  {\ref 2001}) developed all non-dominated solutions and defined family of distance function to arrive a compromise solution.\par
The existing procedures in the literature (see \hyperref[b4]{Deb, 2003;}\hyperref[b17]{Rao, 2003)} for solving multi-objective transportation problems can be divided into two categories. First category of those are generating all the sets of efficient solutions (see \hyperref[b18]{Ringuest and Rinks, 1987;}\hyperref[b6]{Gen et al., 1997)} and the second category represents the procedure of using an additional criterion to obtain the best compromise solution among the set of efficient solutions (see Rakesh \hyperref[b16]{Varma \& Biswas, 1997;} {\ref Gen et al., 1998;}\hyperref[b2]{Bit et al., 1992}; and Sy-Ming Gun \& Yan -Kuen Wu, 1999) developed various functions to achieve direct compromise solution without developing and testing all the Pareto solutions.\par
Although several researchers have been proposed various advances in transportation problems ( see \hyperref[b1]{Bit et al.,1993} In this paper, authors propose membership functions and goal deviation functions from Pareto solutions for each objective, and these functions are added as constraints. By introducing a max-min operator ? an auxiliary variable, then the equivalent fuzzy interactive goal programming problem is formulated to maximize ? and the solution is obtained by using LINGO software. The remaining of the paper is organized as follows: in section 2 we give a mathematical model of the multi-objective transportation problem (MOTP) and formulation with fuzzy max-min operator and goal deviations. Section 3 ( ) [ ] ( ) L U X F U X F k k k k k ? ? ? ? ? = µ\par
represents proposed methodology; while in section 4 two numerical examples are solved. Finally, in section 5 and 6 we discuss on the results and conclusions. 
\section[{II.}]{II.} 
\section[{MATHEMATICAL MODEL}]{MATHEMATICAL MODEL}\par
In a typical transportation problem, a homogenous product is to be transported from several origins (or sources) to numerous destinations in such way that the total transportation cost is minimum. Suppose there are "m" origins (i=1,2,??,m) and "n" destinations (j=1,2,??.,n). The sources may be production facilities, warehouses etc and they are characterized by available supplies a 1 , a 2, ?,a m . The destinations may be warehouses and sales outlets etc, and they are characterized by demand levels b 1 , b 2 ,?.,b n . A penalty c ij is associated with transporting a unit of product from origin i to destination j. The penalty could represent transportation cost, delivery time, distance, quality of goods delivered under used capacity or many other criteria. A variable x ij is used to represent the unknown quantity to be transported from origin O i to destination D j . In the real life, however all transportation problems are not single objective. The transportation problems, which are characterized by multiple objective functions, are considered in this paper. The decision maker would like to minimize the set of K objectives simultaneously; a point will likely be reached where a further reduction of the value of any single objective function may only be obtained at the expense of increasing the value of at least one other objective function. Thus, in general, the objectives will also be conflicting. The mathematical model of the multi-objective transportation problem is written as follows:\par
(2.1) X C (X) F Min ij ij k n 1 j m 1 i k ? ? = = = subject to the (2.4) j and i all for , 0 x (2.3) n, ........, 1,2,...... j , b x (2.2) m, ........, 1,2,...... i , a x ij j m 1 i ij i n 1 j ij ? = = = ? ? ? = = Where, \{ \} (X) F ....., .......... (X), F (X), F (X) F k 2 1 k 
\section[{=}]{=}\par
is a vector of K objective functions and superscript on both F k (X) and C k ij are used to identify the number of objective functions (k=1,2,?.,K) without loss of generality it will be assumed in the whole paper that a i ?0 and b j ?0 for all i and j and ? i a i =? j b j , c ij >0 for all i and j. 
\section[{a) Problem Formulation Using Fuzzy Max-Min Operator}]{a) Problem Formulation Using Fuzzy Max-Min Operator}\par
Fuzzy set theory appears to be an ideal approach to deal with decision problems that are formulated as linear programming models with imprecision parameters. Two face fuzzy linear programming models are designated by Sy-Ming Gun \& Yan-Kuen Wu (1999) for such problems. In the literature fuzzy linear programming has been classified into different categories, depending on how imprecise parameters are modeled by possibility distributions or subjective preference based membership functions. In this paper the net relative deviation is considered as fuzzy variable and converted into deterministic form using Zadeh's max-min operator as per \hyperref[b23]{Zimmermann (1985)}. We define a linear membership function by considering suitable upper and lower bounds to the objective function as given below.µ[F k (X)] = 1, if F k (X) ? U k ,if Lk<Fk (X) <Uk (2.5) µ[F k (X)] = 0 otherwise\par
By introducing a max-min operator ? an auxiliary variable, then, the equivalent fuzzy linear programming problem is as follows.\par
[X*] = Maximize ? (0? ? ? 1) where ? ? minimum ?k [Fk(X)], k=1,2,???.,K subject to the constraints (2.2) ?.  {\ref (2.4)} where, ?k [Fk(X)] is membership of the kth objective function and Lk,Uk are its lower and upper bound solutions. 
\section[{b) Goal Deviations}]{b) Goal Deviations}\par
The goals for each objective are considered for each objective functions namely under achievement and over achievement goals. Initially, the upper and lower bounds for each objective functions are estimated and then the goals are included as by adding the under achievement and removing the over achievement for each objective on the left hand side of the objectives as variables. After setting goals, an overall fuzzy operator ? has been introduced to identify the minimum value for each function and maximizing it subject to the constraints as per \hyperref[b23]{Zimmermann (1985)}. 
\section[{III.}]{III.} 
\section[{PROPOSED METHOD}]{PROPOSED METHOD}\par
For solving MOTP, the proposed method is summarized in the following steps  ) [ ] ( ) L U X F U X F k k k k k ? ? ? ? ? ? ? = µ\par
Step 3 (Membership function): Based on the interaction approach by \hyperref[b22]{Waiel (2001)} between lower bound and upper bounds L k and U k of the K th objective function, membership functions are estimated for all the objective functions [F k (X)], (k=1,2,?,K) as follows µ[F k (X)] = 1, if F k (X) ? U k , if L k < F k (X) < U k (2.5) µ[F k (X)] = 0 otherwise\par
Step 4. Developing a goal deviation function by setting goals (over achievement and under achievement) for each objective based on the upper bounds (U k ) and lower bounds (L k ) add these goal deviation functions as constraints.\par
Step 5. By introducing a max-min operator ? an auxiliary variable, then the equivalent fuzzy linear goal programming problem is as follows.[X*] = Maximize ? (0 ? ? ? 1) where ? ? Minimum ? k [ F k (X)] , k = 1,2??..,K. subject to the constraints (2.2) -(2.4).\par
Here, [ F k (X)] is membership of the k th objective function and L k and U k are the lower and upper bounds for each objective function F k (X) (k=1,2,??,K). 
\section[{IV.}]{IV.} 
\section[{ILLUSTRATIVE EXAMPLES}]{ILLUSTRATIVE EXAMPLES}\par
To illustrate the proposed method, consider the following two examples of MOTP taken from \hyperref[b18]{Ringuest and Rinks (1987)}.  (2.4) [X 1* ] = [0,0,5,0,0, 0,3,1,0,0, 1,1,0,0,0, 3,0,0,2,4] [X 2* ] = [3,0,0,2,0, 1,0,0,0,4, 0,2,0,0,0, 1,2,6,0,0] [X 3* ] = [3,2,0,0,0, 1,0,3,0,0, 0,2,0,0,0, 0,0,3,2,4] F 1 [X 1* ] = 102 F 2 [X 2* ] = 73 and F 3 [X 3* ] = 64\par
(2) Determine k objective functions (k Pareto solutions, where k=1,2, ?.,K). Identify the its lower and upper bounds as L k and U k. F 1 [X 1 ] = 102, F 1 [X 2 ] = 164, and F 1 [X 3 ] = 134; hence, lower limit L 1 =102 and upper limitU 1 =164. F 2 [X 1 ] = 141, F 2 [X 2 ] = 73 and F 2 [X 3 ] = 122; hence, L 2 =73 and U 2 =141. F 3 [X 1 ] = 94, F 3 [X 2 ]\par
= 90 and F 3 [X 3 ] = 64; hence, L 3 =64 and U 3 =94.\par
(3) The membership function of F 1 (X), F 2 (X) and F 3 (X) are determined as follows( ) [ ] ( ) 102 164 X F 164 X F 1 1 1 ? ? µ ( ) [ ] ( ) 73 141 X F 141 X F 2 2 2 ? ? µ ( ) [ ] ( ) 64 94 X F 94 X F 3 3 3 ? ? µ (4)\par
The goal deviation functions of F 1 (X), F 2 (X) and F 3 (X) are determined as follows. The solution obtained as [X*] = [ 3,0,0,2,0,0,2,2,0,0,0,2,0,0,0,1,0,4,0,4] and ? = 0.54 The corresponding objective functions values are F 1  1) As the first step the ideal solutions obtained by solving of each objective function is F 1 (X 1 *) =143 and F 2 (X 2 *) =167 2) Determination of Pareto solutions For each objective function the corresponding Parato solutions at each feasible ideal solution and lower and upper bounds are obtained as follows:F 1 (X) + d 1 + -d 2 -? 164 F 2 (X) + d 3 + -d 4 -? 141 F 3 (X) + d 5 + -\par
F 1 (X 1 ) =143 and F 1 (X 2 ) = 208 hence, lower limit L 1 =143 and upper limit U 1 =208 F 2 (X 1 ) =265 and F 2 (X 2 ) = 167 hence, lower limit L 2 =167 and upper limit U 2 =265\par
3) The membership functions of F 1 (X) and F 2 (X) are determined as follows:( ) [ ] ( ) 143 208 X F 208 X F 1 1 1 ? ? µ ( ) [ ] ( ) 167 265 X F 265 X F 2 2 2 ? ? µ 4)\par
The goal deviation functions of F 1 (X) and F 2 (X) are F 1 (X) + d 1 + -d 2 -? 208 F 2 (X) + d 3 + -d 4 -? 
\section[{RESULTS AND DISCUSSION}]{RESULTS AND DISCUSSION}\par
The work reported here for solving MOTP, results a compromise solution in five steps. Initially, a feasible ideal solution is obtained for each objective function, using these feasible solutions, upper and lower bounds values are identified for each objective function. From the upper and lower bounds, membership functions are estimated. Goal deviations are included for each membership functions by introducing under achievement and over achievement variables. By introducing a max-min operator ? an auxiliary variable, then an equivalent fuzzy linear goal programming is formulated and the solution obtained using LINGO software. The feasible ideal solutions obtained for the proposed method is exactly similar to the exiting methods in the literature (see \hyperref[b18]{Ringuest \& Rinks, 1987;}\hyperref[b22]{Waiel, 2001;}\hyperref[b13]{Mouli et al., 2005)}, and the solutions obtained are compared with those in the literature.\par
For the example 1, the solution obtained using the proposed method as ?F(X * ) = 307 (127,104 and 76) with overall satisfaction level of 0.54. This shows (Table \hyperref[tab_3]{1}), proposed method results exactly similar to the solutions obtained with interactive approach proposed by \hyperref[b18]{Ringuest and Rinks (1987)}, and net deviation approach proposed by \hyperref[b13]{Mouli et al., (2005)} and better solution than the fuzzy approach proposed by Waiel (2001). For the numerical example 2, the solution for the proposed method obtained as ?F(X * ) = 355 (160 and 195) with overall satisfaction level of 0.71. This indicates the solution obtained is much more superior to the existing interactive, net deviation and fuzzy approaches. Also, the fuzzy approach results ?F(X * ) = 360 (170 and 190) with 7 number of allocations. The proposed approach generates the same number of allocations with much improved value at ?F(X * ) = 355 (160 and 195). VI. 
\section[{CONCLUSION}]{CONCLUSION}\par
A common problem encountered in solving multi-objective optimization problems is that the decision maker has to identify a problem dependent compromise function among a large number of nondominated solutions. For the past 20 years, although many researchers have investigated compromise functions, there is still no compromise function among them is generating an optimal solution for all types of problems. In the absence of exact method for solving multi-objective transportation problems a reasonable method has some value. In this paper, a fuzzy goal deviation criterion is developed to determine compromise solution. The effectiveness of the proposed method is tested with fuzzy max-min operator and solved using LINGO software. Two numerical examples are presented and obtained results are compared with those reported in the literature. The results shows a great promise in developing an efficient solution for solving multi-objective optimization problems and this can be extended for all engineering applications in future to achieve global solution.\par
Fuzzy numbers. Computers and Industrial Engineering. 33 (3-4), 589-592. Computers and Industrial Engineering. 35 (1-2), 363-366.\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}}\end{figure}
      \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.6579889807162534\textwidth}P{0.13269054178145087\textwidth}P{0.0070247933884297524\textwidth}P{0.048393021120293846\textwidth}P{0.0039026629935720843\textwidth}}
\tabcellsep \tabcellsep \tabcellsep 265\\
\tabcellsep Here,d 1\tabcellsep + and d 3\tabcellsep + are over achievements and d 2\tabcellsep -and\\
d 4\tabcellsep \multicolumn{3}{l}{-are under achievements of}\\
\tabcellsep \multicolumn{3}{l}{each function of F 1 (X) and F 2 (X) respectively.}\\
\tabcellsep \multicolumn{3}{l}{Hence, the problem is written as follows}\\
\tabcellsep \multicolumn{2}{l}{Maximize ? (x 17 )}\tabcellsep \\
\tabcellsep \multicolumn{2}{l}{subject to}\tabcellsep \\
\multicolumn{4}{l}{x 1 + x 2 + x 3 + x 4 = 8}\\
\multicolumn{4}{l}{x 5 + x 6 + x 7 + x 8 =19}\\
\multicolumn{4}{l}{x 9 + x 10 + x 11 + x 12 = 17}\\
\multicolumn{3}{l}{x 1 + x 5 + x 9 = 11}\tabcellsep \\
\multicolumn{3}{l}{x 2 + x 6 + x 10 = 3}\tabcellsep \\
\multicolumn{3}{l}{x 3 + x 7 + x 11 = 14}\tabcellsep \\
\multicolumn{3}{l}{x 4 + x 8 + x 12 = 16}\tabcellsep \\
\multicolumn{5}{l}{x 1 + 2x 2 + 7x 3 + 7x 4 + x 5 + 9x 6 + 3x 7 + 4x 8 + 8x 9 +}\\
\multicolumn{4}{l}{9x 10 + 4x 11 + 6x 12 + x 13 -x 14 ? 208}\\
\multicolumn{5}{l}{4x 1 + 4x 2 + 3x 3 + 4x 4 + 5x 5 + 8x 6 + 9x 7 + 10x 8 + 6x 9}\\
\multicolumn{4}{l}{+ 2x 10 + 5x 11 + x 12}\\
\tabcellsep \multicolumn{3}{l}{+ x 15 -x 16 ? 265}\\
\multicolumn{4}{l}{Simplifying the above two constraints,}\\
\multicolumn{5}{l}{0.48x 1 + 0.96x 2 + 3.37x 3 + 3.37x 4 + 0.48x 5 + 4.33x 6 +}\\
\multicolumn{4}{l}{1.44x 7 + 1.92x 8 + 3.85x 9 +}\\
\tabcellsep \tabcellsep \tabcellsep 4.33x 10\tabcellsep +\\
\multicolumn{4}{l}{1.92x 11 + 2.88x 12 + 31.25x 17 ? 100}\\
\multicolumn{5}{l}{1.51x 1 + 1.51x 2 + 1.132x 3 + 1.509x 4 + 1.887x 5 +}\\
\multicolumn{4}{l}{3.018x 6 + 3.396x 7 + 3.77x 8 +}\\
\tabcellsep \tabcellsep \tabcellsep \multicolumn{2}{l}{2.26x 9 + 0.75x 10 +}\\
\multicolumn{4}{l}{1.886x 11 + 0.377x 12 + 36.98x 17 ? 100}\\
\multicolumn{5}{l}{where, all x i ? 0 and integers (i =1,2,??..,16) and x 17}\\
\multicolumn{2}{l}{? 1}\tabcellsep \tabcellsep \\
\multicolumn{4}{l}{The solution obtained as}\\
\multicolumn{4}{l}{[X*] = [4,3,1,0,7,0,12,0,0,0,1,16] and ? = 0.71}\\
\multicolumn{5}{l}{The corresponding objective functions values are F 1 (X*)}\\
\multicolumn{4}{l}{=160 and F 2 (X*) =195.}\end{longtable} \par
 
\caption{\label{tab_3}Table 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2} \par 
\begin{longtable}{P{0.175\textwidth}P{0.1125\textwidth}P{0.2125\textwidth}P{0.2125\textwidth}P{0.1375\textwidth}}
Ideal\tabcellsep Proposed\tabcellsep Net\tabcellsep Interactive\tabcellsep Fuzzy\\
solution\tabcellsep Method\tabcellsep Deviation\tabcellsep Approach\tabcellsep Approach\\
\tabcellsep \tabcellsep Approach\tabcellsep Ringuest\tabcellsep Waiel\\
\tabcellsep \tabcellsep Mouli et\tabcellsep and Rinks\tabcellsep (2001)\\
\tabcellsep \tabcellsep al., (2005)\tabcellsep (1987)\tabcellsep \\
F 1 [X]\tabcellsep 160\tabcellsep 186\tabcellsep 186\tabcellsep 170\\
143\tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
F 2 [X]\tabcellsep 195\tabcellsep 171\tabcellsep 174\tabcellsep 190\\
167\tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
? F[X]\tabcellsep 355\tabcellsep 357\tabcellsep 360\tabcellsep 360\\
?\tabcellsep 0.71\tabcellsep 0.7\tabcellsep \tabcellsep \\
V.\tabcellsep \tabcellsep \tabcellsep \tabcellsep \end{longtable} \par
 
\caption{\label{tab_4}Table 2 :}\end{figure}
 			\footnote{©2011 Global Journals Inc. (US)} 			\footnote{Fuzzy Goal Programming Method for Solving Multi-Objective Transportation Problems ©2011 Global Journals Inc. (US)} 			\footnote{Fuzzy Goal Programming Method for Solving Multi-Objective Transportation Problems ©2011 Global Journals Inc. (US)} 			\footnote{Fuzzy Goal Programming Method for Solving Multi-Objective Transportation Problems ©2011 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Mouli et al. ()]{b13}\label{b13} 	 		\textit{},  		 			Chandra K V V Mouli 		,  		 			K Venkatasubbaiah 		,  		 			K M Rao 		.  		2005.  	 
\bibitem[Lau et al. ()]{b11}\label{b11} 	 		\textit{A Fuzzy guided Multi-objective evolutionary algorithm model for solving Transportation problem},  		 			H C W Lau 		,  		 			T M Chan 		,  		 			W T Tsui 		,  		 			F T S Chan 		,  		 			G T Ho 		,  		 			S Choy 		,  		 			KL 		.  		2009.  	 
\bibitem[Waiel ()]{b22}\label{b22} 	 		\textit{A Multi-objective transportation problem under fuzziness. Fuzzy Sets and Systems},  		 			Waiel 		.  		2001. 117 p. .  	 
\bibitem[Bit et al. ()]{b1}\label{b1} 	 		\textit{An additive Fuzzy programming model for Multiobjective transportation problem. Fuzzy Sets and Systems},  		 			A K Bit 		,  		 			M P Bismal 		,  		 			S S Alam 		.  		1993. 57 p. .  	 
\bibitem[An efficient method for solving Multi-objective transportation problems Journal of the Computer Society of India]{b14}\label{b14} 	 		‘An efficient method for solving Multi-objective transportation problems’.  	 	 		\textit{Journal of the Computer Society of India}  		35 p. .  	 
\bibitem[Zimmermann ()]{b23}\label{b23} 	 		‘Application of Fuzzy Set theory to Mathematical Programming’.  		 			H J Zimmermann 		.  	 	 		\textit{Information Sciences}  		1985. 36 p. .  	 
\bibitem[Rao ()]{b17}\label{b17} 	 		\textit{Engineering optimization theory and practice, New age International},  		 			Singiresu S Rao 		.  		2003. India.  	 
\bibitem[Expert Systems and Applications]{b12}\label{b12} 	 		\textit{Expert Systems and Applications},  		36 p. .  	 
\bibitem[Sinha et al. ()]{b19}\label{b19} 	 		\textit{Fuzzy programming approach to Mulit-objective Stochastic programming problems when b i ' s follow Joint Normal Distribution. Fuzzy Sets and Systems},  		 			S B Sinha 		,  		 			S Hulsurkar 		,  		 			M P Biswal 		.  		2000. 109 p. .  	 
\bibitem[Bit et al. ()]{b2}\label{b2} 	 		\textit{Fuzzy programming approach to Multi criteria decision making transportation problem. Fuzzy sets and systems},  		 			A K Bit 		,  		 			M P Biswal 		,  		 			S S Alam 		.  		1992. p. .  	 
\bibitem[Hulsurkar et al. ()]{b8}\label{b8} 	 		\textit{Fuzzy programming approach to Multi-objective Stochastic linear programming problems. Fuzzy Sets and Systems},  		 			S Hulsurkar 		,  		 			M P Biswal 		,  		 			S B Sinha 		.  		1997. 88 p. .  	 
\bibitem[Varma et al. ()]{b16}\label{b16} 	 		\textit{Fuzzy programming technique to solve Multi-objective transportation problems with some Non-linear membership functions. Fuzzy Sets and Systems},  		 			Rakesh Varma 		,  		 			M P Biswal 		,  		 			A Biswas 		.  		1997. 91 p. .  	 
\bibitem[Ignizio ()]{b9}\label{b9} 	 		‘Goal programming: A tool for multi-objective analysis’.  		 			J P Ignizio 		.  	 	 		\textit{Journal of Operations Research Society}  		1978. 29 p. .  	 
\bibitem[Gen et al. ()]{b6}\label{b6} 	 		\textit{Improved Genetic algorithm for solving Multiobjective solid transportation problems with},  		 			M Gen 		,  		 			K Ida 		,  		 			Y Li 		.  		1997.  	 
\bibitem[Ringuest and Rinks ()]{b18}\label{b18} 	 		‘Interactive solutions for the linear multi-objective transportation problem’.  		 			J L Ringuest 		,  		 			D B Rinks 		.  	 	 		\textit{European Journal of Operations Research}  		1987. 32 p. .  	 
\bibitem[Belenson and Kapur ()]{b0}\label{b0} 	 		‘Linear programming problems’.  		 			S M Belenson 		,  		 			K C Kapur 		.  	 	 		\textit{Operations research}  		1973. 24  (1)  p. .  	 
\bibitem[Charnes and Cooper ()]{b3}\label{b3} 	 		\textit{Management models and industrial applications of linear programming},  		 			A Charnes 		,  		 			W W Cooper 		.  		1961. Wiely, NY.  	 
\bibitem[Deb ()]{b4}\label{b4} 	 		\textit{Multi objective optimization using evolutionary algorithms},  		 			K Deb 		.  		2003. Singapore: John Wiley \& Sons.  	 
\bibitem[Pramanik Senapati. & Roy Tapan Kumar. ()]{b15}\label{b15} 	 		‘Multi objective transportation model into Fuzzy parameters: Priority based Fuzzy Goal programming approach’.  	 	 		\textit{Journal of Transportation systems Engineering and Information Technology}  		Pramanik Senapati. \& Roy Tapan Kumar. (ed.)  		2008. 8  (3)  p. .  	 
\bibitem[Kyung Sam Park. and Kwan Jae Kim. ()]{b10}\label{b10} 	 		‘Optimizing Multi Response Surface Problems: How to use Multi-Objective Optimization Techniques’.  	 	 		\textit{IIE Transactions}  		Kyung Sam Park. and Kwan Jae Kim. (ed.)  		2005. 37 p. .  	 
\bibitem[Zinmenoz and Vudegay ()]{b24}\label{b24} 	 		‘Solving fuzzy solid transportation problem by an evolutionary algorithm based parametric approach’.  		 			F Zinmenoz 		,  		 			J L Vudegay 		.  	 	 		\textit{European Journal of Operations Research}  		1999. 117 p. .  	 
\bibitem[Garfinkl and Rao ()]{b5}\label{b5} 	 		‘The bottleneck transportation problems’.  		 			R S Garfinkl 		,  		 			M R Rao 		.  	 	 		\textit{Naval Research Logistics Quarterly}  		1971. 18 p. .  	 
\bibitem[Hitchcock ()]{b7}\label{b7} 	 		‘The distribution of several sources to numerous localities’.  		 			F L Hitchcock 		.  	 	 		\textit{Mathematical Physics}  		1941. 20 p. .  	 
\bibitem[Swaroop et al. ()]{b20}\label{b20} 	 		‘Time cost trade of in a transportation problem’.  		 			K Swaroop 		,  		 			H L Bhatia 		,  		 			M C Puri 		.  	 	 		\textit{Opsearch}  		1976. 13 p. .  	 
\bibitem[Sy-Ming Gun & Yan-Kuen Wu ()]{b21}\label{b21} 	 		\textit{Two-face approach for solving the Fuzzy linear programming problems. Fuzzy Sets and Systems},  		 			Sy-Ming Gun \& Yan-Kuen Wu 		.  		1999. 107 p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
