• DocumentCode
    2294262
  • Title

    Hybrid Heuristic Strategies for Planning and Scheduling Forest Harvest and Transportation Activities

  • Author

    Moura, Arnaldo Vieira ; Scaraficci, Rafael Augusto

  • Author_Institution
    Inst. of Comput., Univ. of Campinas, Campinas
  • fYear
    2008
  • fDate
    16-18 July 2008
  • Firstpage
    447
  • Lastpage
    454
  • Abstract
    This work treats a forest planning problem stemming from the daily operation of some large pulp and paper companies. The problem consists in planning and scheduling harvest and transportation activities for each day in a planning horizon of around one year, while satisfying a sizable and complex set of constraints related to the structure of the harvest areas, structure and productivity of the harvest teams, transportation conditions during the rainy seasons, and some properties of the harvested logs. We propose a hybrid approach focused on GRASP (greedy randomized adaptive search procedure) metaheuristic and on linear models. Other techniques such as construction based on memory, path-relinking, and recombination methods were used to enhance the basic GRASP procedure. These strategies were tested on real field data and also with some newly generated instances. They proved to be an adequate approach in all cases.
  • Keywords
    greedy algorithms; metacomputing; search problems; forest harvest scheduling; greedy randomized adaptive search procedure; hybrid heuristic strategies; metaheuristics; path-relinking; transportation activities; transportation conditions; Job shop scheduling; Metals industry; Path planning; Processor scheduling; Production; Productivity; Pulp and paper industry; Road transportation; Strategic planning; Testing; GRASP; linear model; long-term memory; path-relinking; planning; recombination methods;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Science and Engineering, 2008. CSE '08. 11th IEEE International Conference on
  • Conference_Location
    Sao Paulo
  • Print_ISBN
    978-0-7695-3193-9
  • Type

    conf

  • DOI
    10.1109/CSE.2008.31
  • Filename
    4578264