liu.seSök publikationer i DiVA
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
A genetic algorithm for a pulp distribution problem
Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
2003 (Engelska)Rapport (Övrigt vetenskapligt)
Abstract [en]

In this paper we present a genetic algorithm for the pulp distribution problem at a large pulp producer in Scandinavia. The distribution is a major part of the company's supply chain and includes transports with cargo vessels, by train and trucks and storages at terminals in port, at pulp mills and in customer locations. The problem we focus on is to find ship schedules and pulp deliveries in order to minimize the total cost of distribution.

The genetic algorithm utilizes two linear programming models. The first model optimizes all transport flows given a schedule and the second model approximates the performance of a schedule, measured in the total distribution cost. In the computational experiments we use instances from the real world and compare the results with an exact mixed integer programming approach.

Ort, förlag, år, upplaga, sidor
Linköping: Linköpings universitet , 2003. , s. 21
Serie
LiTH-MAT-R, ISSN 0348-2960 ; 26
Nationell ämneskategori
Matematik
Identifikatorer
URN: urn:nbn:se:liu:diva-22364Lokalt ID: 1572OAI: oai:DiVA.org:liu-22364DiVA, id: diva2:242677
Tillgänglig från: 2009-10-07 Skapad: 2009-10-07 Senast uppdaterad: 2013-11-05
Ingår i avhandling
1. Optimization models and methods for production planning and ship scheduling in the pulp industry
Öppna denna publikation i ny flik eller fönster >>Optimization models and methods for production planning and ship scheduling in the pulp industry
2003 (Engelska)Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
Abstract [en]

To use optimization models and methods is an increasingly acknowledged element of supply chain management for large industries. Concurrently with the increasing global market competition and modern business policies, an already effective organization needs to find new possibilities to improve their planning procedures and resource utilization. To incorporate the planning in a more comprehensive context, in an overall supply chain, provides new possibilities to efficiently manage several planning steps than if considered individually.

This thesis considers production planning and ship scheduling problems at Södra Cell, a large Scandinavian pulp manufacturer. The main purpose of the thesis is to suggest optimization models and methods that can support production and distribution planners to objectively consider the supply chain impact in the short-term decision making process. The production planning and the ship scheduling problems are approached separately. Optimization models are formulated for both problems, and specially adapted solution methods are developed that account the characteristics of the problems.

The thesis consists of three research papers. In the first paper two mixed integer models (MIPs) are developed for the production planning problem. The first model has binary variables for every possible production plan and a column generation approach with a constraint branching heuristic is used to solve the otherwise very large model. The second model has the production choices formulated in constraints and is solved with a standard branch and bound search. The results are compared with manual planning and potential large savings are indicated.

The second and the third paper both consider the pulp distribution problem where ship routing and scheduling decisions have a key role. In the second paper the problem is solved with a rolling time horizon method. An MIP model is solved repeatedly over short ranges of time until eventually the whole planning period is covered. The third paper presents a genetic algorithm with integrated linear programming models for the distribution problem. The solutions from the different solution strategies for the distribution problem are mutually compared in the third paper.

Ort, förlag, år, upplaga, sidor
Linköping: Linköpings universitet, 2003. s. 12
Serie
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1056
Nationell ämneskategori
Matematik
Identifikatorer
urn:nbn:se:liu:diva-22355 (URN)1561 (Lokalt ID)91-7373-777-1 (ISBN)1561 (Arkivnummer)1561 (OAI)
Presentation
2003-11-07, Glashuset, Hus B, Linköpings Universitet, Linköping, 10:15 (Svenska)
Opponent
Tillgänglig från: 2009-10-07 Skapad: 2009-10-07 Senast uppdaterad: 2013-11-05

Open Access i DiVA

Fulltext saknas i DiVA

Personposter BETA

Bredström, DavidRönnqvist, Mikael

Sök vidare i DiVA

Av författaren/redaktören
Bredström, DavidRönnqvist, Mikael
Av organisationen
OptimeringsläraTekniska högskolan
Matematik

Sök vidare utanför DiVA

GoogleGoogle Scholar

urn-nbn

Altmetricpoäng

urn-nbn
Totalt: 579 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf