ILSFS: Iterated local search for the permutative flowshop

In jmsallan/combheuristics: Heuristics for combinatorial problems

Iterated local search for the permutative flowshop

Description

An iterated local search for the permutative flowshop. At each iteration, the present examined solution obtained at the previous iteration is perturbated performing ni insertions. This perturbated solution is improved with a local search heuristic using the swap operator. The starting solution is obtained with the Palmer heuristic.

Usage

ILSFS(M, ni = 4, iter = 100, opt = "HC", ...)

Arguments

M	A matrix object storing the time to process task j (column) in machine i (row).
ni	Number of insertions performed when perturbating the solution.
iter	number of iterations.
opt	the local search algorithm to implement. Presently are supported HC (hill climbing with HCFS), SA (simulated annealing with SAFS) and TS (tabu search with TSFS).
...	we can pass additional parameters for the SAFS heuristic if desired (Tmax and mu).

Value

sol The obtained solution.

obj The makespan of the obtained solution.

Examples

set.seed(2020)
instance <- matrix(sample(10:90, 100, replace=TRUE), 5, 20)
ILSFS(M=instance, opt="SA", Tmax=10000, mu=1000)

jmsallan/combheuristics documentation built on June 22, 2022, 4:11 p.m.