GA_VRP: Genetic Algorithm structure to solve VRP

In kavetinaveen/HeuristicsVRP: To find greedy routes using heuristic algorithms

Description

Genetic Algorithm structure to solve VRP

Usage

GA_VRP(maxitr, runs, cp, mp, fitness = fitness, selection = selection_RS,
  crossover = crossover, mutation = mutation, init_pop = NULL,
  num_nodes = NULL, popSize = NULL)

Arguments

maxitr	Maximum number of iterations
runs	If there is no improvement in the fitness value in the consecutive 'runs' iterations then algorithm will terminate
cp	Crossover probability
mp	Mutation probability
fitness	Fitness function
selection	Fuction for selection operator, default selection_RS (Selection with rank space but not with diversity)
crossover	Function for crossover operator
mutation	Function for mutation operator
init_pop	Initial population for GA
num_nodes	Number of customer nodes
popSize	Number of chromozomes in population

kavetinaveen/HeuristicsVRP documentation built on May 20, 2019, 7:53 a.m.