%%

%%

%%----------------------------------------------------------------

\begin{frame}{The Elevator Dispatching Problem with Destination Control}

\begin{columns}

\column{0.5\textwidth}

\begin{itemize}

\item The Elevator Dispatching Problem with Destination Control We propose developing a Branch-and-Price (BP) exact method that can provide optimal solutions to instances. The size of the instances that BP can solve has to be determined with computational experiments once the method is implemented and cannot be known beforehand. BP is known to provide good lower bounds that can also be used to evaluate heuristic solutions. The aim of this study is to provide optimal solutions to the deterministic-static EDPDC where we have perfect information and compare with Schindler’s heuristic solution.

\item Sponsor: Schindler

\item September 22, 2022-April 01, 2023

\end{itemize}

\column{0.5\textwidth}

\begin{center}

\epsfig{figure=INVENTIO.ps,width=\textwidth}

\end{center}

\end{columns}

\end{frame}