Algorithm development
WEBER routine (Ostrech, 1973): a good traditional location optimiser
- Newton-Raphson optimisation technique (a typical hill-climbing search technique)
- A long history and programmed code
- But, easy to get stuck at local optimum
Genetic Algorithms (GAs) and Simulated Annealing (SA) algorithms
- Probabilistic-based search method (stochastic process)
- A rather different optimisation strategy
- GA: Keep the best solution in each iteration (called evolution)
- SA: Accept the worse solution by probabilistic condition (Metropolis criterion) - a robust advanced hill-climbing search technique
- A generic global optimisation search technique (Robustness, near optimal performance)