liu.seSearch for publications in DiVA
Change search
Refine search result
1 - 17 of 17
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.
    Dahlberg, Joen
    et al.
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering. The Swedish National Road and Transport Research Institute, Linköping, Sweden.
    Engevall, Stefan
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Göthe-Lundgren, Maud
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Jörnsten, Kurt
    Norwegian School of Economics and Business Administration, Bergen, Norway.
    Rönnqvist, Mikael
    Dpartement de gnie mcanique, Universit Laval, Qubec, Canada.
    Incitements for transportation collaboration by cost allocation2019In: Central European Journal of Operations Research, ISSN 1435-246X, E-ISSN 1613-9178, Vol. 27, no 4, p. 1009-1032Article in journal (Refereed)
    Abstract [en]

    In this paper, we focus on how cost allocation can be used as a means to create incentives for collaboration among companies, with the aim of reducing the total transportation cost. The collaboration is assumed to be preceded by a simultaneous invitation of the companies to collaborate. We make use of concepts from cooperative game theory, including the Shapley value, the Nucleolus and the EPM, and develop specific cost allocation mechanisms aiming to achieve large collaborations among many companies. The cost allocation mechanisms are tested on a case study that involves transportation planning activities. Although the case study is from a specific transportation sector, the findings in this paper can be adapted to collaborations in other types of transportation planning activities. Two of the cost allocation mechanisms ensure that any sequence of companies joining the collaboration represents a complete monotonic path, that is, any sequence of collaborating companies is such that the sequences of allocated costs are non-increasing for all companies.

  • 2.
    Dahlberg, Joen
    et al.
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering. The Swedish National Road and Transport Research Institute, Linköping, Sweden.
    Göthe-Lundgren, Maud
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Engevall, Stefan
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    A note on the nonuniqueness of the Equal Profit Method2017In: Applied Mathematics and Computation, ISSN 0096-3003, E-ISSN 1873-5649, Vol. 308, p. 84-89Article in journal (Refereed)
    Abstract [en]

    When a set of players cooperate, they need to decide how the collective cost should be allocated amongst them. Cooperative game theory provides several methods or solution concepts, that can be used as a tool for cost allocation. In this note, we consider a specific solution concept called the Equal Profit Method (EPM). In some cases, a solution to the EPM is any one of infinitely many solutions. That is, it is not always unique. This leads to a lack of clarity in the characterization of the solutions obtained by the EPM. We present a modified version of the EPM, which unlike its precursor ensures a unique solution. In order to illustrate the differences, we present some numerical examples and comparisons between the two concepts.

  • 3.
    Daneva (Mitradjieva), Maria
    et al.
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Göthe-Lundgren, Maud
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Larsson, Torbjörn
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Patriksson, Michael
    Mathematical Sciences, Chalmers University of Technology and Göteborg University, Gothenburg, Sweden.
    Rydergren, Clas
    Linköping University, Department of Science and Technology. Linköping University, The Institute of Technology.
    A Sequential Linear Programming Algorithm with Multi-dimensional Search: Derivation and Convergence2007Article in journal (Other academic)
    Abstract [en]

    We present a sequential linear programming, SLP, algorithm in which the traditional line-search step is replaced by a multi-dimensional search. The algorithm is based on inner approximations of both the primal and dual spaces, which yields a method which in the primal space combines column and constraint generation. The algorithm does not use a merit function, and the linear programming subproblem of the algorithm differs from the one obtained in traditional methods of this type, in the respect that linearized constraints are taken into account only implicitly in a Lagrangiandual fashion. Convergence to a point that satisfies the Karush-Kuhn-Tucker conditions is established. We apply the new method to a selection of the Hoch-Schittkowski’s nonlinear test problems and report a preliminary computational study in a Matlab environment. Since the proposed algorithmcombines column and constraint generation, it should be advantageous with large numbers of variables and constraints.

  • 4. Engevall, Stefan
    et al.
    Göthe-Lundgren, Maud
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
    Värbrand, Peter
    Linköping University, The Institute of Technology. Linköping University, Department of Science and Technology.
    A strong lower bound for the node weighted Steiner tree problem1998In: Networks, ISSN 0028-3045, E-ISSN 1097-0037, Vol. 31, p. 11-17Article in journal (Refereed)
  • 5.
    Engevall, Stefan
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
    Göthe-Lundgren, Maud
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
    Värbrand, Peter
    Linköping University, The Institute of Technology. Linköping University, Department of Science and Technology.
    The heterogeneous vehicle-routing game2004In: Transportation Science, ISSN 0041-1655, E-ISSN 1526-5447, Vol. 38, no 1, p. 71-85Article in journal (Refereed)
    Abstract [en]

    In this paper, we study a cost-allocation problem that arises in a distribution-planning situation at the Logistics Department at Norsk Hydro Olje AB, Stockholm, Sweden. We consider the routes from one depot during one day. The total distribution cost for these routes is to be divided among the customers that are visited. This cost-allocation problem is formulated as a vehicle-routing game (VRG), allowing the use of vehicles with different capacities. Cost-allocation methods based on different concepts from cooperative game theory, such as the core and the nucleolus, are discussed. A procedure that can be used to investigate whether the core is empty or not is presented, as well as a procedure to compute the nucleolus. Computational results for the Norsk Hydro case are presented and discussed.

  • 6.
    Engevall, Stefan
    et al.
    Linköping University, Department of Mathematics. Linköping University, The Institute of Technology.
    Göthe-Lundgren, Maud
    Linköping University, Department of Mathematics. Linköping University, The Institute of Technology.
    Värbrand, Peter
    Linköping University, Department of Mathematics. Linköping University, The Institute of Technology.
    The traveling salesman game: An application of cost allocation in a gas and oil company1998In: Annals of Operations Research, ISSN 0254-5330, E-ISSN 1572-9338, Vol. 82, p. 203-218Article in journal (Refereed)
    Abstract [en]

    In this article, a cost allocation problem that arises in a distribution planning situation atthe Logistics Department at Norsk Hydro Olje AB is studied. A specific tour is considered,for which the total distribution cost is to be divided among the customers that are visited.This problem is formulated as a traveling salesman game, and cost allocation methods basedon different concepts from cooperative game theory, such as the nucleolus, the Shapleyvalue and the t-value, are discussed. Additionally, a new concept is introduced: the demandnucleolus. Computational results for the Norsk Hydro case are presented and discussed.

  • 7.
    Golbaharan, Nima
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
    Lindberg, Per Olov
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
    Göthe-Lundgren, Maud
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
    Optimal Routing of Snowplows - A Column generation Approach2003In: Operations Research 2002,2002, Heidelberg: Springer , 2003, p. 199-Conference paper (Refereed)
  • 8.
    Göthe-Lundgren, Maud
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
    Frisk, Mikael
    Skogforsk.
    Rönnqvist, Mikael
    Norges handelshögskola.
    Jörnsten, Kurt
    Norges handelshögskola.
    Cost allocation in forestry operations2006In: 12th IFAC Symposium on Information Control Problems in Manufacturing,2006, Paris: Elsevier Science , 2006Conference paper (Refereed)
    Abstract [en]

        

  • 9.
    Göthe-Lundgren, Maud
    et al.
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Lundgren, Jan T.
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    Persson, Jan A.
    Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.
    An optimization model for refinery production scheduling2002In: International Journal of Production Economics, ISSN 0925-5273, E-ISSN 1873-7579, Vol. 78, no 3, p. 255-270Article in journal (Refereed)
    Abstract [en]

    In this paper we describe a production planning and scheduling problem in an oil refinery company. The problem concerns the planning and the utilization of a production process consisting of one distillation unit and two hydro-treatment units. In the process crude oil is transformed to bitumen and naphthenic special oils. The aim of the scheduling is to decide which mode of operation to use in each processing unit at each point in time, in order to satisfy the demand while minimizing the production cost and taking storage capacities into account. The production cost includes costs for changing mode and for holding inventory. We formulate a mixed integer linear programming model for the scheduling problem. The model can be regarded as a generalized lot-sizing problem, where inventory capacities are considered and more than one product is obtained for some modes of operation. A number of modifications and extensions of the model are also discussed. It is shown how the optimization model can be used as a viable tool for supporting production planning and scheduling at the refinery, and that it is possible to analyze scheduling scenarios of realistic sizes. It is also shown that the model can support shipment planning and strategic decisions concerning new products and investments in storage capacity. © 2002 Elsevier Science B.V. All rights reserved.

  • 10.
    Lambrix, Patrick
    et al.
    Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, Faculty of Science & Engineering.
    Göthe Lundgren, Maud
    Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
    Kamkar, Mariam
    Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
    Computer science as an integrated part of engineering education1997In: Proceedings of the ACM SIGCSE/SIGCUE Conference on Integrating Technology into Computer Science Education, 1997, p. 151-Conference paper (Refereed)
  • 11.
    Persson, Jan A.
    et al.
    Blekinge Institute of Technology.
    Göthe-Lundgren, Maud
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
    Shipment planning at oil refineries using column generation and valid inequalities2005In: European Journal of Operational Research, ISSN 0377-2217, E-ISSN 1872-6860, Vol. 163, no 3, p. 631-652Article in journal (Refereed)
    Abstract [en]

    In this paper we suggest an optimization model and a solution method for a shipment planning problem. This problem concerns the simultaneous planning of how to route a fleet of ships and the planning of which products to transport in these ships. The ships are used for moving products from oil refineries to storage depots. There are inventory levels to consider both at the refineries and at the depots. The inventory levels are affected by the process scheduling at the refineries and demand at the depots. The problem is formulated using an optimization model including an aggregated representation of the process scheduling at the refineries. Hence, we integrate the shipment planning and the process scheduling at the refineries. We suggest a solution method based on column generation, valid inequalities, and constraint branching. The solution method is tested on data provided by the Nynas oil refinery company and solutions are obtained within 4 hours, for problem instances of up to 3 refineries, 15 depots, and 4 products when considering a time horizon of 42 days. © 2004 Elsevier B.V. All rights reserved.

  • 12.
    Persson, Jan
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
    Göthe-Lundgren, Maud
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
    Lundgren, Jan
    Linköping University, Department of Science and Technology. Linköping University, The Institute of Technology.
    Gendron, Bernard
    A tabu search heuristic for scheduling the production processes at an oil refinery2004In: International Journal of Production Research, ISSN 0020-7543, E-ISSN 1366-588X, Vol. 42, no 3, p. 445-471Article in journal (Refereed)
    Abstract [en]

    In this paper we present a tabu search heuristic which can be used for scheduling the production at an oil refinery. The scheduling problem is to decide which production modes to use at the different processing units at each point in time. The problem is a type of lot-sizing problem where costs of changeovers, inventories and production are considered. In the suggested tabu search heuristic we explore the use of variable neighbourhood, dynamic penalty and different tabu lists. Computational results are presented for different versions of the heuristic and the results are compared to the best-known lower bound for a set of scheduling scenarios.

  • 13.
    Westerlund, Andreas
    et al.
    Linköping University, Department of Mathematics. Linköping University, The Institute of Technology.
    Göthe-Lundgren, Maud
    Linköping University, Department of Mathematics. Linköping University, The Institute of Technology.
    Larsson, Torbjörn
    Linköping University, Department of Mathematics. Linköping University, The Institute of Technology.
    A column generation scheme for the fixed fleet heterogeneous vehicle routing problem2005Report (Other academic)
    Abstract [en]

    We present an optimizing column generation procedure for solving the vehicle routing problem with a fixed heterogeneous fleet of vehicles; if the method is used in a truncated fashion it turns into a heuristic. The method is based on a new mathematical formulation, which includes a new type of valid inequalities, strengthened by the use of Chvátal-Gomory rounding, and a Lagrangian dualization of this formulation. The dual problem is attacked by subgradient optimization and a near-optimal dual solution obtained is used for enumerating routes that are promising candidates for being used in an optimal solution. These routes are collected in a set partitioning problem, which is finally solved, and an upper bound to the optimal objective value is obtained. The method is evaluated on a set of small-scale test instances. The valid inequalities improves the lower bound significantly: the improvement depends on the ratio between total customer demand and total vehicle capacity. The qualities of the upper bounds varies quite much among the instances.

  • 14.
    Westerlund, Andreas
    et al.
    Linköping University, Department of Mathematics. Linköping University, The Institute of Technology.
    Göthe-Lundgren, Maud
    Linköping University, Department of Mathematics. Linköping University, The Institute of Technology.
    Larsson, Torbjörn
    Linköping University, Department of Mathematics. Linköping University, The Institute of Technology.
    A note on relatives to the Held and Karp 1-tree problem2006In: Operations Research Letters, ISSN 0167-6377, E-ISSN 1872-7468, Vol. 34, no 3, p. 275-282Article in journal (Refereed)
    Abstract [en]

    We study a class of graph problems which includes as special cases the Held and Karp 1-tree problem, and the minimum spanning tree problem with one degree constraint studied by Glover and Klingman. For another special case, we note a mistake in a paper by Ramesh, Yoon and Karwan.

  • 15.
    Westerlund, Andreas
    et al.
    Linköping University, Department of Mathematics. Linköping University, The Institute of Technology.
    Göthe-Lundgren, Maud
    Linköping University, Department of Mathematics. Linköping University, The Institute of Technology.
    Larsson, Torbjörn
    Linköping University, Department of Mathematics. Linköping University, The Institute of Technology.
    A stabilized column generation scheme for the traveling salesman subtour problem2006In: Discrete Applied Mathematics, ISSN 0166-218X, E-ISSN 1872-6771, Vol. 154, no 15, p. 2212-2238Article in journal (Refereed)
    Abstract [en]

    Given an undirected graph with edge costs and both revenues and weights on the vertices, the traveling salesman subtour problem is to find a subtour that includes a depot vertex, satisfies a knapsack constraint on the vertex weights, and that minimizes edge costs minus vertex revenues along the subtour.

    We propose a decomposition scheme for this problem. It is inspired by the classic side-constrained 1-tree formulation of the traveling salesman problem, and uses stabilized column generation for the solution of the linear programming relaxation. Further, this decomposition procedure is combined with the addition of variable upper bound (VUB) constraints, which improves the linear programming bound. Furthermore, we present a heuristic procedure for finding feasible subtours from solutions to the column generation problems. An extensive experimental analysis of the behavior of the computational scheme is presented.

  • 16.
    Westerlund, Andreas
    et al.
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
    Göthe-Lundgren, Maud
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
    Larsson, Torbjörn
    Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
    Mathematical Formulations of the Heterogeneous Fleet Vehicle Routing Problem2003In: ROUTE 2003, International Workshop on Vehicle Routing, Intermodal Transport and related areas,2003, 2003Conference paper (Other academic)
  • 17.
    Westerlund, Andreas
    et al.
    Linköping University, Department of Mathematics. Linköping University, The Institute of Technology.
    Göthe-Lundgren, Maud
    Linköping University, Department of Mathematics. Linköping University, The Institute of Technology.
    Larsson, Torbjörn
    Linköping University, Department of Mathematics. Linköping University, The Institute of Technology.
    Yuan, Di
    Linköping University, Department of Science and Technology. Linköping University, The Institute of Technology.
    Subgradient optimization prior to column generation: a means for predicting optimal columns (and non-binding restrictions)2005Report (Other academic)
    Abstract [en]

    Many classes of combinatorial and mixed integer optimization problems are attacked with decomposition methods. One technique is to perform subgradient optimization on a Lagrangean dual problem: another is to perform column generation on a Dantzig-Wolfe problem, or equivalently, cut generation on its linear programming dual. These techniques both have advantages and disadvantages. In this paper these techniques are combined into a two-phase method, with the purpose of overcoming drawbacks of the techniques.

    The two-phase method consists of a prediction phase and a solution phase. In the prediction phase, subgradient optimization is performed: subgradients found are stored and used as starting columns for the solution phase. (Optionally, non-binding restricitions can be predicted based on information from the prediction phase.) The columns found are used to construct a Dantzig/Wolfe master problem. In the solution phase, column generation is performed if needed. A solid theoretical bases for the two-phase method is presented which includes strong asymptotical results. ln practise, truncated usage must be performed: practical guidelines are given in the paper.

    The two-phase method is tested on two applications: a multicommodity network flow problem and a convexified version of the traveling salesman subtour problem. Two categories of numerical experiments are presented. ln the first category, various aspects of truncated usage of the theory are illustrated. In the second category, the two-phase method is tested on a relatively large number of test problems.

    An overall conclusion of our work is that the two-phase method can perform significantly better, in terms of CPU-times, compared to a (stabilized) Dantzig-Wolfe algorithm. ln general, whenever the subproblems are computationaly inexpensive, compared to the Dantzig-Wolfe master programs, the two-phase method might be an interesting alternative to use instead of pure Dantzig-Wolfe.

1 - 17 of 17
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