4.7 Article

A stochastic optimization approach for the supply vessel planning problem under uncertain demand

Journal

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
Volume 162, Issue -, Pages 209-228

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.trb.2022.05.015

Keywords

Supply vessel planning problem; Stochastic programming; Stochastic demands

Funding

  1. Portuguese Foundation for Science and Technology (Fundacao para a Ciencia e Tecnologia- FCT) [SFRH/BD/120446/2016]
  2. Portuguese Foundation for Science and Technology [UIDB/UIDP/00134/2020]
  3. Fundação para a Ciência e a Tecnologia [SFRH/BD/120446/2016] Funding Source: FCT

Ask authors/readers for more resources

This paper presents a methodology to solve the Supply Vessel Planning Problem with Stochastic Demands (SVPPSD), which uses a two-stage stochastic programming with recourse algorithm. By accounting for the cost of recourse and exploring a wider solution space, robust schedules with a smaller fleet size can be achieved, leading to significant cost savings.
This paper presents a two-stage stochastic programming with recourse methodology to solve the Supply Vessel Planning Problem with Stochastic Demands (SVPPSD), a problem arising in offshore logistics and which generalizes the Periodic Vehicle Routing Problem with Stochastic Demands and Time Windows. In the SVPPSD, a fleet of vessels is used to deliver a regular supply of commodities to a set of offshore installations to ensure continuous production, with each installation requiring one or more visits per week and having stochastic demands. Both the onshore depot where the product to be distributed is kept and the offshore installations have time windows, and voyages are allowed to span more than one day. A solution to the SVPPSD consists in the identification of an optimal fleet of vessels and the corresponding weekly schedule. As a solution methodology, we embed a discrete-event simulation engine within a genetic search procedure to approximate the cost of recourse and arrive at the minimized expected cost solution. We make comparisons with two alternative approaches: an expected value problem with upscaled demand, and a chance-constrained algorithm. While alternative methodologies yield robust schedules, robustness is achieved mainly through an increase in fleet size. In contrast, a two-stage stochastic programming with recourse algorithm, by accounting for the cost of recourse in the search phase, and exploring a wider solution space, allows arriving at robust schedules with a smaller fleet size, thereby yielding significant cost savings. For the tested problem instances, the proposed algorithm leads to savings of approximately 10 to 15 million USD per year.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available