@techreport{TR-IC-07-34,
  number = {IC-07-34},
  author = {Arnaldo Vieira Moura and Rafael Augusto Scaraficci},
  title = {A Hybrid Heuristic for Forest Harvest and Transporation Problems},
  month = {November},
  year = {2007}, 
  institution = {Institute of Computing, University of Campinas},
  note = {In English, 29 pages.
    \par\selectlanguage{english}\textbf{Abstract}
       This work treats harvest and transportation planning problems
       stemming from the daily operation of some large pulp and paper
       companies. The problem consists in scheduling harvest and
       transportation tasks for a planning horizon of around one
       year. It comprises a large and complex set of constraints,
       including constraints related to the structure of the harvest
       areas, structure and capacity of the harvest teams, the
       weather, and some properties of the wood logs. We developed a
       hybrid algorithm that has three phases, namely, construction,
       local search and post-optimization.  The first two are based on
       a GRASP metaheuristic and are used to generate a pool of elite
       solutions. In the third phase, a relaxed linear model is
       generated for each solution in the pool, and the solution of
       these models are converted into valid solutions. The algorithm
       was tested with real data and proved to be an adequate approach
       to treat this problem. Although some restrictions are specific
       for this problem, the same ideas can inspire similar approaches
       for solving harvest and transportation planning problems in
       other situations.
  }
}