Solving a Log-Truck Scheduling Problem with Constraint Programming

Abstract

Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization technologies. This paper proposes a solution method based on constraint programming and mathematical programming for a log-truck scheduling problem. The problem consists of scheduling the transportation of logs between forest areas and woodmills, as well as routing the fleet of vehicles to satisfy these transportation requests. The objective is to minimize the total cost of non-productive activities such as waiting time of trucks and forest log-loaders and the empty driven distance of vehicles. We propose a constraint programming model to address the combined scheduling and routing problem and an integer programming model to deal with the optimization of deadheads.

DOI: 10.1007/978-3-540-68155-7_25

Extracted Key Phrases

Cite this paper

@inproceedings{Hachemi2008SolvingAL, title={Solving a Log-Truck Scheduling Problem with Constraint Programming}, author={Nizar El Hachemi and Michel Gendreau and Louis-Martin Rousseau}, booktitle={CPAIOR}, year={2008} }