A genetic algorithm for a pulp distribution problem
2003 (English)Report (Other academic)
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.
Place, publisher, year, edition, pages
Linköping: Linköpings universitet , 2003. , 21 p.
LiTH-MAT-R, ISSN 0348-2960 ; 26
IdentifiersURN: urn:nbn:se:liu:diva-22364Local ID: 1572OAI: oai:DiVA.org:liu-22364DiVA: diva2:242677