@techreport{TR-IC-PFG-19-25,
   number = {IC-PFG-19-25},
   author = {Lauro Cruz e {Souza} and Fábio Luiz {Usberti}},
   title  =  {{Two-stage  Stochastic  Traveling  Salesman Problem with
                   Evolutionary Framework}},
   month = {June},
   year = {2019},
   institution = {Institute of Computing, University of Campinas},
   note = {In English, 18 pages.
    \par\selectlanguage{english}\textbf{Abstract}
       The  Traveling  Salesman  Problem  (TSP)  is  a  widely studied
       problem  in  the  literature  since  its formulation, specially
       because of its wide number of applications in Computer Science,
       mainly  in  routing and scheduling problems. But the Stochastic
       Traveling  Salesman problem, the Stochastic version of the TSP,
       which  takes  into  consideration future uncertainties, is less
       mentioned.  The  goal  of this study is to increase the studies
       and   implementations   of  the  Stochastic  TSP  using  a  new 
       framework,  the  Evolutionary  Framework (EvFW), which obtained
       great  results  with  other  stochastic  problems and has great
       applicability  for large instances since it is the first of its
       kind  to  have  a  fully  heuristic decomposition approach, not
       depending  on  Integer  Linear  Programming solvers. We hope to
       have  brought  new data to the literature regarding the problem
       and shown the usefulness of the EvFW.
  }
}