Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 36, Issue 4, Pages 1122-1144Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2007.12.012
Keywords
Forestry; Routing; Tabu search; Linear Programming; OR in Practice
Ask authors/readers for more resources
In this paper, we consider an operational routing problem to decide the daily routes of logging trucks in forestry. This 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 standard 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 which each 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 tabu search method is extended to consider some new features. The solution approach is tested on a set of industrial cases from major forest companies in Sweden. (C) 2008 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available