Implementing Genetic Algorithms Without Toolbox Functions: A Practical MATLAB Approach

Genetic algorithms are optimization methods that mimic natural selection and genetic mechanisms, widely applied to solve complex engineering and scientific problems. This article demonstrates how to implement genetic algorithms in MATLAB without using toolbox functions, covering core steps including encoding, fitness calculation, selection, crossover, and mutation operations.

### 1. Problem Modeling First, define the optimization objective and design the fitness function. The fitness function evaluates individual solutions, typically directly related to the objective function. For minimization problems, the fitness function can be implemented as the reciprocal or negative value of the objective function using MATLAB's function handles: fitness_fun = @(x) 1./objective_fun(x);

### 2. Encoding and Initialization Genetic algorithms commonly use binary encoding for discrete variables or floating-point encoding for continuous variables. Initialize the population by randomly generating individuals using MATLAB's random number generators: population = rand(pop_size, gene_length) for floating-point encoding or population = randi([0,1], pop_size, gene_length) for binary encoding, ensuring initial diversity.

### 3. Fitness Calculation Evaluate each individual by calling the fitness function. The fitness values determine selection priorities in subsequent operations. Implement efficient vectorized calculations in MATLAB: fitness_values = arrayfun(fitness_fun, population);

### 4. Selection Operation Common selection methods include roulette wheel selection and tournament selection. Roulette wheel selection allocates probabilities proportional to fitness values using cumulative sum operations: cum_prob = cumsum(fitness_values./sum(fitness_values)); Tournament selection randomly selects individuals for comparison and retains the best through comparison operations.

### 5. Crossover Operation Generate new individuals through crossover, simulating genetic recombination. Implement single-point, two-point, or uniform crossover based on encoding schemes using MATLAB's array slicing: crossover_point = randi([1,gene_length-1]); offspring = [parent1(1:crossover_point), parent2(crossover_point+1:end)];

### 6. Mutation Operation Introduce randomness through mutation to avoid local optima. For binary encoding, flip random bits using logical operations: mutation_mask = rand(size(chromosome)) < mutation_rate; mutated_chromosome = xor(chromosome, mutation_mask); For floating-point encoding, add random perturbations with controlled magnitude.

### 7. Termination Criteria Terminate the algorithm when reaching preset iterations or fitness convergence. Track convergence by monitoring fitness improvement rates: if std(fitness_values) < tolerance || iteration > max_iter, break; end Output the best individual as the final solution.

Following these implementation steps enables efficient genetic algorithm construction in MATLAB without toolbox dependencies, applicable to various optimization problems with proper parameter tuning and algorithm customization.