How to analyse evolutionary algorithms
Theoretical Computer Science - Natural computing
How to Solve It: Modern Heuristics
How to Solve It: Modern Heuristics
Modeling of ship trajectory in collision situations by anevolutionary algorithm
IEEE Transactions on Evolutionary Computation
Evolutionary sets of safe ship trajectories: problem-dedicated operators
ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part II
| Hi-index | 0.00 |
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.