\relax 
\catcode `:\active 
\catcode `;\active 
\catcode `!\active 
\catcode `?\active 
\select@language{french}
\@writefile{toc}{\select@language{french}}
\@writefile{lof}{\select@language{french}}
\@writefile{lot}{\select@language{french}}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces Diff\IeC {\'e}rentes positions possible de points par rapport \IeC {\`a} $A$ et $B$\relax }}{2}}
\providecommand*\caption@xref[2]{\@setref\relax\@undefined{#1}}
\newlabel{fig:positionsC}{{1}{2}}
\@writefile{toc}{\contentsline {part}{I\hspace  {1em}G\IeC {\'e}n\IeC {\'e}ration de carte routi\IeC {\`e}re r\IeC {\'e}aliste}{2}}
\@writefile{toc}{\contentsline {section}{\numberline {1}Condition pour un graphe de Gabriel}{2}}
\newlabel{eq:condArete}{{1}{2}}
\@writefile{toc}{\contentsline {paragraph}{preuve :}{2}}
\@writefile{toc}{\contentsline {section}{\numberline {2}Mise en pratique : graphe de Gabriel et de voisinage relatif}{2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.1}Cr\IeC {\'e}ation de graphe de Gabriel et de voisinage relatif}{2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.2}G\IeC {\'e}n\IeC {\'e}ration d'un r\IeC {\'e}seau}{2}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces Graphe de gabriel\relax }}{3}}
\newlabel{fig:2_4_gabriel}{{2}{3}}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces Graphe de voisinage realtif\relax }}{4}}
\newlabel{fig:2_4_gvr}{{3}{4}}
\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces R\IeC {\'e}seau g\IeC {\'e}n\IeC {\'e}r\IeC {\'e}\relax }}{5}}
\newlabel{fig:2_5}{{4}{5}}
\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces Temps d'ex\IeC {\'e}cution du r\IeC {\'e}seau na\IeC {\"\i }f\relax }}{6}}
\newlabel{fig:reseaunaiflog}{{5}{6}}
\@writefile{toc}{\contentsline {subsection}{\numberline {2.3}Temps de g\IeC {\'e}n\IeC {\'e}ration d'un r\IeC {\'e}seau}{6}}
\@writefile{toc}{\contentsline {section}{\numberline {3}Triangulation de Delaunay}{6}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.1}Pratique}{6}}
\@writefile{toc}{\contentsline {subsection}{\numberline {3.2}Aspect th\IeC {\'e}orique}{6}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.1}Condition pour un graphe de Delaunay}{6}}
\@writefile{toc}{\contentsline {paragraph}{preuve:}{6}}
\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces Cas o\IeC {\`u} le graphe de Delaunay n'est pas planaire.\relax }}{7}}
\newlabel{fig:delaunayPasPlanaire}{{6}{7}}
\@writefile{lof}{\contentsline {figure}{\numberline {7}{\ignorespaces Maille polygonale.\relax }}{7}}
\newlabel{fig:maillePolygonale}{{7}{7}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.2}Le graphe de Delaunay est planaire}{7}}
\@writefile{toc}{\contentsline {paragraph}{preuve}{7}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.3}Le graphe de Delaunay est une triangulation}{7}}
\@writefile{toc}{\contentsline {paragraph}{preuve}{7}}
\@writefile{toc}{\contentsline {subsubsection}{\numberline {3.2.4}Condition sur les faces}{8}}
\@writefile{toc}{\contentsline {paragraph}{preuve}{8}}
\@writefile{lof}{\contentsline {figure}{\numberline {8}{\ignorespaces Algorithme de Dijkstra avec des co\IeC {\^u}ts constants\relax }}{9}}
\newlabel{fig:31}{{8}{9}}
\@writefile{toc}{\contentsline {part}{II\hspace  {1em}Algorithme de Dijkstra pour la recherche du plus court chemin}{9}}
\@writefile{toc}{\contentsline {section}{\numberline {4}Algorithme de Dijkstra}{9}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.1}Co\IeC {\^u}ts constants}{9}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.2}Co\IeC {\^u}ts variables}{9}}
\@writefile{toc}{\contentsline {subsection}{\numberline {4.3}Temps de calcul}{9}}
\@writefile{toc}{\contentsline {section}{\numberline {5}Dijkstra avec tas}{9}}
\@writefile{toc}{\contentsline {section}{\numberline {6}Algorithme A*}{9}}
\@writefile{lof}{\contentsline {figure}{\numberline {9}{\ignorespaces Dijkstra avec le carburant comme co\IeC {\^u}t\relax }}{10}}
\newlabel{fig:32carburant}{{9}{10}}
\@writefile{lof}{\contentsline {figure}{\numberline {10}{\ignorespaces Dijkstra avec le temps comme co\IeC {\^u}t\relax }}{10}}
\newlabel{fig:32temps}{{10}{10}}
\@writefile{lof}{\contentsline {figure}{\numberline {11}{\ignorespaces Temps d'ex\IeC {\'e}cution de l'algorithme de Dijkstra\relax }}{10}}
\newlabel{fig:33}{{11}{10}}
\@writefile{lof}{\contentsline {figure}{\numberline {12}{\ignorespaces Comparaison des temps d'ex\IeC {\'e}cution de Dijkstra et Dijkstra avec tas\relax }}{11}}
\newlabel{fig:36}{{12}{11}}
\@writefile{lof}{\contentsline {figure}{\numberline {13}{\ignorespaces Comparaison des trois algorithmes (temps moyens sur 10 ex\IeC {\'e}cutions)\relax }}{12}}
\newlabel{fig:39}{{13}{12}}
\@writefile{lof}{\contentsline {figure}{\numberline {14}{\ignorespaces Tourn\IeC {\'e}e optimale obtenue par backtracking\relax }}{13}}
\newlabel{fig:42}{{14}{13}}
\@writefile{toc}{\contentsline {part}{III\hspace  {1em}Probl\IeC {\`e}me du voyageur de commerce}{13}}
\@writefile{toc}{\contentsline {section}{\numberline {7}R\IeC {\'e}solution par Backtracking}{13}}
\@writefile{toc}{\contentsline {subsection}{\numberline {7.1}R\IeC {\'e}solution}{13}}
\@writefile{toc}{\contentsline {subsection}{\numberline {7.2}Temps d'ex\IeC {\'e}cution}{13}}
\@writefile{toc}{\contentsline {section}{\numberline {8}R\IeC {\'e}solution approch\IeC {\'e}e}{13}}
\@writefile{lof}{\contentsline {figure}{\numberline {15}{\ignorespaces Temps d'ex\IeC {\'e}cution de l'algorithme par backtracking\relax }}{14}}
\newlabel{fig:43}{{15}{14}}
\@writefile{lof}{\contentsline {figure}{\numberline {16}{\ignorespaces Voyageur de commerce approch\IeC {\'e}\relax }}{14}}
\newlabel{fig:48approx}{{16}{14}}
\@writefile{lof}{\contentsline {figure}{\numberline {17}{\ignorespaces Voyageur de commerce na\IeC {\"\i }f\relax }}{14}}
\newlabel{fig:48naif}{{17}{14}}
\@writefile{lof}{\contentsline {figure}{\numberline {18}{\ignorespaces Temps d'ex\IeC {\'e}cution de la r\IeC {\'e}solution approch\IeC {\'e}e\relax }}{15}}
\newlabel{fig:49}{{18}{15}}