Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Improving the performance of weather routing algorithms. / Korovkin, Maxim V.; Pogozhev, Sergei V.
Maritime Transport, MT2019. ed. / G. Passerini; S. Ricci. WIT Press, 2019. p. 57-64 (WIT Transactions on the Built Environment; Vol. 187).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
}
TY - GEN
T1 - Improving the performance of weather routing algorithms
AU - Korovkin, Maxim V.
AU - Pogozhev, Sergei V.
N1 - Publisher Copyright: © 2019 WIT Press.
PY - 2019
Y1 - 2019
N2 - This paper presents a framework for solving weather routing problems. Such a problem may be considered as: giving the model of ship dynamics and fuel consumption used for route evaluation, GIS data and weather forecast, which allow to check any route leg for safety, providing the set of routes and satisfying some optimality criteria (e.g. minimal routing time, minimal fuel consumption, specified time of arrival and so on). From the authors’ point of view, the searching of such routes may consist of the following steps: 1. Generation of a set of feasible routes, which are “close” to some extent to desired ones; 2. Modification of the feasible routes set by applying some transformations to previously found routes; 3. Fine tuning of route parameters according to search criteria; and 4. Selection of best routes. Several discrete algorithms, proposed for step 1, are compared, so one can chose an appropriate one. Algorithms presented for steps 2 and 3 may be considered as a way of softening the space/time discretization side effects. To compare the efficiency of such algorithms, some common quality measures are presented.
AB - This paper presents a framework for solving weather routing problems. Such a problem may be considered as: giving the model of ship dynamics and fuel consumption used for route evaluation, GIS data and weather forecast, which allow to check any route leg for safety, providing the set of routes and satisfying some optimality criteria (e.g. minimal routing time, minimal fuel consumption, specified time of arrival and so on). From the authors’ point of view, the searching of such routes may consist of the following steps: 1. Generation of a set of feasible routes, which are “close” to some extent to desired ones; 2. Modification of the feasible routes set by applying some transformations to previously found routes; 3. Fine tuning of route parameters according to search criteria; and 4. Selection of best routes. Several discrete algorithms, proposed for step 1, are compared, so one can chose an appropriate one. Algorithms presented for steps 2 and 3 may be considered as a way of softening the space/time discretization side effects. To compare the efficiency of such algorithms, some common quality measures are presented.
KW - Optimization
KW - Path finding
KW - Weather routing
UR - http://www.scopus.com/inward/record.url?scp=85087933101&partnerID=8YFLogxK
U2 - 10.2495/MT190061
DO - 10.2495/MT190061
M3 - Conference contribution
AN - SCOPUS:85087933101
SN - 9781784663476
T3 - WIT Transactions on the Built Environment
SP - 57
EP - 64
BT - Maritime Transport, MT2019
A2 - Passerini, G.
A2 - Ricci, S.
PB - WIT Press
T2 - 1st International Conference on Maritime Transport, MT2019
Y2 - 10 September 2019 through 12 September 2019
ER -
ID: 51974555