One Max problem is a simple optimization problem. The aim of the problem is maximizing the number of ones in a feasible solution ?. ? can be either 0 or 1. The formula of the problem is given below.
computer science
Description
One Max Problem
One Max problem is a simple optimization problem. The aim of the problem is maximizing the number of ones in a feasible solution ?. ? can be either 0 or 1. The formula of the problem is given below.
Instructions:
• Solve the One Max Problem using Particle Swarm Optimization.
• Solve the One Max Problem using Your Optimization Algorithm.
• Each program runs 30 times with the number of function evalutions = 100,000.
• Take Upper Bound= 1 and Lower Bound = -1
• Solve the problem for three different dimensions which are D = 100, D = 500, D= 1000.
• Compare PSO and Your_Algorithm using the following metrics:
• Best, Mean, Median, Worst, Standard Deviation. Also, make statistical analysis using Wilcoxon etc.
