deterministic

Of, or relating to determinism.

Having at most one instruction associated with any given internal state.

Another class, P, is a subset of NP, and includes all decision problems that can be solved by a (deterministic) Turing machine in polynomial time.

Having exactly predictable time evolution.

For a given particular input, always producing the same output through the same sequence of states.

On the other hand, if the genetic algorithm has many advantages, their computation cost is higher as compared with deterministic algorithms.