LF: LeapFrog metaheuristic search algorithm

In bjhufstetler/LeapFrog: LeapFrog for TSP

Description

Takes a distance matrix and searches for an optimal tour

Usage

LF(LFObj, p = 1, m = 1, s = 10^-3, r = 1, a = 0, monitor = TRUE)

Arguments

LFObj	A LeapFrog class object created by running the ImportData() function.
p	A double (0,1] which represents the ratio of the maximum number of nodes removed in each iteration of the LF algorithm.
m	An integer (1,inf) which represents the number of games played
s	A double (0,1] which represents the uncertainty used in the first round of each game
r	An integer (1,inf) which represents the number of rounds in each game
a	A double (0,1] which represents the variable number of players used in successive rounds
monitor	A boolean or function used to display information during execution of the algorithm

bjhufstetler/LeapFrog documentation built on March 19, 2020, 11:51 p.m.