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