The [`from_starting_point`](https://thomasweise.github.io/moptipy/moptipy.api.html#moptipy.api.subprocesses.from_starting_point) subprocess routine now creates a process which also updates the current-best solution if a new, equally good solution is discovered (instead of only updating it on improvements). This allows for drift, i.e., for a behavior more similar to [RLS](https://thomasweise.github.io/moptipy/moptipy.algorithms.so.html#module-moptipy.algorithms.so.rls) as opposed to strictly-improving [hill climbers](https://thomasweise.github.io/moptipy/moptipy.algorithms.so.html#module-moptipy.algorithms.so.hill_climber) in [Memetic Algorithms](https://thomasweise.github.io/moptipy/moptipy.algorithms.so.html#module-moptipy.algorithms.so.ma) (MAs).
We also added a [hard-coded Memetic Algorithm](https://thomasweise.github.io/moptipy/moptipy.algorithms.so.html#module-moptipy.algorithms.so.ma) using RLS as internal local search. This algorithm is more efficient as it has less overhead compared to an identically configured general [MA](https://thomasweise.github.io/moptipy/moptipy.algorithms.so.html#module-moptipy.algorithms.so.ma), but will take exactly the same path through the search space.
Finally, we improved the documentation of the [Job Shop Scheduling](https://thomasweise.github.io/moptipy/moptipy.examples.jssp.html#module-moptipy.examples.jssp) example problem domain.