Kristian Thun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Kristian Thun has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
Kjetil Fagerholt
4 shared publications- Henrik Andersson
Department of Industrial Economics and Technology Management, Norwegian University of Science and Technology, Trondheim, Norway
3 shared publications Aksel Borgen
2 shared publicationsAnders Bjelland
2 shared publications- Dimitri J. Papageorgiou
Corporate Strategic Research ExxonMobil Research and Engineering Company 1545 Route 22 East 08801 Annandale NJ USA
2 shared publications Magnhild Gjestvang
2 shared publications
Latest Publications
- Open Access
- 14 August 2025
- Published by Elsevier in Maritime Transport Research
- Vol. 9
Maritime inventory routing with an application to fish feed distribution
- 14 August 2025
- Published by Elsevier in Maritime Transport Research
- Vol. 9
Open AccessMaritime inventory routing with an application to fish feed distribution
- Open Access
- 7 January 2023
- Published by Elsevier in SSRN Electronic Journal
Smolt - a Parallel Memetic Matheuristic for Maritime Inventory Routing: Application to Fish Feed Distribution
This paper studies a maritime inventory routing problem (MIRP) faced by fish feed suppliers responsible for distributing different types of fish feed from one or several production facilities to a number of fish farms located at sea with a given heterogeneous fleet of specialized vessels. The feed supplier needs to maintain sufficient inventory levels at the farms at all times while minimizing the distribution costs. We propose a discrete-time mixed-integer programming (MIP) model for the fish feed MIRP. Since a commercial MIP solver can only solve small problem instances, we also propose a novel matheuristic for solving real-life instances. The matheuristic employs a memetic algorithm, a metaheuristic combining a genetic algorithm with local search to decide how to route the vessels, coupled with a linear program for assigning quantities along the vessel routes. We perform a computational study on a number of realistic test instances generated using data from one of Norway’s largest fish feed suppliers. We show that the matheuristic outperforms a commercial MIP solver and can provide valuable decision support. Furthermore, we test the matheuristic on a set of general MIRP benchmark instances from the literature (MIRPLib). Despite not being specifically designed to solve these instances, the results indicate that the matheuristic can obtain high-quality solutions here as well.
- 7 January 2023
- Published by Elsevier in SSRN Electronic Journal
Open AccessSmolt - a Parallel Memetic Matheuristic for Maritime Inventory Routing: Application to Fish Feed Distribution
This paper studies a maritime inventory routing problem (MIRP) faced by fish feed suppliers responsible for distributing different types of fish feed from one or several production facilities to a number of fish farms located at sea with a given heterogeneous fleet of specialized vessels. The feed supplier needs to maintain sufficient inventory levels at the farms at all times while minimizing the distribution costs. We propose a discrete-time mixed-integer programming (MIP) model for the fish feed MIRP. Since a commercial MIP solver can only solve small problem instances, we also propose a novel matheuristic for solving real-life instances. The matheuristic employs a memetic algorithm, a metaheuristic combining a genetic algorithm with local search to decide how to route the vessels, coupled with a linear program for assigning quantities along the vessel routes. We perform a computational study on a number of realistic test instances generated using data from one of Norway’s largest fish feed suppliers. We show that the matheuristic outperforms a commercial MIP solver and can provide valuable decision support. Furthermore, we test the matheuristic on a set of general MIRP benchmark instances from the literature (MIRPLib). Despite not being specifically designed to solve these instances, the results indicate that the matheuristic can obtain high-quality solutions here as well.
- Open Access
- 31 March 2022
- Published by Elsevier in Computers & Operations Research
- Vol. 144
The Fish Feed Production Routing Problem
- 31 March 2022
- Published by Elsevier in Computers & Operations Research
- Vol. 144
Open AccessThe Fish Feed Production Routing Problem
- 20 March 2019
- Published by Wiley in International Transactions in Operational Research
- Vol. 28 (2) , 638-659
A new formulation for the liner shipping network design problem
The liner shipping network design problem (LSNDP) is an important problem within liner shipping because a good network can reduce costs and increase profits. Given sets of ports, vessel classes, and demands between the ports, the problem is to design a network of cyclic routes and assign a vessel class to each route so that all demands can flow through the network at minimal cost. In this paper, we analyze a new formulation of the LSNDP based on a two‐layer network structure. The formulation takes into account the cost of transshipment and allows for complex service structures. Valid inequalities and a novel approach of inner representations of low‐dimensional polyhedra are proposed. A new set of small instances with up to 12 ports has been developed and the formulation has been tested on these instances. Instances with up to 10 ports are solved to optimality, but the largest instances are not, confirming that the LSNDP is a very complex problem. The proposed improvements of the formulation are also shown to have a positive effect.
- 20 March 2019
- Published by Wiley in International Transactions in Operational Research
- Vol. 28 (2) , 638-659
A new formulation for the liner shipping network design problem
The liner shipping network design problem (LSNDP) is an important problem within liner shipping because a good network can reduce costs and increase profits. Given sets of ports, vessel classes, and demands between the ports, the problem is to design a network of cyclic routes and assign a vessel class to each route so that all demands can flow through the network at minimal cost. In this paper, we analyze a new formulation of the LSNDP based on a two‐layer network structure. The formulation takes into account the cost of transshipment and allows for complex service structures. Valid inequalities and a novel approach of inner representations of low‐dimensional polyhedra are proposed. A new set of small instances with up to 12 ports has been developed and the formulation has been tested on these instances. Instances with up to 10 ports are solved to optimality, but the largest instances are not, confirming that the LSNDP is a very complex problem. The proposed improvements of the formulation are also shown to have a positive effect.
- 1 March 2018
- Published by Elsevier in Computers & Operations Research
- Vol. 91, 37-47
A two-phase heuristic for an in-port ship routing problem with tank allocation
- 1 March 2018
- Published by Elsevier in Computers & Operations Research
- Vol. 91, 37-47
A two-phase heuristic for an in-port ship routing problem with tank allocation
- 1 January 2017
- Published by Elsevier in Computers & Operations Research
- Vol. 77, 20-31
A traveling salesman problem with pickups and deliveries, time windows and draft limits: Case study from chemical shipping
- 1 January 2017
- Published by Elsevier in Computers & Operations Research
- Vol. 77, 20-31
A traveling salesman problem with pickups and deliveries, time windows and draft limits: Case study from chemical shipping
- 2 November 2016
- Published by Springer Nature in Flexible Services and Manufacturing Journal
- Vol. 29 (3-4) , 535-552
Analyzing complex service structures in liner shipping network design
- 2 November 2016
- Published by Springer Nature in Flexible Services and Manufacturing Journal
- Vol. 29 (3-4) , 535-552
Analyzing complex service structures in liner shipping network design
- Top Cited Papers
- 1 May 2014
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 48 (2) , 265-280
Containership Routing and Scheduling in Liner Shipping: Overview and Future Research Directions
This paper reviews studies from the past 30 years that use operations research methods to tackle containership routing and scheduling problems at the strategic, tactical, and operational planning levels. These problems are first classified and summarized, with a focus on model formulations, assumptions, and algorithm design. The paper then gives an overview of studies on containership fleet size and mix, alliance strategy, and network design (at the strategic level); frequency determination, fleet deployment, speed optimization, and schedule design (at the tactical level); and container booking and routing and ship rescheduling (at the operational level). The paper further elaborates on the needs of the liner container shipping industry and notes the gap between existing academic studies and industrial practices. Research on containership routing and scheduling lags behind practice, especially in the face of the fast growth of the container shipping industry and the advancement of operations research and computer technology. The purpose of this paper is to stimulate more practically relevant research in this emerging area.
- 1 May 2014
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 48 (2) , 265-280
Top Cited PapersContainership Routing and Scheduling in Liner Shipping: Overview and Future Research Directions
This paper reviews studies from the past 30 years that use operations research methods to tackle containership routing and scheduling problems at the strategic, tactical, and operational planning levels. These problems are first classified and summarized, with a focus on model formulations, assumptions, and algorithm design. The paper then gives an overview of studies on containership fleet size and mix, alliance strategy, and network design (at the strategic level); frequency determination, fleet deployment, speed optimization, and schedule design (at the tactical level); and container booking and routing and ship rescheduling (at the operational level). The paper further elaborates on the needs of the liner container shipping industry and notes the gap between existing academic studies and industrial practices. Research on containership routing and scheduling lags behind practice, especially in the face of the fast growth of the container shipping industry and the advancement of operations research and computer technology. The purpose of this paper is to stimulate more practically relevant research in this emerging area.