-
Kovalenko, Alina; Skriabin, Anton; Strukov, Mikhail & Gribkovskaia, Irina
(2023).
Simulation modelling of transit container ship transportation with transhipment hubs via the Northeast Passage.
-
Gribkovskaia, Irina
(2022).
Multidisciplinary Norwegian-Belarusian two-diploma MSc program in Logistics Analytics: Eurasia programme project CPEA-2015/10061 (2016-2022).
-
Gribkovskaia, Irina & Redutskiy, Yury
(2022).
Presentation of Norwegian-Russian collaboration project UTF-10023 Arctic Logistics .
-
Abu-Marrul, Victor; Martinelli, Rafael; Hamacher, Silvio & Gribkovskaia, Irina
(2022).
A simulation-optimization approach for a complex parallel machine scheduling problem.
-
Kovalenko, Alina; Gribkovskaia, Irina; Skriabin, Anton & Strukov, Mikhail
(2022).
Fleet sizing for ice-capable container vessels used for the transit traffic between transhipment hubs on the Northeast Passage.
-
Gribkovskaia, Irina
(2021).
Norwegian-Russian collaboration project UTF-10023 Arctic Logistics: Report and Plan for 2021.
-
Igor, Girao Peres Vianna; Ribas, Paulo Cesar; Gribkovskaia, Irina & Ferreira Filho, Virgilio Jose Martins
(2021).
Multi-objective optimization approach for operational supply vessel planning.
-
Gribkovskaia, Irina; Stsefanovich, Kanstantsin & Pishchalava, Ahata
(2021).
Horizontal cooperation in periodic vehicle routing and periodic supply vessel planning.
-
Skriabin, Anton; Kovalenko, Alina & Gribkovskaia, Irina
(2021).
Simulation models for fleet sizing and cargo throughput analysis in Arctic shipping.
-
Gribkovskaia, Irina
(2020).
Norwegian-Russian collaboration project UTF-10023 Arctic Logistics: Presentation.
-
Kovalenko, Alina & Gribkovskaia, Irina
(2020).
The analyses of infrastructure and transit cargoes through Arctic region.
-
-
Kisialiou, Yauheni & Gribkovskaia, Irina
(2017).
Heuristic based approach for generation of cost-effective and robust supply vessel schedules.
Show summary
In this work, we address the problem of supply vessel planning that arises in the upstream
offshore oil and gas logistics. Supply vessels deliver all the necessary materials
and equipment to offshore installations from an onshore supply base. Delivery takes
place according to a weekly sailing plan (delivery schedule). Charter cost of supply
vessels is the largest cost contributor in the upstream offshore supply. Therefore,
planning of supply vessels should be done so that their number is minimized and in
the same time providing reliable ow of supplies from the base not allowing for the
downtime at installations. Execution of weekly sailing plan is affected by weather
conditions, especially in the wintertime. Harsh weather conditions increase vessels
sailing and service time at installations and thus disrupt the schedule that leads to
additional costs and reduced service level. We present a developed heuristic-based
approach incorporating post-optimization simulation procedure enabling to create
cost-effective and robust vessel schedules valid for a certain season, which enhances
the possibility of generating schedules for the real large-size problem instances with
the preferred trade-offs between robustness and vessel costs.
-
Maisiuk, Yauhen & Gribkovskaia, Irina
(2017).
Evaluation of methods for construction of robust supply vessel schedules with discrete-event simulation.
Show summary
Supply vessel planning problem arises in offshore oil and gas logistics, where a fleet of vessels provides cargo deliveries to offshore installations on a periodic basis from an onshore supply base. The objective is to define an optimal fleet composition and a least-cost weekly sailing plan of scheduled vessels' voyages. The problem is defined as a fleet-sizing and periodic routing problem with multiple time windows at installations and voyage duration constraints. Weather conditions change dynamically and may significantly influence vessels' sailing and service times, resulting in sailing plan infeasibility. The planners need vessel plans with sufficient robustness to offset the impact of weather conditions and avoid use of additional vessels. Known approaches for construction of robust vessel schedules consist of generation of shortest duration voyages and solution of a set covering model. In some approaches, voyage slacks are incorporated during voyage generation phase based on planners' experience. In other approaches, shortest generated voyages are simulated over multiple replications of wave height evolution to compute voyage robustness measure or to assign voyage duration. In this study, we evaluate robustness of vessel schedules constructed by different robustness approaches with the developed discrete-event simulation model. It simulates weekly sailing schedules repetitively over seasonal horizon over multiple replications of weather scenarios. Multi-site multivariate seasonal sea state modeling is based on nonparametric numerical resampling and intra-day hind-cast metocean data. Experiments are conducted on real-based instances from an oil and gas company. We examine the impact of various instance characteristics on robustness of weekly sailing schedules.
-
-
Gribkovskaia, Irina; Norlund, Ellen Karoline & Maisiuk, Yauhen
(2014).
Routing and fleet sizing for offshore supply vessels.
-
-
Gribkovskaia, Irina; Norlund, Ellen Karoline & Maisiuk, Yauhen
(2014).
Routing and fleet sizing for offshore supply vessels.
In ., . (Eds.),
ROUTE 2014 : International Workshop on Vehicle Routing, Intermodal Transport and Related Areas : June 1-4, 2014.
Technical University of Denmark.
-
-
-
Norlund, Ellen Karoline & Gribkovskaia, Irina
(2014).
Modal split in offshore upstream supply chain under the objective of emissions minimization.
Show summary
We assess modal split in the offshore upstream supply chain of cargo
from vendors to supply bases along the Norwegian coast under the
objective of emissions minimization. To gain insight into drivers for
modal split between road and sea transport from the shipper’s perspective
a multi-period mixed integer optimization model is formulated.
The model is used to study how different demands, inventory policies
at bases and shipper commitments to sea transport affect modal split.
The results show that commitments and inventories are major drivers
towards environmental friendly sea transport.
-
Kisialiou, Yauheni; Shcherbanin, Yury & Gribkovskaia, Irina
(2014).
Analysis of logistics capabilities for gas transportation in the Arctic.
Show summary
Exploration of hydrocarbons reserves in the Arctic requires development
of logistics capacities and transport infrastructure. Effect of the
global warming and year-around navigation on the Northern Sea Route
facilitate downstream transportation of gas extracted in the Arctic via
the route to Asia-Pacific markets. Using simulation model we study
the implications of the ice breaking fleet availability, climate conditions
and regulations for navigation on the route throughput. Simulation
is performed for several scenarios of LNG transportation between
different ports by different LNG carriers.
-
Gribkovskaia, Irina & Norlund, Ellen Karoline
(2014).
Robust supply vessel planning with speed optimization.
Show summary
The oil and gas industry needs reliable transport of cargo between onshore
bases and offshore installations. Weather uncertainty and sailing
speed should be taken into account in supply vessel planning. To address
the problem of generating robust and green supply vessel schedules
a method combining discrete-event simulation with speed optimization
algorithms for voyage generation and applying stochastic optimization
for schedule construction is developed. Results of tests on
real instances show increased robustness and reduced emissions compared
to deterministic planning with constant speed.
-
Hubin, Aliaksandr; Norlund, Ellen Karoline & Gribkovskaia, Irina
(2014).
Evaluating robustness of speed optimized supply vessel schedules.
Show summary
Offshore installations need supply vessel services on a regular basis.
Weather uncertainty impacts on how service is performed. We incorporate
different robustness and speed optimization strategies into
the two-phase optimization procedure for generation of supply vessel
schedules. To compare performance of these strategies by evaluating
robustness of generated schedules with different service parameters a
discrete-event simulation model is developed. Based on results from
simulation strategies for improving robustness incorporated into the
simulation model are applied to modify the schedules.
-
Maisiuk, Yauhen & Gribkovskaia, Irina
(2014).
Modelling of supply vessel operations with simulation.
Show summary
Supply vessel schedules are generated according to service requirements
of offshore installations characterized by cargo demand and
weekly visit frequency. Stochastic factors such as weather uncertainty
influence on the execution of schedules so that some visits are not performed.
We consider several strategies how the cargo not delivered
as planned may be shipped later. To compare the strategies and analyze
their performance a discrete-event simulation model is developed.
Tests on real data illustrate how application of these strategies for annual
horizon reduces the number of delayed visits.
-
-
Maisiuk, Yauhen & Gribkovskaia, Irina
(2013).
Fleet sizing for offshore supply vessels.
Show summary
Supply vessels provide offshore installations with necessary supplies on periodic basis from an onshore base according to weekly sailing plans. Each plan is built for
a certain time horizon to guarantee required level of service to offshore installations at least cost. In a sailing plan several voyages are assigned to each vessel. The execution of sailing plans is affected by stochastic weather conditions. A vessel may not perform all visits within the planned voyage duration because of bad weather influencing vessel's sailing and service time. In such cases, additional vessels may be needed. Deciding on the number of supply vessels to hire on the long-term basis
is an important part of the strategic fleet size planning. We present a discrete-event simulation model that evaluates alternative fleet size configurations of vessel fleet size for an annual time horizon. Keywords: Fleet Sizing, Routing, Simulation.
-
Gribkovskaia, Irina; Halskau sr, Øyvind & Qian, Fubin
(2012).
On routing and risk minimization in offshore helicopter transportation.
Show summary
Helicopters are often used for transporting crews to and from offshore
installations. Helicopter transportation is regarded as one of the main
risks in the offshore industry and the oil companies want to minimize
this risk. We show how the expected number of fatalities can be reduced
by applying different routing strategies. We present trade-offs
between the number of helicopters used and the expected risk using
real data from the Norwegian offshore industry.
-
Norlund, Ellen Karoline & Gribkovskaia, Irina
(2012).
Reducing emissions in offshore supply vessel planning by speed optimization.
Show summary
Supply vessel activities, being crucial for the offshore oil and gas production, are the main source of emissions in the upstream offshore supply chain. The primary way to decrease emissions from vessels is by fuel consumption reduction. We address how to reduce fuel consumption in supply vessel activities by considering speed optimization when creating supply vessel schedules. The algorithm used for determining fleet mix and generating vessel schedules for a given time horizon consists of pre-generation of feasible voyages and packing them into vessel schedules using a set partitioning optimization model where the sum of the total vessel charter cost and the fuel cost is minimized. We propose four speed optimization strategies and show how to combine the supply vessel planning algorithm with these strategies to reduce emissions. In the first strategy, the basic solution is first found with the design vessel speed. Then, we iteratively run the algorithm with decreased speed until it generates a solution with increased fleet size, and choose the solution yielding the maximum reduction in fuel consumption compared with the basic solution. The three other strategies are speed optimization algorithms determining speed on voyage legs during voyage generation phase. One is reducing speed on a voyage leg if it is possible without violating voyage arrival times. Another is utilizing the total voyage idle time to determine the speed for each leg by rescheduling arrival times. The last is a recursive algorithm determining speed on each leg utilizing service time windows. Results of computational tests on real instances show that fuel consumption reduction can be achieved through utilization of waiting time for service and slacks in vessel schedules. The best strategy, yielding between 17% and 25% reduction in fuel consumption without an increase in the fleet size, is to optimize speed on each sailing leg.
-
Qian, Fubin; Gribkovskaia, Irina; Laporte, Gilbert & Halskau sr, Øyvind
(2012).
Passenger and pilot risk minimization in offshore helicopter transportation.
Show summary
In the offshore petroleum industry, employees are transported to and from offshore installations by helicopter, which represents a major risk. We analyze how to improve transportation safety by solving the helicopter routing problem with a risk objective expressed in terms of expected number of fatalities. A mathematical model is proposed and a tabu search heuristic is applied to this problem. Three routing policies are considered: a direct routing policy, a Hamiltonian routing policy, and a general routing policy. Extensive computational experiments are conducted on instances derived from real data in order to assess and compare these policies under a travel time, a passenger risk and a combined passenger and pilot risk objective. Several management insights can be derived from this study. In particular, our results show that passenger transportation risk can be reduced by increasing travel time at the expense of pilot risk. This can be achieved through a reduction of the average number of passengers onboard by applying either a Hamiltonian or a general routing policy. Our methodology can also be used to derive an equitable distribution of risk between passengers and pilots, considering that pilots fly much more frequently than passengers. Furthermore, the helicopter routing problem is addressed as a multi-objective optimization problem. Two scenarios are considered for the cost objective. The cost objective may contain only travel time, or it is a combined travel time and service time. We apply a multi-objective genetic algorithm and an epsilon-constraint approach based on tabu search to instances derived from real data. Computational results show that the generic algorithm is capable of generating a large number of high quality solutions within reasonable times for the multi-objective helicopter routing problem. As compared to the genetic algorithm, the epsilon-constraint approach generates a small number of better quality solutions and requires more computing time.
-
Norlund, Ellen Karoline & Gribkovskaia, Irina
(2012).
Speed strategies for green supply vessel planning.
Show summary
We study how to reduce emissions in supply vessel activities through
speed optimization when planning vessel schedules by solving a MIP
model for a pre-generated set of voyages. Several speed strategies, determining
speed for the entire voyage or optimizing speed for each voyage
leg, are proposed. These strategies are applied either a priori during
voyage generation or a posterior to the voyages in the constructed schedule. Results of tests on several real-life instances show that emissions
can be significantly reduced when using speed optimization in
supply vessel planning.
-
Sopot, Eugen; Gribkovskaia, Irina & Laporte, Gilbert
(2012).
Routing of supply vessels to offshore installations with deliveries and pickups of multiple commodities.
Show summary
Offshore installations are dependent on periodic deliveries of various
goods from an onshore supply base and continuously generate pickup
demands. We consider the problem of routing supply vessels to offshore
installations as a multi-commodity vehicle routing problem with
pickups and deliveries. To guarantee the existence of a feasible solution
to the problem it is assumed that each installation may be visited
once or twice. We propose a variable neighborhood search heuristic
algorithm for the single vessel variant of this problem.
-
Maisiuk, Yauhen & Gribkovskaia, Irina
(2012).
A simulation study of the fleet sizing problem for offshore supply vessels.
Show summary
The supply vessels provide offshore installations with supplies from
an onshore base according to weekly sailing plans. The goal is to decide
the cost-optimal fleet of vessels on the long-term hire. The problem
is stochastic as sailing speed and service time depend on uncertain
weather conditions. Due to delays some installations may not be
served within the planned route duration, and not received supplies
have to be delivered later. We propose a discrete-event simulation
model which evaluates alternative fleet size configurations depending
on several strategies of later delivery of supplies.
-
-
-
Qian, Fubin; Gribkovskaia, Irina; Laporte, Gilbert & Halskau sr, Øyvind
(2011).
Passenger and pilot risk minimization in offshore helicopter transportation.
Show summary
In the offshore petroleum industry, employees are transported to and from the
offshore installations by helicopter, which represents a major risk. This paper
analyzes how to improve transportation safety by solving the helicopter routing
problem with an objective expressed in terms of expected number of fatalities.
A mathematical model is proposed and a tabu search heuristic is applied to
this problem. Three routing policies are considered: a direct service policy, a
Hamiltonian solution policy, and a general solution policy.Extensive computational experiments are conducted.
-
Qian, Fubin; Gribkovskaia, Irina; Laporte, Gilbert & Halskau sr, Øyvind
(2011).
Improving transportation safety for passenger and pilot in offshore helicopter routing.
Show summary
In the offshore petroleum industry, employees are transported back and forth to the offshore installations by helicopter, which represents a major risk. A mathematical model and a tabu search heuristic are proposed to improve transportation safety by minimizing risk for passengers and pilots in terms of the expected number of fatalities in helicopter transportation. Three routing policies are implemented and compared: a direct service policy, a Hamiltonian solution policy, and a general solution policy. Computational results show that transportation risk can be reduced by using some extra flying hours, compared to the classical solutions which only consider total travel time under a Hamiltonian solution policy. Under general solution policy, low risk solutions for both passengers and pilots are obtained when minimizing the total risk. We also attempt to achieve equitable distribution of risk between passengers and pilots considering that pilots fly much more frequently than passengers.
-
Qian, Fubin; Gribkovskaia, Irina; Laporte, Gilbert & Halskau, Øyvind
(2010).
A tabu search heuristic for offshore helicopter routing problem with focus on passenger safety.
Show summary
A mathematical model is proposed to improve passenger transportation safety by minimizing the expected number of fatalities in offshore helicopter transportation. Tabu search heuristics are developed. Both the mathematical model and heuristics are capable of producing general solutions, namely solutions allowing a second visit to installations. Computational results show that safety performance can be significantly improved by introducing general solution strategy to helicopter routing problem.
-
Qian, Fubin; Gribkovskaia, Irina & Halskau, Øyvind
(2010).
Helicopter routing in the Norwegian oil industry : including safety concerns for passenger transport.
Show summary
PURPOSE: In the Norwegian offshore oil industry, helicopters have been used as a major mode of transporting personnel to and from offshore installations for decades. Helicopter transportation represents one of the major risks for offshore employees. The purpose of this paper is to study the safety of helicopter transportation in terms of the expected number of fatalities on operational planning level. METHOD: Based on an analysis of helicopter accidents, this paper proposes a mathematical model that can aid the planning of routes for the fleet in order to minimize the expected number of fatalities. FINDINGS: A theorem proven in this paper tells that hub-and-spoke configuration is the best way of flying helicopter in terms of minimizing expected number of fatalities. Computational results indicate the expected number of fatilities may be reduced at the expence of longer travel time by implementing the proposed method into route planning for the helicopter fleet. LIMITATIONS: The main limitation is the present inability to solve large instances. IMPLICATIONS: The suggested procedure is able to provide the decision-makers with a set of solutions from which they can choose the best trade-off between travel time and transportation safety. VALUE: The mathematical model and theoretical results for route planning with a safety-based objective are original.
-
Shyshou, Aliaksandr; Fagerholt, Kjetil; Gribkovskaia, Irina & Laporte, Gilbert
(2010).
A large neighbourhood search heuristic for a periodic supply vessel planning problem arising in offshore oil and gas operations.
Show summary
Upstream logistics in the Norwegian oil industry includes, along with other activities, providing the offshore
installations with necessary supplies. These are periodically delivered to the installations by supply vessels
from onshore bases. This paper proposes a large neighbourhood heuristic for a real-world periodic supply vessel
planning problem faced by StatoilHydro, the largest Norwegian offshore oil and gas operator. However, the
model and the algorithm provided in the paper are of wide applicability. The problem calls for the simultaneous
determination of a repetitive weekly sailing plan and of the configuration of the supply vessel
fleet. Computational
comparisons with an exact solution method results demonstrate the competitiveness of the heuristic.
-
Shyshou, Aliaksandr; Gribkovskaia, Irina; Fagerholt, Kjetil & Laporte, Gilbert
(2010).
Heuristic solution method for a supply vessel planning problem arising in offshore oil and gas operations.
-
Gribkovskaia, Irina & Shyshou, Aliaksandr
(2009).
A simulation study of the fleet sizing problem arising in offshore anchor handling operations.
-
Shyshou, Aliaksandr; Gribkovskaia, Irina & Barceló, Jaume
(2009).
A simulation model for the fleet sizing problem arising in offshore anchor handling operations.
In ., Ukjent (Eds.),
Abctract CD of OYSSEUS Workshop 2009 International Workshop on Freight Transportation and Logistics, Çesme, Turkey, 2009-05-26 - 2009-05-29.
ODYSSEUS.
-
Shyshou, Aliaksandr; Gribkovskaia, Irina & Barceló, Jaume
(2009).
A simulation model for the fleet sizing problem arising in offshore anchor handling operations.
-
Shyshou, Aliaksandr; Gribkovskaia, Irina & Barceló, Jaume
(2009).
Offshore anchor handling operations : a simulation analysis of different vessel fleet configurations.
In ukjent, . (Eds.),
Program and Abstracts of Optimization Days 2009, GERAD - HEC Montréal, Canada, 2009-05-04 - 2009-05-06.
GERAD Group for Research in Decision Analysis - HEC Montréal.
Show summary
We present a fleet sizing problem arising in anchor handling operations related to movement of offshore mobile units. The operations are performed by dedicated vessels, which can be hired either on the long-term or spot basis. We propose a simulation-based approach to decide the cost-optimal fleet of vessels on the long-term hire to cover future operations.
-
Shyshou, Aliaksandr; Gribkovskaia, Irina & Barceló, Jaume
(2009).
Offshore anchor handling operations : a simulation analysis of different vessel fleet configurations.
Show summary
We present a fleet sizing problem arising in anchor handling operations related to movement of offshore mobile units. The operations are performed by dedicated vessels, which can be hired either on the long-term or spot basis. We propose a simulation-based approach to decide the cost-optimal fleet of vessels on the long-term hire to cover future operations.
-
Gribkovskaia, Irina & Laporte, Gilbert
(2008).
Solving a family of pickup and delivery vehicle routing problems arising in reverse logistics and the supply of oil and gas platforms.
-
Gribkovskaia, Irina & Laporte, Gilbert
(2008).
Solving a family of pickup and delivery vehicle routing problems arising in reverse logistics and the supply of oil and gas platforms,
ECCO XXI - Dubrovnik, Croatia, May 29-31. 2008 : Conference Proceedings.
Croatian Operational Research Society (HDOI).
p. 38–39.
Show summary
In one-to-many-to-one pickup and delivery single vhicle routing problems, a capacitated vehicle performs deliveries from a depot to a set of customers and also performs pickups as the same customers before returning to the depot. Several variants of the problem are considered, namely the general case, the case where customers have a limited capacity, the case where pickups are selective, the case where constraints are imposed on the lag time or sequencing order between the pickup and delivery visits at the same customer location, and the case where there are multiple commodities and time windows. Some of these variants have interesting applications in the supply of offshore oil and gas platforms and in reverse logistic. Formulating these problems as integer linear programs and solving them them by a generic solver, such as CPLEX, enables the solution of only relatively small instances. It is however possible to solve all these variants by means of a unified tabu search heuristic. In some cases, one can prove that the percentage optimally gap can be quite small. In addition, one can show that it can sometimes be advantageous to perform two separate visits at the same customer location, one for the pickup and one for the delivery, rather than performing these two operations simultaneously.
-
Bakhrankova, Krystsina; Gribkovskaia, Irina & Haugen, Kjetil Kåre
(2007).
Production planning in continuous process industries.
In Ukjent, Ukjent (Eds.),
Proceedings of the 19th Annual Conference for Nordic Researchers in Logistics, NOFOMA 2007 / Halldórsson, Á., Stefánsson, G. (Eds.) (CD-ROM).
The Nordic Logistics Research Network; NOFOMA.
p. 69–84.
Show summary
Production planning is at the core of manufacturing flow management - one of the key supply network business processes. A significant theoretical basis related to production planning for different manufacturing processes has been established in the extant literature, The classic product-process matrix has been put forward to match the product-process matrix has been put forward to match the product features with the process characteristics, distinguishing between the four types: jumbeled, disconnected line, connected line, and continuous flows. The last process type corresponds to continuous process industries that are least researched with respect to specific optimization issues. This disbalance has developed due to traditional contrasting of discrete and continuous environments without a proper differentiation between distinct process industries. In this paper we consider conceptual and optimization issues related to production planning in continuous process industries with nondiscrete products. The purpose of this paper is to locate continuous nondiscrete production within existing theoretical frameworks, discuss general features of continuous process industries and clarify their core production planning characteristics, contrasting them with other manufacturing process types. In particular, we consider a concrete example of a coninuous nondiscrete manufacturing environment to further refine its features and discuss known formalization methods applied to production planning for similar settings, assessing their potential use for the system in question. Finally, we develop a mathematical optimization model for the incumbent production system allowing a better utilization of production capacity with respect to energy costs while synchronizing production and distribution planning in the holistic supply network context.
-
Gribkovskaia, Irina
(2007).
Single vehicle pickup and delivery problem with capacitated customers.
Show summary
The single vehicle pickup and delivery problem with capacitated customers is encountered in servicing of offshore oil and gas platforms. A single vessel must perform pickups and deliveries at several offshore platforms where all delivery demands originate at a supply base and all pickup demands are also destined to the base. The vessel capacity may never be exceeded along its route. In addition, the amount of space available for loading and unloading operations is limited at each platform. The problem consists of designing a least cost vehicle (vessel) route starting and ending at the depot (base), visiting each customer (platform) making all pickups and deliveries, and such that there is always sufficient capacity in the vehicle and at the customer location to perform the pickup and delivery operation. We present a mathematical model as well as several construction heuristics and a tabu search algorithm yielding general where any customer can be visited either once or twice.
-
Gribkovskaia, Irina
(2007).
Single vehicle pickup and delivery problem with capacitated customers,
Sixth International Colloquium on Graphs and Optimization : Abstract Booklet.
Schweizerische Vereinigung für Operations Research.
Show summary
The single vehicle pickup and delivery problem with capacitated customers is encountered in servicing of offshore oil and gas platforms. A single vessel must perform pickups and deliveries at several offshore platforms where all delivery demands originate at a supply base and all pickup demands are also destined to the base. The vessel capacity may never be exceeded along its route. In addition, the amount of space available for loading and unloading operations is limited at each platform. The problem consists of designing a least cost vehicle (vessel) route starting and ending at the depot (base), visiting each customer (platform) making all pickups and deliveries, and such that there is always sufficient capacity in the vehicle and at the customer location to perform the pickup and delivery operation. We present a mathematical model as well as several construction heuristics and a tabu search algorithm yielding general where any customer can be visited either once or twice.
-
Gribkovskaia, Irina
(2007).
Single vehicle pickup and delivery problem with capacitated customers [ppt].
Show summary
We introduce a pickup and delivery problem encountered in the servicing of offshore oil and gas platforms in the Norwegian Sea. A single vessel must perform pickups and deliveries at several offshore platforms. All delivery demands originate at a supply base and all pickup demands are also destined to the base. The vessel capacity may never be exceeded along its route. In addition, the amount of space available for loading and unloading operations is limited at each platform. The problem, called the Single Vehicle Pickup and Delivery Problem with Capacitated Customers (SVPDPCC) consists of designing a least cost vehicle (vessel) route starting and ending at the depot (base), visiting each customer (platform), and such that there is always sufficient capacity in the vehicle and at the customer location to perform the pickup and delivery operations. A mixed integer linear programming model yielding general solutions allowing for up to two visits at customers is proposed, and the impact of the new stipulations on the solutions is analyzed. We have developed several construction heuristics as well as a tabu search algorithm. Our best heuristic consists of applying tabu search starting with an initial solution generated with construction heuristic which combines nearest neighbour, cheapest insertion and backward merging procedures. The solutions produced by our algorithm may be Hamiltonian or not, depending partly on vertex demands and relative locations.
-
Bakhrankova, Krystsina; Gribkovskaia, Irina & Haugen, Kjetil Kåre
(2007).
Production planning in continuous process industries.
Show summary
Production planning is at the core of manufacturing flow management - one of the key supply network business processes. A significant theoretical basis related to production planning for different manufacturing processes has been established in the extant literature. The classic product-process matrix has been put forward to match the product features with the process characteristics, distinguishing between the four process types: jumbles, disconnected line, connected line, and continuous flows. The last process type corresponds to continuous process industries that are least researched with respect to specific optimization issues. This disbalance has developed due to traditional contrasting of discrete and continuous environments without a proper differentiation between distinct process industries. In this paper we concider conceptual and optimization issues related to production planning incontinuous process industries with nondiscrete products. The purpose of this paper is to locate continuous nondiscrete production within existing theoretical frameworks, discuss general features of continuous process industries and clarify their core production planning characteristics, contrasting them with other manufacturing process types. In particular, we consider a concrete example of a continuous nondiscrete manufacturing environment to further refine its features and discuss known formalization methods applied to production planning for similar settings, assessing their potential use for the system in question. Finally, we develop a mathematical optimization model for the incumbent production system allowing a better utilization of production capacity with respect to energy costs while synchronizing production and distribution planning in the holistic supply network context
-
Gribkovskaia, Irina
(2007).
Routing of supply vessels to offshore oil and gas platforms.
-
Gribkovskaia, Irina; Laporte, Gilbert & Shyshou, Aliaksandr
(2007).
The single vehicle routing problem with deliveries and selective pickups.
Show summary
The Single Vehicle Routing Problem with Deliveries and Selective Pickups (SVRPDSP) is defined on a graph in which n pickup and delivery demands are associated with customer vertices. In the SVRPDSP, all deliveries must be performed, but pickups are optional. The pickup demand of a customer is either fully collected, in which case it generates a revenue, or it is not collected at all. In other words, partial pickups are not allowed. The SVRPDSP consists of designing a vehicle route containing the depot and all customers, satisfying the following conditions: 1) all deliveries are performed; 2) some pickups may be performed. This definition does not specify the number of visits made at each customer. If no pickup is made, or if the pickup and the delivery are performed during the same visit, the number of visits is one, and it is two otherwise. The SVRPDSP is NP-hard since it reduces to the Traveling Salesman Problem (TSP) if none of the customers has a pickup demand and the vehicle capacity is sufficient to accommodate all the delivery demands. In the SVRPDSP a pickup revenue is associated with each vertex, and the pickup demand at that vertex will be collected only if it is profitable to do so. The net cost of a route is equal to the sum of routing costs, minus the total collected revenue. The aim is to design a vehicle route of minimum net cost, visiting each customer, performing all deliveries, and a subset of the pickups. Applications of this problem arise in reverse logistics. A mixed integer linear programming formulation, including lifted inequalities, is proposed for the SVRPDSP. Classical construction and improvement heuristics, as well as a tabu search heuristic, are developed and tested on a group of instances (with n ranging from 16 to 101) derived from VRPLIB. Extensive computational results show that the solutions produced by the proposed heuristics are near-optimal. There is also some evidence that the best solutions identified by the heuristics are frequently non-Hamiltonian and may contain one or two customers visited twice.
-
Gribkovskaia, Irina & Laporte, Gilbert
(2007).
Solving a family of single vehicle pickup and delivery problems by tabu search.
Show summary
In 1-M-1 pickup and delivery single vehicle routing problem a vehicle delivers from a depot to a set of customers as well as pickups at the same customers before returning to the depot. We propose a unified tabu search heuristic for several variants of the problem: the general case, the case with customers having limited capacity, the case with selective pickups, and the case with constraints on the time-lag or sequencing order between the pickup and delivery visits at the customer location.
-
-
Halskau, Øyvind; Gribkovskaia, Irina; Gribkovskaia, Irina & Nordli, Atle
(2006).
Economic order quantities assuming generalised order costs.
-
Aas, Bjørnar; Gribkovskaia, Irina; Shlopak, Alexander & Halskau, Øyvind
(2006).
Routing of supply vessels serving oil and gas installations in the Norwegian Sea.
Show summary
In the Norwegian oil and gas industry the upstream logistics includes providing the offshore
installations with needed supplies and return flow of used materials and equipment. A part of
these activities is planning of routes for supply vessels. This paper considers a real-life
routing problem for supply vessels serving offshore installations at Haltenbanken outside the
northwest coast of Norway from the supply base in Kristiansund. For the time being, the
planning takes place for one vehicle at a time. Thus, we present the problem as a single
vehicle routing problem with pickups and deliveries (SVRPPD). When solving this class of
problems it was commonly assumed that all customers are visited once on a vehicle route
shaped as a cycle. However, relaxation of the “one-visit” assumption can lead to different
routing options that encompass the traditional cycle and may be superior in terms of travelling
cost. In such non-traditional general solutions each customer is allowed to be visited either
once for combined pickup and delivery, or twice, when the first visit is used for the delivery
and pickup is performed on the second visit on the way back to the depot. Further, the reallife
problem considered has a unique feature arising from the limited deck capacity at the
offshore installations that complicates the performance of service and has never been treated
in the literature on routing planning. This paper introduces a mixed integer linear
programming model yielding general solutions for SVRPPD extended with a new set of
constraints. The constraints ensure that there is enough free space at the platform deck and at
the supply vessel deck to perform delivery and pickup operations. The model is tested on reallife
sized instances based on data provided by the Norwegian oil company Statoil. Results of
the tests show that in order to obtain optimal solutions to the SVRPPD with limited free
storage capacities at installations one has to include in the formulation the possibility of two
visits at platforms, the storage feasibility and the service feasibility requirements.
-
Kovalenko, Alina; Gribkovskaia, Irina; Skriabin, Anton & Strukov, Mikhail
(2024).
Simulation modelling of transit container
ship transportation with transhipment hubs via the Northeast Passage
.
Molde University College - Specialized University in Logistics.
ISSN 978-82-7962-358-8.
-
Gribkovskaia, Irina; Klyuev, Vladislav & Slettemark, Gaute Øiestad
(2023).
Tactical helicopter resource planning and weekly flight
scheduling for personnel transportation in offshore
energy industry
.
Molde University College - Specialized University in Logistics.
ISSN 978-82-7962-346-5.
-
Kisialiou, Yauheni; Gribkovskaia, Irina & Laporte, Gilbert
(2018).
Supply vessel routing and scheduling under uncertain demand
.
Høgskolen i Molde - Vitenskapelig høgskole i logistikk.
ISSN 978-82-7962-246-8.
-
Kisialiou, Yauheni; Gribkovskaia, Irina & Laporte, Gilbert
(2017).
Robust supply vessel routing and scheduling.
Molde University College - Specialized University in Logistics.
ISSN 978-82-7962-225-3.
Show summary
We solve the problem of tactical supply vessel planning arising in the upstream offshore petroleum logistics. Supply vessels deliver all the necessary materials and equipment to offshore installations from an onshore supply base. Delivery takes place according to a weekly sailing plan called the vessel delivery schedule. The charter cost of supply vessels is the largest cost contributor in the upstream offshore supply. The planning of supply vessels should therefore be done so that their number is minimized and should at the same time provide reliable flow of supplies from the base. The execution of a weekly sailing plan is affected by weather conditions, especially in wintertime. Harsh weather conditions increase the number of vessels required to perform the operations as well as the service times at the installations, and thus disrupt the schedule, leading to additional costs and reduced service level. We present a metaheuristic capable of generating cost-efficient and robust vessel schedules.
Keywords: maritime logistics; supply vessel planning; vehicle routing; robust vessel schedules.
-
Kisialiou, Yauheni; Gribkovskaia, Irina & Laporte, Gilbert
(2017).
An adaptive large neighborhood search heuristic
for the periodic supply vessel planning problem
with flexible departures and coupled vessels
.
Høgskolen i Molde - Vitenskapelig høgskole i logistikk.
ISSN 978-82-7962-221-5.
-
Norlund, Ellen Karoline; Gribkovskaia, Irina & Laporte, Gilbert
(2015).
Supply vessel planning under cost, environment and robustness considerations.
Høgskolen i Molde - Vitenskapelig høgskole i logistikk.
ISSN 978-82-7962-196-6.
Show summary
Offshore oil and gas installations need reliable cargo deliveries. The vessels supplying
these installations on a periodic basis are expensive and constitute a source of emissions
of greenhouse gases. Incorporating speed optimization into the supply vessel
planning process may significantly reduce fuel consumption and hence emissions. In
addition, speed optimization may yield cost reductions if the number of vessels used
does not increase. A main uncertainty factor, especially in the winter season, is the
weather conditions which impact sailing and service times. Cost minimization and the
application of speed optimization strategies may have implications on the robustness
of weekly supply vessel schedules since idle times in the schedules are reduced. We
develop a simulation-optimization based methodology that considers costs, emissions
and robustness in the generation of weekly supply vessel schedules. Results of analyses
conducted on real-based instances show that robustness requirements may yield
both increased emissions and costs in the winter season. However, depending on instance
characteristics, different degrees of robustness can be incorporated with both
costs and emissions reductions through speed optimization.
-
Norlund, Ellen Karoline & Gribkovskaia, Irina
(2014).
Environmental performance of speed optimization strategies in offshore supply vessel planning under weather uncertainty.
Høgskolen i Molde - Vitenskapelig høgskole i logistikk.
ISSN 978-82-7962-190-4.
Show summary
Supply vessels serving oil and gas installations at sea are a major emission source of greenhouse gases in offshore logistics. Speed optimization strategies applied in tactical vessel planning significantly reduce fuel consumption and thus emissions. Nevertheless, environmental performance of theses strategies in rough weather conditions is difficult to estimate as the duration of supply vessel operations is weather dependent. In this paper we develop a simulation-optimization tool which estimates average fuel consumption for weekly vessel schedules. The schedules are constructed by using speed optimized vessel voyages which are simulated under different weather conditions. Results of tests on real instances show that rough weather conditions increase fuel consumption and costs. Application of speed optimization strategies reduces fuel consumption both in winter and summer, but the reduction may be at the expence of a fixed vessel cost increase in the winter season
-
Gribkovskaia, Irina; Halskau sr, Øyvind & Kovyalov, Mikhail Y.
(2012).
Minimizing takeoff and landing risk in helicopter pickup and delivery operations.
Høgskolen i Molde - Vitenskapelig høgskole i logistikk.
ISSN 978-82-7962-156-0.
Show summary
The problem of minimizing total helicopter passenger risk caused by takeoffs and landings is
studied. There are passenger pickup and delivery demands to be satisfied at given points.
Each point is visited once. There are upper bound on the number of
flights and upper bound
on the helicopter passenger capacity. The objective function is a linear combination of the
numbers of passengers involved in takeoffs and landings at visited points. A solution is characterized by the number of
flights, sets of visited points and their sequences for all
flights.
Properties of optimal solutions are established. Several cases are proved NP-hard. A dynamic
programming algorithm is suggested for the general case. Effcient and easy for implementation algorithms are presented for the following cases: 1) a single
flight, 2) the number of visited
points not exceeding the number of
flights, and 3) an unbounded helicopter capacity, equal
risk coeffcients, and pickup demand equal to delivery demand at each point. Implementation
of the suggested solutions into the real helicopter operations should decrease the number of
fatalities in helicopter operations.
-
Gribkovskaia, Irina; Kovalev, Sergey & Werner, Frank
(2009).
Lot-sizing for an imperfect continuous production on two machines.
Otto-von-Guericke-Universitat Magdeburg.
Show summary
We study the problem of planning the production of new and recovery of defective units of the same product. The product is assumed to be continuously divisible. There are a main facility dedicated to the original production and a facility dedicated to re-manufacturing defective units coming from the main facility. Units fabricated on the main facility are inspected for quality in batches. The quality inspection requires some time and can be performed on-line or off-line. After the inspection has been completed, defective units of the inspected batch are transported to the re-manufacturing facility. The transportation also requires some time. We assume that the fraction of the defective units is the same in each batch on the manufacturing facility and that the re-manufacturing facility is perfect. Given a demand for good quality units of the product and an upper bound K on the number of batches, the problem is to find a sequence of batch sizes such that the manufacturing cycle time is minimized. We suggest a linear programming formulation, prove several properties of an optimal solution, and finally develop an O(log K) time solution algorithm. A similar per time unit cost minimization problem is studied as well.
-
Gribkovskaia, Irina & Laporte, Gilbert
(2007).
One-to-many-to-one single vehicle pickup and delivery problems.
GERAD - Group for Research in Decision Analysis.
Show summary
In One-to-Many-to-One Single Vehicle Pickup and Delivery Problems a vehicle based at the depot must make deliveries and pickups at customers locations before returning to the depot. Several variants can be defined according to the demand structures and sequencing rules imposed on pickups and deliveries. In recent years there has been an increased interest in this family of problems. New formulations and efficient heuristics capable of yielding general solutions (unrestricted in shape) have been proposed. In addition, some new and interesting extensions have been analyzed, including problems with selective pickups and problems with capacitated customers. The purpose of this chapter is to review these developments. Dans les problèmes de cueillette et livraison de type 'un-à-plusieurs-à-un', un véhicule basé au dépôt doit effectuer des cueillettes et livraisons chez un ensemble de clients avant de retourner au dépôt. On peut définir plusieurs variantes de ces problèmes selon la structure de la demande et les règles de séquencement imposées sur les cueillettes et les livraisons. Au cours des dernières années, on a assisté à un intérêt accru pour ces problèmes. En particulier, on a proposé de nouvelles formulations donnant lieu à des solutions dont la forme n'est pas contrainte (des solutions dites générales). De plus, plusieurs nouvelles extensions intéressantes ont été analysées, incluant des problèmes avec cueillettes sélectives ou avec clients de capacité limitée. Le but de ce chapitre est de passer ces développements en revue