DMCA
A Heuristic to Solve the Weekly Log-Truck Scheduling Problem (2009)
BibTeX
@MISC{A09aheuristic,
author = {Nizar El Hachemi A and Michel Gendreau A and Louis-martin Rousseau A},
title = {A Heuristic to Solve the Weekly Log-Truck Scheduling Problem},
year = {2009}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present in this article the log-truck scheduling problem, which combine routing and scheduling of trucks with some specific constraints related to the canadian forestry context. This problem includes aspects such as pick-up and delivery, multiple products, inventory stock, multiple supply points and multiple demand points. We developped a decomposed approach to solve the weekly problem, in two phases. At the first phase we use a tabu search algorithm to solve an integer problem in order to determine the destinations of full truckloads from forest areas to woodmills. At the second phase, we make use of a standard local search algorithm to schedule the daily transportation of logs. This approach has been implemented using COMET 0.07 that use the concept of constraint-based local search. We tested our method on a set of industrial cases from forest companies in canada.
Keyphrases
weekly log-truck scheduling problem daily transportation decomposed approach specific constraint multiple supply point log-truck scheduling problem industrial case inventory stock constraint-based local search multiple demand point canadian forestry context first phase multiple product integer problem tabu search algorithm full truckloads weekly problem standard local search algorithm second phase
