In this study, one-dimensional bin packing problem is based.

The constraints and objective function are explained as follows:

• Each item has a specified size and each bin has the same capacity.
• Aim to find the minimum number of bins required to pack the items without the capacity constraint of each bin.

This Section code by should contain how you construct the initial solution (First fit algorithm) and how you represent the solution. Please provide an example for the application of the neighboring structures on the solution representation. This problem code by Simulated annealing, tabu search and genetic algorithm. Problem data set will be same. Specify the characteristics of the data set (For example; weight of item number 30. Number of iterations 50.) Please show each algorithm pseudo-code and algorithmic structure.

Descriptions of strategies depend on the algorithm used. You develop a SA, strategies for starting temperature, equilibrium state, cooling schedule and stopping criterion must be explained in detail. You develop a GA, then mutation, crossover, parent selection, reproduction etc. strategies must be explained in detail. You develop a tabu search tabu list, stopping criterion and aspiration criteria.

Obtain the results of the metaheuristic for the best parameter set. The avarage, min and max values of the objective function values and CPU times must be listed for 5 runs of your algorithm.

My question is;

How to code genetic,tabu search and simutaing annealing by using vba or any programming language.