liu.seSearch for publications in DiVA
Change search
Refine search result
1 - 9 of 9
CiteExportLink to result list
Permanent 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
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Bredström, David
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Models and solution methods for large-scale industrial mixed integer programming problems2007Doctoral thesis, comprehensive summary (Other academic)
    Abstract [en]

    This thesis deals with large-scale industrial problems that can be formulated using mixed integer linear programming (MIP) models. Because of the large problem size, it is not often possible to apply standard solution methods. Therefore special techniques must be used. In this thesis, both full optimization and optimization based heuristic approaches are developed.

    The body of this thesis consists of five research papers. In the papers we consider industrial cases based on three applications: production planning at Södra Cell AB, ship routing and distribution at Södra Cell AB, and staff routing and scheduling in the Swedish home care.

    We develop two large-scale MIP models for the production-planning problem. For solving, we use both a direct approach, and a combination of column generation and constraint branching. The latter is a technique to control the branching rules in a branch and bound framework and takes into account application specific properties.

    For the ship routing problem, we present a MIP model and develop two solution methods. The first is based on an iterative rolling time horizon. In each step a part of the model is solved and later fixed. This is repeated until the full problem is solved. The second approach is to combine a genetic algorithm and linear programming. From the MIP model, we obtain solution bounds rarely present in genetic algorithm frameworks.

    In the staff routing problem there are special synchronization constraints and we introduce a new MIP model. An exact solution approach based on column generation and branch and bound is developed. We also suggest a variable fixing heuristic, which we use for solving the more general problem with requirements on equal workload.

    In the computational experiments, we use data instances obtained from real-world cases, and generated instances based on real-world cases. The numerical results show that high quality solutions can be obtained within reasonable time limits in all applications.

    List of papers
    1. Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
    Open this publication in new window or tab >>Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
    2006 (English)In: EconPapers, Vol. 18Article in journal (Other academic) Published
    Abstract [en]

    We present a mathematical programming model for the combined vehicle routing and scheduling problem with time windows and additional temporal constraints. The temporal constraints allow for imposing pairwise synchronization and pairwise temporal precedence between customer visits, independently of the vehicles. We describe some real world problems where the temporal constraints, in the literature, usually are remarkably simplified in the solution process, even though these constraints may significantly improve the solution quality and/or usability. We also propose an optimization based heuristic to solve real size instances. The results of numerical experiments substantiate the importance of the temporal constraints in the solution approach. We also make a computational study by comparing a direct usage of a commercial solver against the proposed heuristic where the latter approach can find high quality solutions within distinct time limits.

    Keywords
    Routing; Scheduling; Temporal Constraints; Synchronization; Branch and Bound
    National Category
    Engineering and Technology
    Identifiers
    urn:nbn:se:liu:diva-13128 (URN)
    Available from: 2008-04-02 Created: 2008-04-02 Last updated: 2009-02-17
    2. A branch and price algorithm for the combined vehicle routing and scheduling problem with synchronization constraints
    Open this publication in new window or tab >>A branch and price algorithm for the combined vehicle routing and scheduling problem with synchronization constraints
    2007 (English)In: Social Science Research Network, Vol. 7Article in journal (Refereed) Published
    Abstract [en]

    In this paper we present a branch and price algorithm for the combined vehicle routing and scheduling problem with synchronization constraints. The synchronization constraints are used to model situations when two or more customers need simultaneous service. The synchronization constraints impose a temporal dependency between vehicles, and it follows that a classical decomposition of the vehicle routing and scheduling problem is not directly applicable. With our algorithm, we have solved 44 problems to optimality from the 60 problems used for numerical experiments. The algorithm performs time window branching, and the number of subproblem calls is kept low by adjustment of the columns service times.

    Keywords
    Routing, Scheduling, Synchronization, Branch and Price
    National Category
    Mathematics
    Identifiers
    urn:nbn:se:liu:diva-13129 (URN)
    Available from: 2008-04-02 Created: 2008-04-02 Last updated: 2009-04-15
    3. Supply chain optimization in the pulp mill industry: IP models, column generation and novel constraint branches
    Open this publication in new window or tab >>Supply chain optimization in the pulp mill industry: IP models, column generation and novel constraint branches
    Show others...
    2004 (English)In: European Journal of Operational Research, ISSN 0377-2217, Vol. 156, no 1, p. 2-22Article in journal (Refereed) Published
    Abstract [en]

    We study the supply chain problem of a large international pulp producer with five pulp mills located in Scandinavia. The company currently uses manual planning for most of its supply chain, which includes harvesting and transportation of pulp, production scheduling and distribution of products to customers. We have developed two new mixed integer models that determine daily supply chain decisions over a planning horizon of three months. One model is based on column generation, where the generation phase is to find new production plans using a shortest path network. The second, slightly less flexible, has the daily production decisions explicitly included in the model. In order to solve the models within practical time limits we use a flexible approach that aggregates together the less immediate decisions. We also introduce a novel constraint branching heuristic. The models and solution approaches are intended to become an integrated component in the company’s new management system. In tests and comparisons with today’s manual planning, we have found new strategic policies that significantly reduce the company’s supply chain costs.

    Keywords
    Branch and bound, Integer programming, Production, Scheduling, Supply chain management
    National Category
    Mathematics
    Identifiers
    urn:nbn:se:liu:diva-13130 (URN)10.1016/j.ejor.2003.08.001 (DOI)
    Available from: 2008-04-02 Created: 2008-04-02 Last updated: 2013-11-05
    4. Supply chain optimization in pulp distribution using a rolling horizon solution approach
    Open this publication in new window or tab >>Supply chain optimization in pulp distribution using a rolling horizon solution approach
    2006 (English)Report (Other academic)
    Abstract [en]

    In this paper we consider a combined supply chain and ship routing problem for a large pulp producer in Scandinavia. The problem concerns the distribution of pulp to customers, with route scheduling of ships as a central part of modeling. It is an operative planning problem with daily ship routing decisions over a 40 days period. The pulp supply is determined by fixed production plans, and the transport flows and storages are modeled with the requirement to satisfy the demand in a cost-optimal way. We develop a mixed integer programming model with binary variables for route usage of a vessel.

    The problem is solved with a heuristic solution method, based on a rolling time horizon and a standard branch and bound algorithm. We apply the heuristic on problem instances with real world data, and compare results from reduced problem instances with the results from an exact branch and bound search. The computational experiments indicate that real world problems are solvable with the solution method and that it in many cases can be very effcient.

     

    Series
    LiTH-MAT-R ; 2003-25
    Keywords
    Supply chain, Ships, Scheduling, Mixed integer programming
    National Category
    Mathematics
    Identifiers
    urn:nbn:se:liu:diva-13131 (URN)
    Available from: 2008-04-02 Created: 2008-04-02 Last updated: 2013-11-05
    5. A hybrid algorithm for a pulp distribution problem
    Open this publication in new window or tab >>A hybrid algorithm for a pulp distribution problem
    2005 (English)In: IEEE Intelligent Systems, ISSN 1541-1672, Vol. 20, no 4, p. 19-25Article in journal (Refereed) Published
    Abstract [en]

    Distribution is a major factor in the supply chain for Sodra Cell, a leading manufacturer of pulp intended for paper production. Each year, the company transports large quantities of pulp using ships, trains, and trucks; here we focus on scheduling the ships and optimizing deliveries to minimize distribution costs.

    National Category
    Engineering and Technology
    Identifiers
    urn:nbn:se:liu:diva-13132 (URN)10.1109/MIS.2005.59 (DOI)
    Available from: 2008-04-02 Created: 2008-04-02 Last updated: 2015-12-29
  • 2.
    Bredström, David
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Optimization models and methods for production planning and ship scheduling in the pulp industry2003Licentiate thesis, comprehensive summary (Other academic)
    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.

    List of papers
    1. Supply chain optimization in the pulp mill industry: IP models, column generation and novel constraint branches
    Open this publication in new window or tab >>Supply chain optimization in the pulp mill industry: IP models, column generation and novel constraint branches
    Show others...
    2004 (English)In: European Journal of Operational Research, ISSN 0377-2217, Vol. 156, no 1, p. 2-22Article in journal (Refereed) Published
    Abstract [en]

    We study the supply chain problem of a large international pulp producer with five pulp mills located in Scandinavia. The company currently uses manual planning for most of its supply chain, which includes harvesting and transportation of pulp, production scheduling and distribution of products to customers. We have developed two new mixed integer models that determine daily supply chain decisions over a planning horizon of three months. One model is based on column generation, where the generation phase is to find new production plans using a shortest path network. The second, slightly less flexible, has the daily production decisions explicitly included in the model. In order to solve the models within practical time limits we use a flexible approach that aggregates together the less immediate decisions. We also introduce a novel constraint branching heuristic. The models and solution approaches are intended to become an integrated component in the company’s new management system. In tests and comparisons with today’s manual planning, we have found new strategic policies that significantly reduce the company’s supply chain costs.

    Keywords
    Branch and bound, Integer programming, Production, Scheduling, Supply chain management
    National Category
    Mathematics
    Identifiers
    urn:nbn:se:liu:diva-13130 (URN)10.1016/j.ejor.2003.08.001 (DOI)
    Available from: 2008-04-02 Created: 2008-04-02 Last updated: 2013-11-05
    2. Supply chain optimization in pulp distribution using a rolling horizon solution approach
    Open this publication in new window or tab >>Supply chain optimization in pulp distribution using a rolling horizon solution approach
    2006 (English)Report (Other academic)
    Abstract [en]

    In this paper we consider a combined supply chain and ship routing problem for a large pulp producer in Scandinavia. The problem concerns the distribution of pulp to customers, with route scheduling of ships as a central part of modeling. It is an operative planning problem with daily ship routing decisions over a 40 days period. The pulp supply is determined by fixed production plans, and the transport flows and storages are modeled with the requirement to satisfy the demand in a cost-optimal way. We develop a mixed integer programming model with binary variables for route usage of a vessel.

    The problem is solved with a heuristic solution method, based on a rolling time horizon and a standard branch and bound algorithm. We apply the heuristic on problem instances with real world data, and compare results from reduced problem instances with the results from an exact branch and bound search. The computational experiments indicate that real world problems are solvable with the solution method and that it in many cases can be very effcient.

     

    Series
    LiTH-MAT-R ; 2003-25
    Keywords
    Supply chain, Ships, Scheduling, Mixed integer programming
    National Category
    Mathematics
    Identifiers
    urn:nbn:se:liu:diva-13131 (URN)
    Available from: 2008-04-02 Created: 2008-04-02 Last updated: 2013-11-05
    3. A genetic algorithm for a pulp distribution problem
    Open this publication in new window or tab >>A genetic algorithm for a pulp distribution problem
    2003 (English)Report (Other academic)
    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.

    Place, publisher, year, edition, pages
    Linköping: Linköpings universitet, 2003. p. 21
    Series
    LiTH-MAT-R, ISSN 0348-2960 ; 26
    National Category
    Mathematics
    Identifiers
    urn:nbn:se:liu:diva-22364 (URN)1572 (Local ID)1572 (Archive number)1572 (OAI)
    Available from: 2009-10-07 Created: 2009-10-07 Last updated: 2013-11-05
  • 3.
    Bredström, David
    et al.
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Carlsson, Dick
    Södra Cell AB, Växjö, Sweden.
    Lundgren, Jan T.
    Linköping University, Department of Science and Technology. Linköping University, The Institute of Technology.
    Mason, Andrew
    Department of Engineering Science, The University of Auckland, Auckland, New Zealand.
    Rönnqvist, Mikael
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Supply chain optimization in the pulp mill industry: IP models, column generation and novel constraint branches2004In: European Journal of Operational Research, ISSN 0377-2217, Vol. 156, no 1, p. 2-22Article in journal (Refereed)
    Abstract [en]

    We study the supply chain problem of a large international pulp producer with five pulp mills located in Scandinavia. The company currently uses manual planning for most of its supply chain, which includes harvesting and transportation of pulp, production scheduling and distribution of products to customers. We have developed two new mixed integer models that determine daily supply chain decisions over a planning horizon of three months. One model is based on column generation, where the generation phase is to find new production plans using a shortest path network. The second, slightly less flexible, has the daily production decisions explicitly included in the model. In order to solve the models within practical time limits we use a flexible approach that aggregates together the less immediate decisions. We also introduce a novel constraint branching heuristic. The models and solution approaches are intended to become an integrated component in the company’s new management system. In tests and comparisons with today’s manual planning, we have found new strategic policies that significantly reduce the company’s supply chain costs.

  • 4.
    Bredström, David
    et al.
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Rönnqvist, Mikael
    Norwegian School of Economics and Business Administration (NHH), Bergen, Norway.
    A branch and price algorithm for the combined vehicle routing and scheduling problem with synchronization constraints2007In: Social Science Research Network, Vol. 7Article in journal (Refereed)
    Abstract [en]

    In this paper we present a branch and price algorithm for the combined vehicle routing and scheduling problem with synchronization constraints. The synchronization constraints are used to model situations when two or more customers need simultaneous service. The synchronization constraints impose a temporal dependency between vehicles, and it follows that a classical decomposition of the vehicle routing and scheduling problem is not directly applicable. With our algorithm, we have solved 44 problems to optimality from the 60 problems used for numerical experiments. The algorithm performs time window branching, and the number of subproblem calls is kept low by adjustment of the columns service times.

  • 5.
    Bredström, David
    et al.
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Rönnqvist, Mikael
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    A genetic algorithm for a pulp distribution problem2003Report (Other academic)
    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.

  • 6.
    Bredström, David
    et al.
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Rönnqvist, Mikael
    Norwegian School of Economics and Business Administration, Bergen.
    Combined vehicle routing and scheduling with temporal precedence and synchronization constraints2006In: EconPapers, Vol. 18Article in journal (Other academic)
    Abstract [en]

    We present a mathematical programming model for the combined vehicle routing and scheduling problem with time windows and additional temporal constraints. The temporal constraints allow for imposing pairwise synchronization and pairwise temporal precedence between customer visits, independently of the vehicles. We describe some real world problems where the temporal constraints, in the literature, usually are remarkably simplified in the solution process, even though these constraints may significantly improve the solution quality and/or usability. We also propose an optimization based heuristic to solve real size instances. The results of numerical experiments substantiate the importance of the temporal constraints in the solution approach. We also make a computational study by comparing a direct usage of a commercial solver against the proposed heuristic where the latter approach can find high quality solutions within distinct time limits.

  • 7.
    Bredström, David
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
    Rönnqvist, Mikael
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
    Ship routing and scheduling in the pulp mill industry2003In: 18th International Symposium on Mathematical Programming,2003, 2003Conference paper (Other academic)
  • 8.
    Bredström, David
    et al.
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Rönnqvist, Mikael
    Norwegian School of Economics and Business Administration, Bergen.
    Supply chain optimization in pulp distribution using a rolling horizon solution approach2006Report (Other academic)
    Abstract [en]

    In this paper we consider a combined supply chain and ship routing problem for a large pulp producer in Scandinavia. The problem concerns the distribution of pulp to customers, with route scheduling of ships as a central part of modeling. It is an operative planning problem with daily ship routing decisions over a 40 days period. The pulp supply is determined by fixed production plans, and the transport flows and storages are modeled with the requirement to satisfy the demand in a cost-optimal way. We develop a mixed integer programming model with binary variables for route usage of a vessel.

    The problem is solved with a heuristic solution method, based on a rolling time horizon and a standard branch and bound algorithm. We apply the heuristic on problem instances with real world data, and compare results from reduced problem instances with the results from an exact branch and bound search. The computational experiments indicate that real world problems are solvable with the solution method and that it in many cases can be very effcient.

     

  • 9.
    Bredström, David
    et al.
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Rönnqvist, Mikael
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Carlsson, Dick
    A hybrid algorithm for a pulp distribution problem2005In: IEEE Intelligent Systems, ISSN 1541-1672, Vol. 20, no 4, p. 19-25Article in journal (Refereed)
    Abstract [en]

    Distribution is a major factor in the supply chain for Sodra Cell, a leading manufacturer of pulp intended for paper production. Each year, the company transports large quantities of pulp using ships, trains, and trucks; here we focus on scheduling the ships and optimizing deliveries to minimize distribution costs.

1 - 9 of 9
CiteExportLink to result list
Permanent 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