Kjetil Fagerholt

Kjetil Fagerholt

Auto-generated profile, based on publicly available information

Kjetil Fagerholt

Department of Industrial Economics and Technology Management, Norwegian University of Science and Technology, Trondheim, Norway

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2004 in Maritime Policy & Management
Verified
Journal Article
Closed access
KFKjetil Fagerholt
Kjetil Fagerholt
A real liner shipping problem of deciding optimal weekly routes for a given fleet of ships is considered and a solution method for solving the problem is proposed. First, all feasible routes for each ship are generated together with the cost and the duration for each route. The routes are given as input to an integer programming (IP) problem. By solving the IP problem, routes for each ship are selected such that total transportation costs are minimized and the demand at each port is satisfied. The total duration for the routes that are selected for a given ship must not exceed one week. The real liner shipping problem is solved together with four randomly generated test problems. The computational results show that proposed solution method is suitable for designing optimal routes in several liner shipping problems.

4 March 2013 in Networks
Verified
Journal Article
Closed access
PDF file
LHLars Magnus Hvattum
Lars Magnus Hvattum
INInge Norstad
Inge Norstad
KFKjetil Fagerholt
Kjetil Fagerholt
GLGilbert Laporte
Gilbert Laporte

16 March 2020 in International Transactions in Operational Research
Verified
Journal Article
Open access
PDF file
AAAbeera Akbar
Abeera Akbar
AAAnna K. A. Aasen
Anna K. A. Aasen
MMMohamed Kais Msakni
Mohamed Kais Msakni
KFKjetil Fagerholt
Kjetil Fagerholt
Elizabeth LindstadElizabeth Lindstad
Elizabeth Lindstad
FMFrank Meisel
Frank Meisel
The development of autonomous ships is at an advanced stage. It seems to be just a question of time before such ships become available at an industrial scale. In this paper, we investigate the economic advantages of utilizing autonomous over conventional ships. We consider a shipping network composed of conventional mother ships and autonomous daughter ships that perform cargo transshipment at specific ports. The mother ships sail between Europe and the Norwegian coastline and are conventional due to international regulations. The daughter ships serve small ports located along the Norwegian coastline and are autonomous. We apply this concept of mother and daughter routes to a Norwegian shipping company that transports containers between a continental European port and 21 ports scattered along the Norwegian coastline. Furthermore, we extend this case to a shipping network of 42 ports to study a possible increase in the activity of the company. For solving the corresponding optimization problem, we present a path‐flow‐based model formulation and a heuristic route generation method. We carry out extensive computational experiments that consider differently sized problems, various demand scenarios, advanced routes structures, and sensitivity analyses for cost rates and the degree of automation of the maritime transport system. The results provide evidence that autonomous ships might contribute to considerable cost savings.

24 January 2020 in International Journal of Production Research
Verified
Journal Article
Open access
EBElisabeth Brevik
Elisabeth Brevik
ALAnna Ø. Lauen
Anna Ø. Lauen
MRMaria C. B. Rolke
Maria C. B. Rolke
KFKjetil Fagerholt
Kjetil Fagerholt
JHJone R. Hansen
Jone R. Hansen
In this paper, we propose a mixed integer programming (MIP) model for the Chicken Flock Sizing, Allocation and Scheduling Problem (CFSASP), which is an important planning problem in the broiler production supply chain. To solve the CFSASP efficiently, two variants of rolling horizon heuristics (RHHs) have been developed and applied on the case of a Norwegian broiler production company. Computational results show that the RHHs successfully obtain high-quality solutions within a reasonable time. The value of optimisation is verified through comparison with the case company's plans, where the solutions from optimisation outperforms the current solutions. Sensitivity analyses are also conducted to provide managerial insights regarding certain strategic decisions, such as how many and which days to use for hatching of chickens. Due to the promising results, the case company is now implementing an optimisation-based decision support system based on the MIP model and solution methods shown in this paper.

1 September 1999 in International Transactions in Operational Research
Verified
Journal Article
Closed access
PDF file
KFK. Fagerholt
K. Fagerholt

5 November 2022 in Flexible Services and Manufacturing Journal
Verified
Journal Article
Open access
PDF file
MLMingyu Li
Mingyu Li
KFKjetil Fagerholt
Kjetil Fagerholt
PSPeter Schütz
Peter Schütz
The LNG-ADP problem is a tactical planning problem for creating an annual delivery program (ADP) for a liquefied natural gas (LNG) producer. An ADP specifies the departure dates of the LNG carriers as well as the delivery dates at the different customers for a period of 12–18 months. The problem can be formulated as maritime inventory routing problem, as it is an important requirement to plan the deliveries such that inventory levels are kept within minimum and maximum limits at the customers as well as the LNG production facility. Inspired by the case of Yamal LNG, we propose a novel discrete-time formulation for the LNG-ADP problem with transshipment and intermediate storage. Our formulation also allows for waiting at the unloading ports. The problem is solved using a rolling horizon heuristic (RHH) for a case based on the Yamal LNG project. We study the impact of different RHH configurations on run time and solution quality. The results show that using a central period that is shorter than the forecast period provides the best objective function, whereas a central period that is longer than the forecast period improves run time. We also explore the effect of allowing waiting at the unloading ports. Waiting does not necessarily improve the objective function value, despite increasing the solution space. However, we observe a reduction in run time for instances where waiting is allowed.