IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-540-32539-0_10.html
   My bibliography  Save this book chapter

Timber Transport Vehicle Routing Problems: Formulation and Heuristic Solution

In: Operations Research Proceedings 2005

Author

Listed:
  • Manfred Gronalt

    (BOKU — University of Natural Resources and Applied Life Sciences)

  • Patrick Hirsch

    (BOKU — University of Natural Resources and Applied Life Sciences)

Abstract

We present a model formulation and a Tabu Search based solution method for the Timber Transport Vehicle Routing Problem (TTVRP). A fleet of m trucks which are situated at the respective homes of the truck drivers has to fulfil n transports of round timber between different wood storage locations and industrial sites. All transports are carried out as full truck loads. Since the full truck movements are predetermined our objective is to minimize the overall distance of empty truck movements. In addition to the standard VRP we have to consider weight constraints at the network, multi-depots, and time windows. The optimum solution of this problem with common solver software is only possible for very small instances. Therefore we develop a customized heuristic to solve real-life problems. We modify the traditional Tabu Search by delimiting the neighborhood in some iterations and verify our heuristic with extensive numerical studies.

Suggested Citation

  • Manfred Gronalt & Patrick Hirsch, 2006. "Timber Transport Vehicle Routing Problems: Formulation and Heuristic Solution," Operations Research Proceedings, in: Hans-Dietrich Haasis & Herbert Kopfer & Jörn Schönberger (ed.), Operations Research Proceedings 2005, pages 61-66, Springer.
    • Handle: RePEc:spr:oprchp:978-3-540-32539-0_10
    DOI: 10.1007/3-540-32539-5_10
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-540-32539-0_10. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.