Scheduling a Log Transport System Using Simulated Annealing

Loading...
Thumbnail Image

Date

2014

Authors

Haridass, Karunakaran
Valenzuela, Jorge
Yücekaya, Ahmet
McDonald, Tim

Journal Title

Journal ISSN

Volume Title

Publisher

Elsevier Science

Open Access Color

OpenAIRE Downloads

OpenAIRE Views

Research Projects

Organizational Units

Journal Issue

Abstract

The log truck scheduling problem under capacity constraints and time window constraints is an NP-hard problem that involves the design of best possible routes for a set of trucks serving multiple loggers and mills. The objective is to minimize the total unloaded miles traveled by the trucks. In this paper a simulated annealing - a meta-heuristic optimization method - that interacts with a deterministic simulation model of the log transport system in which the precedence and temporal relations among activities are explicitly accounted for is proposed. The results obtained by solving a small size problem consisting of four trucks two mills three loggers and four truck trips showed that the best solution could be found in less than two minutes. In addition the solution method is tested using data provided by a log delivery trucking firm located in Mississippi. The firm operates sixty-eight trucks to deliver loads from twenty-two logging operations to thirteen mill destinations. The routes assigned by a supervisory person are used as a benchmark to compare the manual generated solution to the solution obtained using the proposed method. (C) 2013 Elsevier Inc. All rights reserved.

Description

Keywords

Log transport, Simulated annealing, Deterministic simulation, Vehicle routing

Turkish CoHE Thesis Center URL

Fields of Science

Citation

30

WoS Q

Q1

Scopus Q

Q1

Source

Volume

264

Issue

Start Page

302

End Page

316