Optimization: principles and algorithms, by Michel Bierlaire
Functions
ksLocalSearchRandom.m File Reference

Implementation of a variant of the local search algorithm with random neighbors for the knapsack problen. More...

Go to the source code of this file.

Functions

function ksLocalSearchRandom (in u, in w, in c, in x0, in s, in maxiter)
 

Detailed Description

Implementation of a variant of the local search algorithm with random neighbors for the knapsack problen.

Note
Tested with run2702localSearchRandom.m
Calls ksRandomNeighbor
Called by ksVns
Author
Michel Bierlaire
Date
Wed Apr 15 09:02:29 2015

Perform a variant of the local search for the knapsack problem with a neighborhood of a given size, where neighbord are selected randomly, and accepted if hey improve the objective function.

Parameters
uutility of each item
wweight of each item
ccapacity of the knapsack
x0current solution
ssize of the neighborhood
maxiternumber of candidates being evaluated (Default: 1000)
Returns
x local optimum

Definition in file ksLocalSearchRandom.m.

Function Documentation

function ksLocalSearchRandom ( in  u,
in  w,
in  c,
in  x0,
in  s,
in  maxiter 
)
Copyright 2015-2016 Michel Bierlaire