dc.contributor.author | Bye, Robin Trulssen | |
dc.contributor.author | Schaathun, Hans Georg | |
dc.date.accessioned | 2018-05-24T09:12:01Z | |
dc.date.available | 2018-05-24T09:12:01Z | |
dc.date.created | 2016-01-26T11:46:52Z | |
dc.date.issued | 2015 | |
dc.identifier.isbn | 978-3-319-27680-9 | |
dc.identifier.uri | http://hdl.handle.net/11250/2499053 | |
dc.description.abstract | Tug fleet optimisation algorithms can be designed to solve the problem of dynamically positioning a fleet of tugs in order to mitigate the risk of oil tanker drifting accidents. In this paper, we define the 1D tug fleet optimisation problem and present a receding horizon genetic algorithm for solving it. The algorithm can be configured with a set of cost functions such that each configuration effectively constitute a unique tug fleet optimisation algorithm. To measure the performance, or merit, of such algorithms, we propose two evaluation heuristics and test them by means of a computational simulation study. Finally, we discuss our findings and some of our related work on a parallel implementation and an alternative 2D nonlinear mixed integer programming formulation of the problem. | nb_NO |
dc.language.iso | eng | nb_NO |
dc.publisher | Springer Verlag | nb_NO |
dc.relation.ispartof | Operations Research and Enterprise Systems : 4th International Conference, ICORES2015 Lisbon, Portugal, January 10-12, 2015 : Revised Selected Papers | |
dc.title | A Simulation Study of Evaluation Heuristics for Tug Fleet Optimisation Algorithms | nb_NO |
dc.type | Chapter | nb_NO |
dc.description.version | publishedVersion | nb_NO |
dc.source.pagenumber | 165-190 | nb_NO |
dc.identifier.doi | 10.1007/978-3-319-27680-9_11 | |
dc.identifier.cristin | 1322569 | |
dc.description.localcode | This chapter will not be available due to copyright restrictions (c) 2015 by Springer | nb_NO |
cristin.unitcode | 194,63,55,0 | |
cristin.unitname | Institutt for IKT og realfag | |
cristin.ispublished | true | |
cristin.fulltext | original | |
cristin.qualitycode | 1 | |