Comparison of Optimisation Methods for The Knapsack Problem: Steepest Ascent Hill Climbing vs. Simulated Annealing
I have published my paper “Comparison of Optimisation Methods for The Knapsack Problem: Steepest Ascent Hill Climbing vs. Simulated Annealing” on ResearchGate. The paper explores the application of optimization algorithms, specifically Hill Climbing and Simulated Annealing, to solve the knapsack problem. The knapsack problem is a well-known combinatorial optimization problem...