\documentclass[10pt]{article}

\usepackage{fullpage}
\usepackage{setspace}
\usepackage{parskip}
\usepackage{titlesec}
\usepackage[section]{placeins}
\usepackage{xcolor}
\usepackage{breakcites}
\usepackage{lineno}
\usepackage{hyphenat}





\PassOptionsToPackage{hyphens}{url}
\usepackage[colorlinks = true,
            linkcolor = blue,
            urlcolor  = blue,
            citecolor = blue,
            anchorcolor = blue]{hyperref}
\usepackage{etoolbox}
\makeatletter
\patchcmd\@combinedblfloats{\box\@outputbox}{\unvbox\@outputbox}{}{%
  \errmessage{\noexpand\@combinedblfloats could not be patched}%
}%
\makeatother


\usepackage{natbib}




\renewenvironment{abstract}
  {{\bfseries\noindent{\abstractname}\par\nobreak}\footnotesize}
  {\bigskip}

\titlespacing{\section}{0pt}{*3}{*1}
\titlespacing{\subsection}{0pt}{*2}{*0.5}
\titlespacing{\subsubsection}{0pt}{*1.5}{0pt}


\usepackage{authblk}


\usepackage{graphicx}
\usepackage[space]{grffile}
\usepackage{latexsym}
\usepackage{textcomp}
\usepackage{longtable}
\usepackage{tabulary}
\usepackage{booktabs,array,multirow}
\usepackage{amsfonts,amsmath,amssymb}
\providecommand\citet{\cite}
\providecommand\citep{\cite}
\providecommand\citealt{\cite}
% You can conditionalize code for latexml or normal latex using this.
\newif\iflatexml\latexmlfalse
\providecommand{\tightlist}{\setlength{\itemsep}{0pt}\setlength{\parskip}{0pt}}%

\AtBeginDocument{\DeclareGraphicsExtensions{.pdf,.PDF,.eps,.EPS,.png,.PNG,.tif,.TIF,.jpg,.JPG,.jpeg,.JPEG}}

\usepackage[utf8]{inputenc}
\usepackage[english]{babel}



\usepackage{float}








\begin{document}

\title{A new method for solving service restoration problem in distribution
networks considering expected switching time}



\author[1]{Qasem Asadi}%
\author[1]{Hamid Falaghi}%
\author[1]{Maryam Ramezani}%
\affil[1]{University of Birjand}%


\vspace{-1em}



  
  \date{June 17, 2024}


\begingroup
\let\center\flushleft
\let\endcenter\endflushleft
\maketitle
\endgroup





\selectlanguage{english}
\begin{abstract}
With the increasing demand for electricity, power distribution utilities
must provide an efficient and appropriate Service Restoration (SR)
strategy to restore customers as soon as possible after power outages.
The heuristic SR algorithm presented in this article is a bi-stage
algorithm that initially re-energizes some loads quickly by
remote-controlled switches in the first stage and then proceeds to
restore the rest of the network in the second stage. In addition to
solving the restoration problem in a bi-stage algorithm, determining the
optimal Switching Sequences (SSs) and applying the Energy Not Supplied
(EENS) as objective function included in this study. Also, taking into
account the time of occurrence of the failure and the daily load curve,
the position of the maintenance team, load transfer capability and the
traffic conditions of the network has increased the attractiveness and
practicality of the proposed method. The heuristic SR algorithm was
applied on a standard IEEE 69-bus system in various scenarios. The
results indicated a significant difference in the solutions of the
problem and the ENS in different scenarios. Finally, it was found that
using this heuristic method would lead to optimal, accurate, and
applicable solutions for SR in distribution networks.%
\end{abstract}%



\sloppy


\textbf{Hosted file}

\verb`Manuscript.docx`  available at \url{https://authorea.com/users/562275/articles/623423-a-new-method-for-solving-service-restoration-problem-in-distribution-networks-considering-expected-switching-time}

\selectlanguage{english}
\FloatBarrier
\end{document}

