Advanced Search
MyIDEAS: Login to save this paper or follow this series

A hybrid method based on linear programming and tabu search for routing of logging trucks

Contents:

Author Info

  • Flisberg, Patrik

    ()
    (Department of Mathematics, Linköping University)

  • Lidén, Bertil

    ()
    (Skogforsk, Uppsala)

  • Rönnqvist, Mikael

    ()
    (Dept. of Finance and Management Science, Norwegian School of Economics and Business Administration)

Registered author(s):

    Abstract

    In this paper, we consider an operational routing problem to decide the daily routes of logging trucks in forestry. The industrial problem is difficult and includes aspects such as pickup and delivery with split pickups, multiple products, time windows, several time periods, multiple depots, driver changes and a heterogeneous truck fleet. In addition, the problem size is large and the solution time limited. We describe a two-phase solution approach which transforms the problem into a vehicle routing problem with time windows. In the first phase, we solve an LP problem in order to find a destination of flow from supply points to demand points. Based on this solution, we create transport nodes each of which defines the origin(s) and destination for a full truckload. In phase two, we make use of a standard tabu search method to combine these transport nodes, which can be considered to be customers in vehicle routing problems, into actual routes. The standard tabu search method is extended to consider some new features. The solution approach is implemented as part of a newly developed decision support system and we report on tests made on a set of industrial cases from major forest companies in Sweden.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.nhh.no/for/dp/2007/1407.pdf
    Our checks indicate that this address may not be valid because: 404 Not Found. If this is indeed the case, please notify (Stein Fossen)
    Download Restriction: no

    Bibliographic Info

    Paper provided by Department of Business and Management Science, Norwegian School of Economics in its series Discussion Papers with number 2007/14.

    as in new window
    Length: 33 pages
    Date of creation: 27 Mar 2007
    Date of revision:
    Handle: RePEc:hhs:nhhfms:2007_014

    Contact details of provider:
    Postal: NHH, Department of Business and Management Science, Helleveien 30, N-5045 Bergen, Norway
    Phone: +47 55 95 92 93
    Fax: +47 55 95 96 50
    Email:
    Web page: http://www.nhh.no/en/research-faculty/department-of-business-and-management-science.aspx
    More information through EDIRC

    Related research

    Keywords: Forestry; Routing; Tabu search; Linear Programming; OR in Practice;

    Find related papers by JEL classification:

    This paper has been announced in the following NEP Reports:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Andersson, Gert & Flisberg, Patrik & Lidén, Bertil & Rönnqvist, Mikael, 2007. "RuttOpt – A decision support system for routing of logging trucks," Discussion Papers 2007/16, Department of Business and Management Science, Norwegian School of Economics.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:hhs:nhhfms:2007_014. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Stein Fossen).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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