liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Model for Multiperiod Route Planning and a Tabu Search Method for Daily Log Truck Scheduling
Linköping University, Department of Mathematics.
Linköping University, Department of Mathematics.
2004 (English)Independent thesis Basic level (professional degree)Student thesis
Abstract [en]

The transportation cost of logs from forest to customers is a large part of the overall cost for the Swedish forestry industry. Finding good routes from harvesting points to saw and pulp mills is a complex task, where the total number of feasible routes is extremely high. In this thesis we present two methods for log truck scheduling.

The first is to, from a given set of routes, find the most valuable subset that fulfils the customers demand. We use a model that is similar to the set partitioning problem and a method that is referred to as a composite pricing coupled with Branch and Bound. The composite pricing based method prices the routes (columns) and chooses the most valuable ones that are then added to the LP relaxation. Once an LP optimum is found, the Branch and Bound method is used to find an integer optimum solution. We have tested this on a case of realistic size.

The second method is a tabu search heuristic. Here, the purpose is to create efficient and qualitative routes from a given number of trips (referred to as predefined trips). From a start solution tabu search systematically generates new solutions. This method was tested on a small problem and on a five times larger problem to study how the size of the problem affected the result. It was also tested and compared on two cases in which the backhauling possibilities (i.e. instead of traveling empty the truck picks up another load on the return trip) had and had not been studied. The composite pricing based method and the tabu search method proved to be very useful for this kind of scheduling.

Place, publisher, year, edition, pages
Matematiska institutionen , 2004.
Keyword [en]
Mathematical optimization, systems theory, Composite Pricing, Forestry, Log Truck Scheduling, Multiperiod Route Planning, Optimization, Predefined Trips, Tabu Search, Transportation
Keyword [sv]
Optimeringslära, systemteori
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-2147ISRN: LITH-MAT-EX--04/01--SEOAI: oai:DiVA.org:liu-2147DiVA: diva2:19477
Uppsok
fysik/kemi/matematik
Available from: 2004-05-13 Created: 2004-05-13

Open Access in DiVA

fulltext(591 kB)612 downloads
File information
File name FULLTEXT01.pdfFile size 591 kBChecksum MD5
a55d2609c3e40589eb372932ddeab3d592d041195f25f8d7be5252ad3bc62dc3be93959c
Type fulltextMimetype application/pdf

By organisation
Department of Mathematics
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 612 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 496 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf