ls

Documentation

Index

• Constants
• Variables
• func Init(file *oo.File, addCandidateNumber int)
• func LocalSearch(file *oo.File, currentChoice []bool) *oo.Individual
• func LocalSearchDown(file *oo.File, currentChoice []bool, ...) []bool
• type AddCandidate
• type AddCandidateSlice
  • func (a AddCandidateSlice) Len() int
  • func (a AddCandidateSlice) Less(i, j int) bool
  • func (a AddCandidateSlice) Swap(i, j int)

Constants

const (
	Logging = false
)

Variables

var (
	OoCounter *int64 = new(int64)
)

Functions

func Init

func Init(file *oo.File, addCandidateNumber int)

func LocalSearch

func LocalSearch(file *oo.File, currentChoice []bool) *oo.Individual

The main routine of the local search. Starts by going upwards but doesn't stop if the first search upwards yields no improvement.

func LocalSearchDown

func LocalSearchDown(file *oo.File, currentChoice []bool, handleSolution func(*oo.File, *oo.Solution)) []bool

Initial local search The main routine of the local search. Starts by going down and stops as soon as a downwards or upwards pass yields no improvement.

Types

type AddCandidate

type AddCandidate struct {
	Id      int
	Benefit int

	Ben int
	Len int
}

type AddCandidateSlice

type AddCandidateSlice []*AddCandidate

func (AddCandidateSlice) Len

func (a AddCandidateSlice) Len() int

Len, Less and Swap are needed so that the slice can be sorted

func (AddCandidateSlice) Less

func (a AddCandidateSlice) Less(i, j int) bool

func (AddCandidateSlice) Swap

func (a AddCandidateSlice) Swap(i, j int)