Premium
Assessing the prediction uncertainty in a route optimization model for autonomous maritime logistics
Author(s) -
Maskooki Alaleh,
Virjonen Petra,
Kallio Markku
Publication year - 2021
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/itor.12882
Subject(s) - computer science , mathematical optimization , operations research , measure (data warehouse) , automation , trajectory , integer programming , data mining , mathematics , algorithm , mechanical engineering , engineering , physics , astronomy
Unmanned operations and automation in modern industry create complex everyday problems, which require algorithmic thinking and creativity. Development of risk assessment methods is critical for the future of this business segment. To provide decision support for the management of an autonomous emission control boat, we begin by proposing a k ‐Nearest‐Neighbours ( k ‐NN)‐based trajectory prediction method. This is employed in a bi‐objective routing problem of finding a Hamiltonian circuit in a dynamic network defined by predicted locations of ships over time. The objectives are maximizing the number of measurement tasks to be done and minimizing the corresponding total travel distance of the emission control boat. To evaluate the impact of trajectory prediction uncertainty on Pareto‐optimal itineraries, we propose a risk measure in a mean‐risk framework. The risk is defined based on an expected shortfall when implementation of an efficient itinerary under the predicted trajectories needs rescheduling based on realized trajectories. The risk measure helps the decision maker to evaluate choice alternatives among efficient itineraries under predicted trajectories and to make a balanced risk‐adjusted decision. We show how historical data is employed in integer linear programming for the estimation of such risk measure. Empirical results demonstrate such estimation.