HCFS: Hill climbing heuristic for permutative flowshop

In jmsallan/combheuristics: Heuristics for combinatorial problems

Hill climbing heuristic for permutative flowshop

Description

A hill climbing heuristic for pemutative flowshop. In each iteration, it finds the element of the neighbourhood of the present solution with lowest makespan. If the obtained solution improves the existing solution, a new iteration is performed. If not, the algorithm stops.

Usage

HCFS(M, inisol, op = "swap")

Arguments

M	A matrix object storing the time to process task j (column) in machine i (row).
inisol	The starting solution.
op	The neighbourhood operator. Presently are implemented swap (the default) and insertion neighbourhoods.

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)
HCFS(M=instance, inisol=PalmerTrapezes(instance)$tra, op="insertion")

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