Book chapter
A simulated annealing algorithm to solve the log-truck scheduling problem
Simulated Annealing: Strategies, Potential Uses and Advantages, pp.191-220
Nova Science Publishers, Inc.
2014
Abstract
In this paper, we present a simulated annealing (SA) approach for solving the log-truck scheduling problem, which is an extension of the timber transport vehicle routing problem with time windows(TTVRPTW). The problem is characterized by a heterogeneous fleet of trucks that depart from their corresponding depots and must perform a number of daily transport tasks to move log products between wood pickup (harvest areas) locations and industrial customers, such as pulpmills and sawmills. Commencing at their depots, each truck must perform a number of successive transport tasks, each one characterized by a trip between a designated harvest area and an industrial customer, until the number of daily working hours is completed. The objective of the model is to minimize total empty travel time for the whole fleet as well as waiting times at wood pickup locations. In addition, time
Details
- Title
- A simulated annealing algorithm to solve the log-truck scheduling problem
- Authors
- Mauricio Acuna (Author) - University of the Sunshine Coast - Faculty of Arts and BusinessJohn Sessions (Author) - University of Oregon, United States
- Contributors
- Marcos Tsuzuki (Editor)Thiago de Castro Martins (Editor)
- Publication details
- Simulated Annealing: Strategies, Potential Uses and Advantages, pp.191-220
- Publisher
- Nova Science Publishers, Inc.
- Date published
- 2014
- ISBN
- 9781631172687
- Organisation Unit
- University of the Sunshine Coast, Queensland; Forest Industries Research Centre; Forest Research Institute
- Language
- English
- Record Identifier
- 99450056902621
- Output Type
- Book chapter
Metrics
18 File views/ downloads
973 Record Views