latex算法模板

最新推荐文章于 2024-06-28 20:43:22 发布

✨wolf

最新推荐文章于 2024-06-28 20:43:22 发布

阅读量1.2k

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/weixin_44486653/article/details/122455459

版权

%!TEX encoding = UTF-8 Unicode
%!TEX TS-program = pdflatex
\def\SetClass{article}
\documentclass{\SetClass}
\usepackage[linesnumbered,lined,ruled,commentsnumbered]{algorithm2e}
\usepackage{CJKutf8}
\AtBeginDocument{\begin{CJK}{UTF8}{gbsn}}
	\AtEndDocument{\end{CJK}}
\begin{document}
\IncMargin{1em}
\begin{algorithm}
  \SetKwData{Left}{left}\SetKwData{This}{this}\SetKwData{Up}{up}
  \SetKwFunction{SearchRouteByDriverID}{SearchRouteByDriverID}
  \SetKwFunction{ComputeRouteDistance}{ComputeRouteDistance}
  \SetKwFunction{GetAllInsertRoute}{GetAllInsertRoute}
  \SetKwFunction{InsertFeasible}{InsertFeasible}
  \SetKwInOut{Input}{input}\SetKwInOut{Output}{output}

  \Input{待规划订单信息order}
  \Output{接单司机及其更新后的路径}
  \BlankLine
    \emph{increaseDistance = MAX}\;
    \emph{targetDriver}\;
    \emph{updateRoute}\;
  \For{$driver\leftarrow allDrivers$}{
    \If{driverAbility $<$ orderQuantity}{nextDriver;}
    $route\leftarrow$ \SearchRouteByDriverID{$driverID$}\;
    $oldDistance\leftarrow$ \ComputeRouteDistance{$route,driver$}\;
    $allInsertRoute\leftarrow$ \GetAllInsertRoute{$route,order$}\;
    \For{$insertRoute\leftarrow allInsertRoute$}{
      \If{\InsertFeasible{$insertRoute,driver$}}{
        $newDistance\leftarrow$ \ComputeRouteDistance{$insertRoute,driver$}\;
        \If{$newDistance-oldDistance < increaseDistance$}{
        $increaseDistance \leftarrow newDistance-oldDistance$\;
        $targetDriver \leftarrow driver$\;
        $updateRoute \leftarrow insertRoute$\;}
      }
    }
  }
  \Return $targetDriver,updateRoute$
  \caption{穷举法}\label{algo_disjdecomp}
\end{algorithm}\DecMargin{1em}
\end{document}