.png){kind=icon}
.png){kind=icon}
Return
Robust Optimization for a Maritime Inventory Routing Problem
.png){kind=icon}
OA
AI
DOI：10.1287/trsc.2017.0814.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider a single product maritime inventory routing problem in which the production and consumption rates are constant over the planning horizon. The problem involves a heterogeneous fleet and multiple production and consumption ports with limited storage capacity. Maritime transportation is characterized by high levels of uncertainty, and sailing times can be severely influenced by varying and unpredictable weather conditions. To deal with the uncertainty, this paper investigates the use of adaptable robust optimization where the sailing times are assumed to belong to the well-known budget polytope uncertainty set. In the recourse model, the routing, the order of port visits, and the quantities to load and unload are fixed before the uncertainty is revealed, while the visit time to ports and the stock levels can be adjusted to the scenario. We propose a decomposition algorithm that iterates between a master problem that considers a subset of scenarios and an adversarial separation problem that searches for scenarios that make the solution from the master problem infeasible. Several improvement strategies are proposed aiming at reducing the running time of the master problem and reducing the number of iterations of the decomposition algorithm. An iterated local search heuristic is also introduced to improve the decomposition algorithm. A computational study is reported based on a set of real instances.
Keywords:
robust optimization
uncertainty
travel time
decomposition
matheuristic
inventory routing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.8
Papers:
1.9K
Citations:
8.4K