Code covered by the BSD License
-
Electron Problem Optimization
-
First Order Reliability Metho...
-
computebestportfolioPCT(expRe...
Oren Rosen
-
crossoverNcK(parents,options,...
Oren Rosen
-
flutterLimitFunction(X,model)
Calcualte Flutter Limit Function
-
generateinitpopNcK(n,k)
Oren Rosen
-
make2plots(X1, Y1, Y2)
CREATEFIGURE1(X1,Y1,Y2)
-
minvar(covMat,indvRet,targetR...
Oren Rosen
-
motorController(p,u,v)
Controller design function.
-
motorDesign(x,a,b)
DC Motor design function
-
motorOptimizationTask(z,a,u,a...
Copyright 2010 The MathWorks, Inc.
-
motorSystem(x,a,u,alpha)
Motor system design function, couples motor design with conrtrol design
-
mutationNcK(parents,options,G...
Oren Rosen
-
myCostFcnRR(x,simParms)
Run Simulink model
-
myNonlConRR(x,simParms)
Copyright 2010 The MathWorks, Inc.
-
nlConstraint(x)
Copyright 2010 The MathWorks, Inc.
-
nonlinConstraint(u,Gx,Tinv)
Nonlinear Constratint Function for FORM
-
plotElectron(varargin)
Plot electrons on conducting body after solution finishes.
-
rrDesignParallel(nRuns)
Copyright 2010 The MathWorks, Inc.
-
runSimModel(x,simParms,ii)
Copyright 2010 The MathWorks, Inc.
-
struct2var(s)
STRUCT2VAR Convert structure array to workspace variables.
-
sumInvDist(x)
Copyright 2010 The MathWorks, Inc.
-
DemoGAwPCT.m
-
electronProblemScript.m
-
optimMotorDesign.m
-
optimSuspensionScript.m
-
setup.m
-
Flutter
-
Flutter_noAnimation
-
mldemo_suspnfast
-
View all files
from
Speeding Up Optimization Problems with Parallel Computing
by Stuart Kozola
Files from the webinar: Speeding up optimization problems with parallel computing
|
| generateinitpopNcK(n,k)
|
function initPop = generateinitpopNcK(n,k)
% Oren Rosen
% 4/1/2008
% Copyright 2008 The MathWorks, Inc.
%
% This function is used for the N-choose-K bit-string genetic algorithm.
% It is used to generate a simple and regular initial population.
% For example, if n=10 and k=5 it will generate the following matrix of
% bit-strings:
%
% [ 1 1 1 1 1 0 0 0 0 0
% 0 1 1 1 1 1 0 0 0 0
% 0 0 1 1 1 1 1 0 0 0
% 0 0 0 1 1 1 1 1 0 0
% 0 0 0 0 1 1 1 1 1 0
% 0 0 0 0 0 1 1 1 1 1 ]
%
% As a consequence of the structure - there will be exactly n-k+1
% individuals in each population.
%
% This implementation was a quick and intuitive way to structure this
% function. It is by no means optimized and the end user is encouraged to
% experiment with other methods.
initPop = zeros(n-k+1,n);
for i=1:n-k+1
initPop(i,i:i+k-1) = 1;
end
|
|
Contact us