A hybrid method based on linear programming and tabu search for routing of logging trucks
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.
|Date of creation:||27 Mar 2007|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: +47 55 95 92 93
Fax: +47 55 95 96 50
Web page: http://www.nhh.no/en/research-faculty/department-of-business-and-management-science.aspx
More information through EDIRC
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 references are entirely missing, you can add them using this form.