documentclass{apmcmthesis}renewcommand{abstractname}{juoceano}
usepackage{url}
pagestyle{frontmatterstyle}
begin{abstract}
NotethatusersneedtohavesomeexperiencewithLaTeX{},atleastsomeofthefeaturesofcommonmacropackages,suchasreferences,mathformulas,imageusage,listenvironment,etc.Templateshaveaddedcommonlyusedmacros.Package,noadditionaluseradded.
keywords{Keywords1quadKeywords2quadKeywords3}end{abstract}
newpage%目录tableofcontents
newpagepagestyle{mainmatterstyle}setcounter{page}{1}section{Introduction}Inordertoindicatetheoriginofproblems,thefollowingbackgroundisworthmentioning.subsection{}
subsection{}
section{TheDescriptionoftheProblem}subsection{Howdoweapproximatethewholecourseof}
begin{itemize}itemitemitemend{itemize}
subsection{Howdowedefinetheoptimalconfiguration}1)Fromtheperspectiveof:par2)Fromtheperspectiveofthe:par3)Compromise:
subsection{Thelocaloptimizationandtheoveralloptimization}
begin{itemize}itemitemitemVirtually:end{itemize}
subsection{Thedifferencesinweightsandsizesof}
subsection{Whatifthereisnodataavailable}
section{Models}subsection{BasicModel}
subsubsection{Terms,DefinitionsandSymbols}Thesignsanddefinitionsaremostlygeneratedfromqueuingtheory.
subsubsection{Assumptions}
subsubsection{TheFoundationofModel}1)Theutilityfunction
begin{itemize}itemThecostof:itemThelossof:itemTheweightofeachaspect:itemCompromise:end{itemize}
3)Theoveralloptimizationandthelocaloptimization
begin{itemize}itemTheoveralloptimization:itemThelocaloptimization:itemTheoptimalnumberof:end{itemize}
subsubsection{SolutionandResult}1)Thesolutionoftheintegerprogramming:2)Results:subsubsection{AnalysisoftheResult}begin{itemize}itemLocaloptimizationandoveralloptimization:itemSensitivity:TheresultisquitesensitivetothechangeofthethreeparametersitemitemTrend:itemComparison:end{itemize}subsubsection{StrengthandWeakness}
begin{description}item[Strength:]TheImprovedModelaimstomakeupfortheneglectof.TheresultseemstodeclarethatthismodelismorereasonablethantheBasicModelandmuchmoreeffectivethantheexistingdesign.item[Weakness:]Thusthemodelisstillanapproximateonalargescale.Thishasdoomedtolimittheapplicationsofit.end{description}
section{Conclusions}
subsection{Conclusionsoftheproblem}begin{itemize}itemitemitemitemend{itemize}subsection{Methodsusedinourmodels}begin{itemize}itemitemitemitemend{itemize}subsection{Applicationsofourmodels}begin{itemize}itemitemitemitemend{itemize}section{FutureWork}subsection{Anothermodel}subsubsection{Thelimitationsofqueuingtheory}
subsubsection{}
newpage%附录
section{Appendix}begin{lstlisting}[language=matlab,caption={ThematlabSourcecodeofAlgorithm}]kk=2;[mdd,ndd]=size(dd);while~isempty(V)[tmpd,j]=min(W(i,V));tmpj=V(j);fork=2:ndd[tmp1,jj]=min(dd(1,k)+W(dd(2,k),V));tmp2=V(jj);tt(k-1,:)=[tmp1,tmp2,jj];endtmp=[tmpd,tmpj,j;tt];[tmp3,tmp4]=min(tmp(:,1));iftmp3==tmpd,ss(1:2,kk)=[i;tmp(tmp4,2)];else,tmp5=find(ss(:,tmp4)~=0);tmp6=length(tmp5);ifdd(2,tmp4)==ss(tmp6,tmp4)ss(1:tmp6+1,kk)=[ss(tmp5,tmp4);tmp(tmp4,2)];else,ss(1:3,kk)=[i;dd(2,tmp4);tmp(tmp4,2)];end;enddd=[dd,[tmp3;tmp(tmp4,2)]];V(tmp(tmp4,3))=[];[mdd,ndd]=size(dd);kk=kk+1;end;S=ss;D=dd(1,:);end{lstlisting}begin{lstlisting}[language=c,caption={Thelingosourcecode}]kk=2;[mdd,ndd]=size(dd);while~isempty(V)
[tmpd,j]=min(W(i,V));tmpj=V(j);fork=2:ndd
[tmp1,jj]=min(dd(1,k)+W(dd(2,k),V));tmp2=V(jj);tt(k-1,:)=[tmp1,tmp2,jj];end
tmp=[tmpd,tmpj,j;tt];[tmp3,tmp4]=min(tmp(:,1));iftmp3==tmpd,ss(1:2,kk)=[i;tmp(tmp4,2)];else,tmp5=find(ss(:,tmp4)~=0);tmp6=length(tmp5);ifdd(2,tmp4)==ss(tmp6,tmp4)
ss(1:tmp6+1,kk)=[ss(tmp5,tmp4);tmp(tmp4,2)];else,ss(1:3,kk)=[i;dd(2,tmp4);tmp(tmp4,2)];end;end
dd=[dd,[tmp3;tmp(tmp4,2)]];V(tmp(tmp4,3))=[];[mdd,ndd]=size(dd);kk=kk+1;