\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={An Algorithm for Solving Bi-Criteria Large Scale Transshipment 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{2014-01-15 (revised: 15 January 2014)}
\def\TheID{\makeatother }
\def\TheDate{2014-01-15}
\title{An Algorithm for Solving Bi-Criteria Large Scale Transshipment 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]{Ahmed I.  Abed}

             \author[2]{Khalid  Alkhulaifi}

             \author[3]{Jasem  AlRajhi}

\renewcommand\Authands{ and }

\date{\small \em Received: 10 December 2013 Accepted: 3 January 2014 Published: 15 January 2014}

\maketitle


\begin{abstract}
        


This paper describes an algorithm for solving a certain class of bi-criteria multistage transportation problems with transshipment (BMTSP). A several bi-criteria multistage transportation problem with transshipment are formulated. The presented algorithm is mainly based on application of the methods of solving bi-criteria single stage transportation problems, utilizing available decomposition techniques for solving large-scale linear programming problems, and the methods of treating the transshipment problems. The mathematical formulation of the presented class does not affect the special structure of the transshipment problem for each of the individual stages. An illustrative example is introduced to validate that the implementation of the algorithm.

\end{abstract}


\keywords{large scale transportation problem, transshipment problem, multi-objective, decision making, decomposition technique of linear programming.}

\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
hen shipments go directly from a supply point to a demand point, i.e. shipments do not take place between origins or between destinations nor from destinations to origins, it is called a classical transportation problem. In many real life situations, shipments are allowed between supply points or between demand points. There are many points (called transshipment points) through which goods can be transshipped on their journey from a supply point to a demand point. Shipping problems with any or all of these characteristics are considered as transshipment problems. It was first introduced by  {\ref Orden (1965)}  \hyperref[b0]{[1]} in which he introduced an extension of the original transportation problem to include the possibility of transshipment.\par
The problem of determining simultaneously the flow of primary products through processors to the market of final products has been formulated alternatively as a transshipment model by multi-regional, multi-product, and multi-plant problem formulated in the form of general linear programming model has been proposed by \hyperref[b3]{Judge et al (1965)}  \hyperref[b3]{[4]}.\par
Later, various alternative formulations of the transshipment problem within the framework of the transportation model that permits solution of problems of the type discussed by King and Logan without the need for subtraction of artificial variables were discussed by \hyperref[b4]{Hurt and Tramel (1965)}  \hyperref[b4]{[5]}. On the other hand,  {\ref Grag and Prakash (1985)}  \hyperref[b5]{[6]} studied time minimizing transshipment problem. Then dynamic transshipment problem was studied by Herer and Tzur (2001) \hyperref[b6]{[7]}. \hyperref[b7]{Ozdemir (2006)} studied Multi location transshipment problem with capacitated production and lost sales afterwards \hyperref[b7]{[8]}. Furthermore, \hyperref[b9]{Osman et al (1984)}  \hyperref[b9]{[9]} introduced an algorithm for solving bi-criteria multistage transportation problems.\par
Recently, \hyperref[b10]{Khurana et al (2011)}  \hyperref[b10]{[10]} studied a transshipment problem with mixed constraints. He introduced an algorithm for solving time minimizing capacitated transshipment problem \hyperref[b11]{[11]}. Abo-elnaga et al (2012) \hyperref[b12]{[12]} introduced a trust region globalization strategy to solve multi-objective transportation, assignment, and transshipment problems. \hyperref[b13]{Khurana (2013)}  \hyperref[b13]{[13]} introduced a Multi-index fixed charge bi-criterion transshipment problem. Rajendran et al \hyperref[b14]{[14]} (2012) presented A new method namely, splitting method, to solve fully interval transshipment problems. Zaki et al \hyperref[b15]{[15]} (2012) used the genetic algorithm for solving transportation, assignment, and transshipment problems. Ojha et al \hyperref[b16]{[16]} (2011) formulated single and multi-objective transportation models with fuzzy relations under the fuzzy logic. Saraj et al \hyperref[b17]{[17]} (2010) solved the multi objective transportation problem (MOTP) under fuzziness using interval numbers. Abd El-Wahed \hyperref[b18]{[18]} (2001) presented a multi-objective transportation problem under fuzziness. Das et al \hyperref[b19]{[19]} (1999) introduced a multi-objective transportation problem with interval cost, source and destination parameters.\par
In this paper a formulation of different structures of bi-criteria large-scale transshipment problems and an algorithm for solving a class of them, which can be solved using the decomposition technique of linear programming by utilizing the special nature of transshipment problems, is presented. The new algorithm determines the points of the non-dominated set in the objective space. The method consists of solving the same multistage transshipment problem repeatedly but with different objectives and each iteration gives either new non-dominated extreme point or changes the direction of search in the objective space. An illustrative example is presented in this paper. 
\section[{II.}]{II.} 
\section[{Formulation of Bi-criteria Multistage Transshipment Problems}]{Formulation of Bi-criteria Multistage Transshipment Problems}\par
The formulation of different bi-criteria multistage transportation problems with transshipment presented in this paper covers several real situations as shown in the following cases. 
\section[{a) Bi-Criteria Multistage Transportation Problem with transshipment of the First Kind (BMTSP 1)}]{a) Bi-Criteria Multistage Transportation Problem with transshipment of the First Kind (BMTSP 1)}\par
This case represents multistage transshipment problems without any restrictions on intermediate stages. In order to develop a mathematical formulation of the problems, it is assumed that the availabilities are "aj", where j= 1, 2, 3, ..n and "n" is the number of sources and destinations. Where as the requirements are "b j ", j= 1, 2, 3, ?.., n. The minimum transportation costs and deteriorations from i to j are "c ij ","d ij " where i and j= 1, 2, 3, ?., n. X ij denotes the quantity shipped from i to j; and "xj jj " is the neat amount transshipped through point j where x ij ? 0. Then the problem takes the form: Where = 0 for the quantity shipped from the source "Si" to itself and from destination "Dj" to itself:. 
\section[{b) Bi-criteria Multistage Transportation Problem withTransshipment of the Second Kind (BMTSP 2):}]{b) Bi-criteria Multistage Transportation Problem withTransshipment of the Second Kind (BMTSP 2):}\par
This case represents bi-criteria multistage transshipment problems in which the transportation at any stage is independent of the transportation of the other stages. In order to obtain the mathematical is the number of sources and destinations at the k th stage; the requirements are: the transportation costs and deteriorations are and where i k = 1,2, 3, ., nk; jk= 1, 2, 3, ., nk.\par
denotes the quantity shipped from i k to and is the net amount transshipped through point j\par
Then the problem takes the form:\par
Where for the quantity shipped from the source (S i ) to itself and from the destination (D j ) to itself as follows:. and the minimum transportation cost is given by: 
\section[{c) Bi-Criteria Multistage Transportation Problem With Transshipment of the Third Kind (BMTSP 3):}]{c) Bi-Criteria Multistage Transportation Problem With Transshipment of the Third Kind (BMTSP 3):}\par
This case represents bi-criteria multistage transshipment problems with some additional transportation restrictions on the intermediate stages which does not affect the transshipment problem formulation at each stage. The mathematical formulation of the problem representing this case is given as:?? ? ? ? n i n j ij ij x c Z Min 1 1 1 . ?? ? ? ? n i n j ij ij x d Z 1 1 2 c ij c ij ? ? ? ? ? ? n j i i j ji ji n j a x x 1 . ,..., 2 , 1 , ? ? ? ? ? ? n j i i j ij ij n j b x x 1 . ,..., 2 , 1 , x ij ? 0 for all i, j. k k k jk n j b ,... 3 , 2 , 1 ), ( ? k j i k k c k j i k k d k k j i k x j k k j j x k , 0 ? k k j j k x . ?? ? ? ? k k k k k k k k n i n j k j i k j i k x c Z Min 1 1 1 . ? ? ? ? ? k k k k k k k k n i n j k j i k j i k x d Z 1 1 2 0 ? k j i k k c ? ? ? ? ? ? k k k k k k k k k n j i i k k j k j j k i j n j a x x 1 . ,..., 2 , 1 , ? ? ? ? ? ? k k k k k k k k k n j i i k k j k j j k j i n j b x x 1 . ,..., 2 , 1 , x ij ? 0 for all i k , j k. ? ? ? n k k MinZ MinZ 1 ... ... . 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ? ? ? ? ?? ?? ? ? ? ? k k k k k k k k n i n j k j i k j i n i n j j i j i x c x c Z Min ? ? ? ? ? N N N N N N N N n i n j N j i N j i x c\par
formulation of the problem which represents this case, it is assumed that for k th stage, k=1,2,3,?N. The availabilities are:k k k jk n j a ,... 3 , 2 , 1 ), ( ? , n k ... ... 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 ? ? ? ? ?? ?? ? ? ? ? k k k k k k k k n i n j k j i k j i n i n j j i j i x d x d Z ? ? ? ? ? N N N N N N N N n i n j N j i N j i x d 1 1\par
... where: are linear functions representing the additional transportation restrictions and r k is the number of this linear functions at the k th stage. 
\section[{d) Bi-Criteria Multistage Transportation Problem wth transshipment of the Fourth Kind (BMTSP 4)}]{d) Bi-Criteria Multistage Transportation Problem wth transshipment of the Fourth Kind (BMTSP 4)}\par
This case represents bi-criteria multistage transshipment problems in which the difference between the input and output transportation commodity is known at the sources (destinations) of each intermediate stage.\par
The assumed transportation restrictions in this case affect the transshipment formulation of each individual stage.\par
The mathematical formulation of the problem representing this case is given as:\par
Where and for the quantity shipped from the source to itself and from the destinationto itself: k = 1, 2, ?, N k j i k k c k j i k k d k i k S k j k D 1 1 1 1 1 1 ,..., 2 , 1 , 1 1 1 1 1 1 1 1 1 n j a x x j j j n j i i i j ? ? ? ? ? ? 1 1 1 1 1 1 ,..., 2 , 1 , 1 1 1 1 1 1 1 1 1 n j b x x j j j n i j i j i ? ? ? ? ? ? . . . k k k j k j j n i j i k j j n j a x x k k k k k k k k k ,..., 2 , 1 , 1 ? ? ? ? ? ? k k k j k j j n i j i k j i n j b x x k k k k k k k k k ,..., 2 , 1 , 1 ? ? ? ? ? ? . . . N N N j N j j n i j i N i j n j a x x N N N N N N N N N ,..., 2 , 1 , 1 ? ? ? ? ? ? N N N j N j j n i j i N j i n j b x x N N N N N N N N N ,..., 2 , 1 , 1 ? ? ? ? ? ? , 0 ) , , ( 1 1 1 1 1 1 ? ? ? ? ? ? ? k j i k j i k j i r k k k k k k k x x x F 0 ,.. 0 ,.., 0 1 1 1 ? ? ? N j i k j i j i N N k k x x x ; ,..., ,..., ; ,..., ,..., 1 1 N K N K j j j i i i N k F k r ,..., 2 , 1 , ? ... ... . 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ? ? ? ? ?? ?? ? ? ? ? k k k k k k k k n i n j k j i k j i n i n j j i j i x c x c Z Min ? ? ? ? ? N N N N N N N N n i n j N j i N j i x c 1 1 ... ... ... 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 ? ? ? ? ?? ?? ? ? ? ? k k k k k k k k n i n j k j i k j i n i n j j i j i x d x d Z ? ? ? ? ? N N N N N N N N n i n j N j i N j i x d 1 1\par
...k j i k k c 0 ? k j i k k d k i k S k j k D 1 1 1 1 1 1 ,..., 2 , 1 , 1 1 1 1 1 1 1 1 1 n j a x x j j j n i j i i j ? ? ? ? ? ? 2 2 1 1 1 1 2 2 1 1 1 ,... 2 , 1 ; ,..., 2 , 1 , ) ( 1 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 n j n j b x x x x j n i j i j j i j j j n i j i j i ? ? ? ? ? ? ? ? ? ? ? ? . . . k k k k n i j i k j k j j k i j k j j n i j i k j i n j n j b x x x x k k k k k k k k k k k k k k k k k ,... 2 , 1 ; ,..., 2 , 1 , ) ( 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? N N N N n i j i N j N j j N i j N j j n i j i N j i n j n j b x x x x N N N N N N N N N N N N N N N N N ,... 2 , 1 ; ,..., 2 , 1 , ) ( 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? N N N j N j j n i j i N j i n j b x x N N N N N N N N N ,..., 2 , 1 , 1 ? ? ? ? ? ? 0 ? k j i k k x for all i k , j k ; k=1, 2, ?, N\par
(BMTSP 1) is solved as a bi-criteria single stage transshipment problem.\par
(BMTSP 2) can be solved as N single stage bicriteria transshipment problems and the minimum value of the total transport costs and deteriorations are obtained as the sum of the minimum transportation costs and deteriorations for each individual stage.\par
(BMTSP 3) can be solved using the decomposition technique utilizing the special nature of transshipment problems. The next section will be devoted to the solution of this type of problems.\par
(BMTSP 4) is solved using any method for solving bi-criteria linear programming problems. 
\section[{e) An Algorithm for Solving BMTSP 3}]{e) An Algorithm for Solving BMTSP 3}\par
The decomposition technique of linear programming can be used to solve the bi-criteria multistage transshipment problems especially for the (BMTSP 3) type. This type of bi-criteria multistage transshipment problems decomposed into \hyperref[b1]{[2,}\hyperref[b2]{3,}\hyperref[b4]{5,}\hyperref[b7]{8]}:\par
? Sub problems corresponding to every stage. The following section presents an algorithm for determining all non dominated extreme points for the (BMTSP 3) model from which the solution for (BMTSP 1) and (BMTSP 2) models can be deduced from it as special cases. Assuming that independent constraints are: D k , k= 1,2,?,N is the technological matrix of the kth stage activity. D k is (m k + n k ) * (m k + n k ) matrix, N is the number of stages, mk is the number of sources at k th stage, n k is the number of destinations. b k is the column vector consisting of the availabilities and requirements of the k th sub-problem, bk is (m k + n k ) * 1 column vector. It follows that each set of independent constraints can be written as:D k x k = b k , k = 1,2,?,N.\par
x k represent the vector of the corresponding variables, x k is (m k + n k ) *1 column vector. 
\section[{Assuming that common constraints are:}]{Assuming that common constraints are:}\par
A k which represents the technogical matrix of k stage activity, A k is m 0 * (m k * n k ) matrix, m 0 is the number of common constraints. b 0 is the corresponding common resources vector which canbe written as m 0 *1. This gives: A 1 x 1 + A 2 x 2 + ??.+ A k x k + ??. +A N x N = b 0 Assuming that the objective functions are: c K which represent the vector of the first criterion coefficients for the k th stage activity, c k is 1*(m k *n k ) row vector. The algorithm presented here is divided into two phases. Phase 1: To determine the non-dominated extreme points in the objective space. This algorithm is validated by the following theorem \hyperref[b0]{[1]}. 
\section[{? Theorem}]{? Theorem}\par
Point z (q) = in a non-dominated extreme point is the objective space if and only if z(q) is recorded by the algorithm.\par
Phase II: The decomposition algorithm can be found in \hyperref[b6]{[7]}. Since the special structure of the (BMTSP 3) model may allow the determination of the optimal solution by decomposing the problem into small sub-problems then by solving those sub-problems almost independently, and the decomposition algorithm for solving large scale linear programming problems utilizing the special nature of transshipment problem can be used to solve it.? ? ? ? ? ? q q z z 2 1 ,\par
An Algorithm for Solving Bi-Criteria Large Scale Transshipment Problems © 2014 Global Journals Inc. (US) th 
\section[{Phase I:}]{Phase I:}\par
Step 1: From phase II, we can find: and are obtained and q is set to 1. Similarly, we can find: and set L = L \{(r,q)\}, (q,s)\} and go to step 3.? ? M x z Min z ? / . 1 ) 1 ( 1 ? ? ?. / . ) 1 ( 1 1 2 ) 1 ( 2 M x and z z z Min z ? ? ? ) 1 ( 1 z ) 1 ( 2 z ? ? M x z Min z ? / . 2 ) 2 ( 2 ? ? ?. / . ) 2 ( 2 2 1 ) 2 ( 1 M x and z z z Min z ? ? ? If . stop ), , ( ) , ( ) 1 ( 2 ) 1 ( 1 ) 2 ( 2 ) 2 ( 1 z z z z ? Global Journal of\par
Step 3 : Set L = L -\{(r-s)\}. If L = , stop. Otherwise go to step 2.\par
Phase II:\par
Step 1 : Reduce the original problem to the modified form in terms of the new variables\par
Step 2 : Find an initial basic feasible solution to the modified problem.\par
Step 3 : Solve the sub-problems Subject to:\par
Note: c k is used with the first criteria, and d k is used with the second criteria.\par
In order to obtain and by using the transportation technique, go to step 4.\par
Step 4 : For the current iteration, find: Then determine 
\section[{If}]{If}\par
, the current solution is optimal and the process can be terminated, the optimal solution to multistage transportation problem is:\par
Otherwise, go to step 5.\par
Step 5 : Introduce the variable corresponding to into the basic solution. Determine the leaving variable using the feasibility condition and compute the next B -1 using the revised simplex method technique, go to step 3. 
\section[{? Illustrative Example}]{? Illustrative Example}\par
The suggested algorithm for solving problem of the type BMTSP 3 is illustrated in the following example:\par
Consider the following bi-criteria two-stage transshipment problem. For each stage the availabilities, requirements, costs and deteriorations for each stage are given by: An Algorithm for Solving Bi-Criteria Large Scale Transshipment Problems       One requirement is added to the above problem:= q+1 ?, ? ) ( 2 ) ( 2 ) , (\textbf{2 ( 2 z ( ( q}r s s r z z a ? ? ) ( 1 ) ( 1 ) , (\textbf{1}r s s r z z a ? ? k ( x , k=1,2,..,N) k j i k j i s r k j i s r j i N k k k k k k k k k x d a c e ) ( ) ,\textbf{2}? ? ? N k o x M x k k ,.., 2 , 1 , , ? ? ? k x , k=1,2,.,N, .) min ( , 1 k j i k j i j i N k k k k k k k x c ? ? ? ? Let 1 z = k j i k j i j i N k k k k k k k x c ? ? ? ? , 1 2 z = k j i k j i j i N k k k k k k k x d ? ? ? ? , 1 1 z , 2 z ( ( ) , ( ) ( 2 ) ( 1 s s z z ) , ( ) ( 2 ) ( 1 r r z z ? ) ( 2 ) ( 1 , q q z z ( ( , 1 , 2 ) ( 2 1 ) ( 1 ? ? ? ? q q z z z z q q ? ? ? k k k o B k k k x A R c d OR c w ) ( ? ? , k k k b x D ? . ,..., 2 , 1 , N k o x k ? ? k l x ?k w * , ,..., 2 , 1 , * N k v c w k B k k ? ? ? ? ) ( k k Min ? ? ? o ? ? N k xl x K K L L L k ,..., 2 , 1 , 1 ? ? ? ? ? ? k L ? ? 1 1 a = 6, 1 2 a = 4, 1 3 a = 2, 1 1 b = 2 1 a = 9, 1 2 b = 2 2 a = 3,\textbf{( 2 ) , ( 1 , 1 ?}\par
It is required that the quantity shipped from the first source to the first destination in the first stage is equal to the quantity shipped from the first source to the first destination in the second stage. The mathematical model is given as follows:\par
Minimize 1 = 5x 1   11 + 4x 1  12 + 0x 1 13 + 2x    
\section[{Conclusion}]{Conclusion}\par
An algorithm for solving a certain class of bicriteria multistage transportation problems with transshipment (BMTSP) is presented. The presented algorithm enables solving such problems more realistically. It can be used for determining all efficient extreme points. The main advantage of this approach is that the bi-criteria two stage transshipment problem can be solved using the standard form of a transshipment problem at each iteration. Goods transportation may not operate always directly among suppliers and customers. In such problems, it is possible to optimize the transshipment problem into two stages. From the application, decision maker will have all efficient extreme points and their related distributions. Therefore, any point can be chosen, which will provide their policy.\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_1}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_2}}\end{figure}
   \begin{figure}[htbp]
\noindent\textbf{11} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_0}Table 1 - 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{12} \par 
\begin{longtable}{}
\end{longtable} \par
 
\caption{\label{tab_1}Table 1 - 2 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{21} \par 
\begin{longtable}{P{0.85\textwidth}}
An Algorithm for Solving Bi-Criteria Large Scale Transshipment Problems\\
Subject to:\\
Table 2-2 : Deterioration cost at stages (2)\end{longtable} \par
 
\caption{\label{tab_2}Table 2 - 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{3} \par 
\begin{longtable}{P{0.85\textwidth}}
1 14 + x 1 15 23 + 0x 1 22 + x 1 21 + 8x 1 + 10x 1 24 + 4x 1 25 + 9x 1 31 + 9x 1 32 + 3x 1 33 + 2x 1 34 + 0x 1 35 + 0x 1 41 + x 1 42 + 5x 1 43 + 9x 1 44 + 9x 1 45 + 3x 1 51 + 0x 1 52 + 4x 1 53 + 6x 1 54 + 7x 1 55 + 4x 2 11 + 3x 2 12 + 2x 2 13 + 0x 2 14 + 3x 2 15 + 8x 2 21 + 4x 2 22 + 7x 2 23 + 2x 2 24 + 0x 2 25 + 0x 2 31 + 2x 2 32 + 4x 2 33 + 8x 2 34 + 7x 2 35 + 4x 2 41 + 0x 2 42 + 3x 2 43 + 3x 2 44 + 5x 2 45 + 3x 2 51 + 4x 2 52 + 0x 2 53 + 4x 2 54 + 9x 2 55\end{longtable} \par
 
\caption{\label{tab_3}Table 3 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{4} \par 
\begin{longtable}{P{0.85\textwidth}}
Year 2014\\
7\\
IV Version I\\
( ) B Volume XIV Issue\\
Global Journal of Researches in Engineering\end{longtable} \par
 
\caption{\label{tab_4}Table 4 :}\end{figure}
 			\footnote{© 2014 Global Journals Inc. (US)} 			\footnote{14=11, X 2 22=2, X 2 24=1, X 2 25=12, X 2 31=12, X 2 42=12, X 2 53=12. 2 Z 2 =(127,140) X 1 11=6, X 1 12=2, X 1 13=10, X 1 21=3, X 1 22=1, X 1 24=12, X 1 33=2, X 1 35=12, X 1 41=12, X 1 52=12, X 2 11=6, X 2 13=3, X 2 14=12, X 2 22=2, X 2 23=1, X 2 25=12, X 2 31=12, X 2 42=12, X 2 53=12. 3 Z 3 = (121,141) X 1 11=6, X 1 12=3, X 1 13=9, X 1 21=3, X 1 23=1, X 1 24=12, X 1 33=2, X 1 35=12, X 1 41=12, X 1 52=12, X 2 11=6, X 2 13=4, X 2 14=11, X 2 22=2, X 2 24=1, X 2 25=12, X 2 31=12, X 2 42=12, X 2 53=12. 4 Z 4 = (115,149) X 1 11=6, X 1 12=3, X 1 13=9, X 1 21=1, X 1 23=3, X 1 24=12, X 1 31=2, X 1 35=12, X 1 41=12, X 1 52=12, X 2 11=6, X 2 13=4, X 2 14=11, X 2 22=2, X 2 24=1, X 2 25=12, X 2 31=12, X 2 42=12, X 2 53=12. 5 Z 5 = (124,140) X 1 11=6, X 1 12=3, X 1 13=9, X 1 21=3, X 1 23=1, X 1 24=12, X 1 33=2, X 1 35=12, X 1 41=12, X 1 52=12, X 2 11=6, X 2 13=3, X 2 14=12, X 2 22=2, X 2 23=1, X 2 25=12, X 2 31=12, X 2 42=12, X 2 53=12. 6 Z 6 = (124,140) X 1 11=6, X 1 12=3, X 1 13=9, X 1 21=3, X 1 23=1, X 1 24=12, X 1 33=2, X 1 35=12, X 1 41=12, X 1 52=12, X 2 11=6, X 2 13=3, X 2 14=12, X 2 22=2, X 2 23=1, X 2 25=12, X 2 31=12, X 2 42=12, X 2 53=12. 7 Z 7 = (124,140) X 1 11=6, X 1 12=3, X 1 13=9, X 1 21=3, X 1 23=1, X 1 24=12, X 1 33=2, X 1 35=12, X 1 41=12, X 1 52=12, X 2 11=6, X 2 13=3, X 2 14=12, X 2 22=2, X 2 23=1, X 2 25=12, X 2 31=12, X 2 42=12, X 2 53=12. 8 Z 8 = (115,149) X 1 11=6, X 1 12=3, X 1 13=9, X 1 21=1, X 1 23=3, X 1 24=12, X 1 31=2, X 1 35=12, X 1 41=12, X 1 52=12, X 2 11=6, X 2 13=4, X 2 14=11, X 2 22=2, X 2 24=1, X 2 25=12, X 2 31=12, X 2 42=12, X 2 53=12. 9 Z 9 = (113,156) X 1 11=6, X 1 12=4, X 1 13=8, X 1 23=4, X 1 24=12, X 1 31=2, X 1 35=12, X 1 41=12, X 1 51=1, X 1 52=11, X 2 11=6, X 2 13=4, X 2 14=11, X 2 22=2, X 2 24=1, X 2 25=12, X 2 31=12, X 2 42=12, X 2 53=12.III.} 		 		\backmatter  			 			 			  				\begin{bibitemlist}{1}
\bibitem[Waiel (2001)]{b18}\label{b18} 	 		‘A multiobjective transportation problem under fuzziness’.  		 			F Waiel 		.  	 	 		\textit{Fuzzy Sets and Systems},  				January (2001. 117 p. .  	 
\bibitem[Hurt and Tramel ()]{b4}\label{b4} 	 		‘Alternative formulation of the transshipment problem’.  		 			V Hurt 		,  		 			T Tramel 		.  	 	 		\textit{Journal of Farm Economics}  		1965. 47  (3)  p. .  	 
\bibitem[Khurana et al. ()]{b11}\label{b11} 	 		‘An algorithm for solving time minimizing capacitated transshipment problem’.  		 			A Khurana 		,  		 			V Tripti 		,  		 			S Arora 		.  	 	 		\textit{International Journal of Management Science and Engineering Management}  		2012. 7  (3)  p. .  	 
\bibitem[Judge et al. ()]{b3}\label{b3} 	 		‘An interregional model: Its formulation and application to the live-stock industry’.  		 			G Judge 		,  		 			J Hsvlicek 		,  		 			R Rizek 		.  	 	 		\textit{Agriculture and Economy and Revision}  		1965. 7 p. .  	 
\bibitem[Sayed et al. ()]{b15}\label{b15} 	 		‘Efficient Multiobjective Genetic Algorithm for Solving Transportation, Assignment, and Transshipment Problems’.  		 			A Sayed 		,  		 			Abd Zaki 		,  		 			Allah A Mousa 		,  		 			M Hamdy 		,  		 			Adel Y Geneedi 		,  		 			Elmekawy 		.  		 ID: 16769.  	 	 		\textit{Applied Mathematics}  		2012. 3  (1) .  	 
\bibitem[Rhody ()]{b2}\label{b2} 	 		\textit{Interregional competitive position of the hog-pork industry in the southeast United States},  		 			D Rhody 		.  		1963.  		 			Iowa State University 		 	 	 (Ph.D. thesis) 
\bibitem[Ozdemir et al. ()]{b7}\label{b7} 	 		\textit{Multi location transshipment problem with capacitated production and lost sales},  		 			D Ozdemir 		,  		 			Yucesan 		,  		 			Y Here 		.  		2006. 2006.  	 	 (Proceeding of the) 
\bibitem[Khurana (2013)]{b13}\label{b13} 	 		\textit{Multi-index fixed charge bi-criterion transshipment problem},  		 			Archana Khurana 		.  		June (2013. 50 p. .  	 
\bibitem[Das et al. (1999)]{b19}\label{b19} 	 		‘Multiobjective transportation problem with interval cost, source and destination parameters’.  		 			S K Das 		,  		 			A Goswami 		,  		 			S S Alam 		.  	 	 		\textit{European Journal of Operational Research}  		August (1999. 117  (1)  p. .  	 
\bibitem[Osman and Ellaimony ()]{b9}\label{b9} 	 		‘On bicriteria multistage transportation problems’.  		 			M S A Osman 		,  		 			E E M Ellaimony 		.  	 	 		\textit{First Conference on Operations Research and its Military Applications},  				1984. p. .  	 
\bibitem[King and Logan ()]{b1}\label{b1} 	 		‘Optimum location, number, and size of processing plants with raw product and final product shipments’.  		 			G King 		,  		 			S Logan 		.  	 	 		\textit{Journal of Farm Economics}  		1964. 46 p. .  	 
\bibitem[Saraj1 and Mashkoorzadeh (2010)]{b17}\label{b17} 	 		‘Solving a Multi Objective Transportation Problem (MOTP) Under Fuzziness on Using Interval Numbers’.  		 			Mansour Saraj1 		,  		 			Feryal Mashkoorzadeh 		.  	 	 		\textit{AIP Conf. Proc. 1281},  				 (Rhodes (Greece)  		September (2010. 1137.  	 
\bibitem[Rajendran and Pandian ()]{b14}\label{b14} 	 		‘Solving Fully Interval Transshipment Problems’.  		 			P Rajendran 		,  		 			P Pandian 		.  	 	 		\textit{International Mathematical Forum}  		2012. 7  (41)  p. .  	 
\bibitem[Khurana and Arora ()]{b10}\label{b10} 	 		‘Solving transshipment problems with mixed constraints’.  		 			A Khurana 		,  		 			S Arora 		.  	 	 		\textit{International Journal of Management Science and Engineering Management}  		2011. 6  (4)  p. .  	 
\bibitem[Here and Tzura ()]{b6}\label{b6} 	 		‘The dynamic transshipment problem’.  		 			Y Here 		,  		 			M Tzura 		.  	 	 		\textit{Naval Research Logistics Quarterly}  		2001. 48 p. .  	 
\bibitem[Grag and Parakash ()]{b5}\label{b5} 	 		‘Time minimizing transshipment problem’.  		 			R Grag 		,  		 			S Parakash 		.  	 	 		\textit{Indian Journal of Pure and Applied Mathematics}  		1985. 16  (5)  p. .  	 
\bibitem[Ojha et al. ()]{b16}\label{b16} 	 		‘Transportation policies for single and multi-objective transportation problem using fuzzy logic’.  		 			Anupam Ojha 		,  		 			Kr 		,  		 			Manoranjan Mondal 		,  		 			Maiti 		.  	 	 		\textit{Mathematical and Computer Modelling}  		2011. 2011. 01 p. .  	 
\bibitem[Orden ()]{b0}\label{b0} 	 		‘Transshipment problem’.  		 			A Orden 		.  	 	 		\textit{Management Science}  		1956.  (3)  p. .  	 
\bibitem[Yousria et al. ()]{b12}\label{b12} 	 		‘Trust region algorithm for multi-objective transportation, assignment, and transshipment problems’.  		 			A Yousria 		,  		 			E Bothina 		,  		 			Z Hanadi 		.  	 	 		\textit{Life Science Journal}  		2012. 9  (3)  p. .  	 
\bibitem[Winter Simulation Conference]{b8}\label{b8} 	 		\textit{Winter Simulation Conference},  				p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
