deletions | additions       diff --git a/chapter_Review_of_Related_Literature__.tex b/chapter_Review_of_Related_Literature__.tex  index 4600b3b..a4286d0 100644  --- a/chapter_Review_of_Related_Literature__.tex  +++ b/chapter_Review_of_Related_Literature__.tex 
...
\subsubsubsection{Contiuous Approach}  \subsubsubsection{Discrete Approach}  \begin{table}   \begin{tabular}{ c c }  \emph {Author} \begin{table}[]  \centering  \caption{My caption}  \label{my-label}  \begin{tabular}{ll} \hline  \multicolumn{1}{|l|}{\textit{\textbf{Author}}}  & \emph{Description} \multicolumn{1}{l|}{\textit{\textbf{Description}}}  \\ \hline Lampkin \multicolumn{1}{|l|}{Lampkin  and Saalmans(1967) Saalmans(1967)}  & Minimize \multicolumn{1}{l|}{\begin{tabular}[c]{@{}l@{}}Minimize  travel time\\ \tab \tab \tab  given fleet size \\  and vehicle size size\end{tabular}}  \\ \hline Hasselstrom (1981) \multicolumn{1}{|l|}{Hasselstrom (1981)}  & Maximize \multicolumn{1}{l|}{\begin{tabular}[c]{@{}l@{}}Maximize  number of passengers (demand) \\ \tab \tab \tab passenger s (demand)\\  given budget and minimum frequency constraints \\ constraints\end{tabular}}  \\ \hline Ceder \multicolumn{1}{|l|}{Ceder  and Wilson (1986) (1986)}  & Minimize \multicolumn{1}{l|}{\begin{tabular}[c]{@{}l@{}}Minimize  travel time, transfer\\ \tab \tab \tab  time and and\\  fleet size given constraints on\\ \tab \tab \tab  route length, length,\\  number of routes and frequency. routes,and frequency.\end{tabular}}  \\ \hline Janarthanan \multicolumn{1}{|l|}{Janarthanan  and Schneider(1998) Schneider(1998)}  & Includes \multicolumn{1}{l|}{\begin{tabular}[c]{@{}l@{}}Includes  manual network design,\\ \tab \tab \tab design, \\  assignment and feedback. feedback.\end{tabular}}  \\ \hline Van \multicolumn{1}{|l|}{Van  Nes et al. (1998) (1998)}  & Maximize \multicolumn{1}{l|}{\begin{tabular}[c]{@{}l@{}}Maximize  the number of passengers\\ \tab \tab \tab passengers \\  with no transfer given a budget constraint. constraint.\end{tabular}}  \\ \hline Baaj \multicolumn{1}{|l|}{Baaj  and Mahmassani(1995) Mahmassani(1995)}  & Includes \multicolumn{1}{l|}{\begin{tabular}[c]{@{}l@{}}Includes  computer aided network\\ \tab \tab \tab network \\  design, assignment and line improvement improvement\end{tabular}}  \\ \hline Ceder \multicolumn{1}{|l|}{Ceder  and Israeli (1998) (1998)}  & Minimize \multicolumn{1}{l|}{\begin{tabular}[c]{@{}l@{}}Minimize  travel time, empty\\ \tab \tab \tab  seat hours hours\\  and fleet size size\end{tabular}}  \\ \hline Shih et al.(1998) & Includes \begin{tabular}[c]{@{}l@{}}Includes  computer aided network design, \\\tab \tab \tab  transfer nodes, assignment and and\\  line improvement improvement\end{tabular}  \\\hline  Chien et al. (2001) & Minimize \begin{tabular}[c]{@{}l@{}}Minimize  user and supplier costs \\\tab \tab \tab \\  subject to constraints, applies \\  genetic algorithm algorithm\end{tabular}  \\\hline  Saka(2001) & Reduce \begin{tabular}[c]{@{}l@{}}Reduce  operating costs byfinding  \\ \tab \tab \tab finding  optimal spacing of buses. buses.\end{tabular}  \\\hline  Ngamchai and Lovell (2003) & Includes \begin{tabular}[c]{@{}l@{}}Includes  frequency setting and \\ \tab \tab \tab headway headway\\  coordination. Applies a genetic algorithm \\ \tab \tab \tab algorithm\\  to help optimize bus transit bus,transit  route design. design.\end{tabular}  \\\hline  Verma and Dhingra (2005) & Routes \begin{tabular}[c]{@{}l@{}}Routes  are generated based on \\ \tab \tab \tab shortest shortest\\  paths, also considers transfers to rail \\\tab \tab \tab  stations.Applies a genetic algorithm. a,genetic algorithm.\end{tabular}  \\\hline  Fan and Machemehl (2006) & Includes \begin{tabular}[c]{@{}l@{}}Includes  computer aided network design design\\  and\\ \tab \tab \tab  assignment. Applies a simulated simulated\\  annealing procedure\\ \tab \tab \tab  to select an optimal select,an optimal\\  set of routes. \\ \hline routes.\end{tabular}  \end{tabular} \end{table} \subsubsubsection{Hybrid Routing Model}    \subsection{Microsimulation}