Optimization: principles and algorithms, by Michel Bierlaire
run2702localSearchRandom.m
Go to the documentation of this file.
1 %> \file
2 %> Runs example 27.2 of \cite Bier15-book, solving the problem using the local search method with random neighbors
3 %>
4 %> @note Calls \ref ksLocalSearchRandom
5 %>
6 %> @ingroup Running
7 %> @author Michel Bierlaire
8 %> @date Tue Apr 14 13:15:12 2015
9 %> @ingroup chap27
10 
11 u = [80 31 48 17 27 84 34 39 46 58 23 67]' ;
12 w = [84 27 47 22 21 96 42 46 54 53 32 78]' ;
13 capacity = 300 ;
14 x0 = zeros(12,1) ;
15 xopt = ksLocalSearchRandom(u,w,capacity,x0,1)
16 printf("Final utility: %d, final weight: %d\n",xopt'*u, xopt'*w)
function ksLocalSearchRandom(in u, in w, in c, in x0, in s, in maxiter)
Copyright 2015-2016 Michel Bierlaire