Abstract
The paper presents some of the evolutionary techniques used by the evolutionary sets of safe ship trajectories method. In general, this method utilizes a customized evolutionary algorithm to solve a constrained optimization problem. This problem is defined as finding a set of cooperating trajectories (here the set is an evolutionary individual) of all the ships involved in the encounter situation. The resulting trajectories are safe, taking into account the International Regulations for Preventing Collisions at Sea (COLREGS), and economical - due to minimization of the average way loss ratio (the goal function). While developing a new version of the method, the author decided to introduce a number of changes, e.g. focusing on COLREGS compliance. The upgrade to the method led the author to experiments with various evolutionary mechanisms which resulted in a much more effective evolutionary process. These mechanisms are thoroughly discussed here.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lisowski, J.: Dynamic games methods in navigator decision support system for safety navigation. In: Proceedings of the European Safety and Reliability Conference, vol. 2, pp. 1285–1292 (2005)
Smierzchalski, R., Michalewicz, Z.: Modeling of a Ship Trajectory in Collision Situations at Sea by Evolutionary Algorithm. IEEE Transactions on Evolutionary Computation 4(3), 227–241 (2000)
Zeng, X.: Evolution of the safe path for ship navigation. Applied Artificial Intelligence 17, 87–104 (2003)
Tsou, M.-C., Kao, S.-L., Su, C.-M.: Decision Support from Genetic Algorithms for Ship Collision Avoidance Route Planning and Alerts. The Journal of Navigation 63, 167–182 (2010)
Beyera, H.G., Schwefela, H.P., Wegenerb, I.: How to analyse evolutionary algorithms. Theoretical Computer Science 287, 101–130 (2002)
Eiben, A.E., Schoenauer, M.: Evolutionary computing. Information Processing Letters 82, 1–6 (2002)
Michalewicz, Z., Fogel, D.B.: How To Solve It: Modern Heuristics. Springer, Heidelberg (2004)
Szlapczynski, R.: Solving multi-ship encounter situations by evolutionary sets of cooperating trajectories. In: Marine Navigation and Safety of Sea Transportation, pp. 437–442. CRC Press / Taylor & Francis Group / Balkema (2009)
Cockroft, A.N., Lameijer, J.N.F.: A Guide to Collision Avoidance Rules. Butterworth-Heinemann Ltd., Butterworth (2003)
Szłapczyński, R.: A unified measure of collision risk derived from the concept of a ship domain. Journal of Navigation 59(3), 477–490 (2006)
Szłapczynski, R., Szłapczyńska, J.: Evolutionary Sets of Safe Ship Trajectories: problem dedicated operators, submitted to ICCCT (in prep., 2011)
Cantú-Paz, E.: Order statistics and selection methods of evolutionary algorithms. Information Processing Letters 82, 15–22 (2002)
Wiese, K.C., Goodwin, S.D.: Keep-Best Reproduction: A Local Family Competition Selection Strategy and the Environment it Flourishes in. Constraints 6, 399–422 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szłapczyński, R. (2011). Evolutionary Sets of Safe Ship Trajectories: Improving the Method by Adjusting Evolutionary Techniques and Parameters. In: Jędrzejowicz, P., Nguyen, N.T., Hoang, K. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2011. Lecture Notes in Computer Science(), vol 6923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23938-0_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-23938-0_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23937-3
Online ISBN: 978-3-642-23938-0
eBook Packages: Computer ScienceComputer Science (R0)