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

Patrik Flisberg (), Bertil Lidén () and Mikael Rönnqvist ()
Additional contact information
Patrik Flisberg: Department of Mathematics, Linköping University, Postal: Linköping University, Department of Mathematics, 581 83 Linköping, Sweden
Bertil Lidén: Skogforsk, Uppsala, Postal: Skogforsk, Uppsala Science Park , SE-751 83Uppsala , Sweden
Mikael Rönnqvist: Dept. of Finance and Management Science, Norwegian School of Economics and Business Administration, Postal: NHH , Department of Finance and Management Science, Helleveien 30, N-5045 Bergen, Norway, http://www.nhh.no/for/cv/ronnqvist-mikael.htm

No 2007/14, Discussion Papers from Norwegian School of Economics, Department of Business and Management Science

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.

Keywords: Forestry; Routing; Tabu search; Linear Programming; OR in Practice (search for similar items in EconPapers)
JEL-codes: C44 C60 Q23 (search for similar items in EconPapers)
Pages: 33 pages
Date: 2007-03-27
New Economics Papers: this item is included in nep-cmp
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/11250/163862 (application/pdf)
Our link check indicates that this URL is bad, the error code is: 404 Not Found (http://hdl.handle.net/11250/163862 [302 Found]--> https://www.unit.no/brage-denne-lenken-er-ikke-lenger-gyldig [301 Moved Permanently]--> https://sikt.no/brage-denne-lenken-er-ikke-lenger-gyldig)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hhs:nhhfms:2007_014

Access Statistics for this paper

More papers in Discussion Papers from Norwegian School of Economics, Department of Business and Management Science NHH, Department of Business and Management Science, Helleveien 30, N-5045 Bergen, Norway. Contact information at EDIRC.
Bibliographic data for series maintained by Stein Fossen ().