This repository has been archived by the owner on Nov 11, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 5
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
added some demonstration cases; changed the structue of code
- Loading branch information
KimHe
committed
Feb 16, 2016
1 parent
0e7e53b
commit aada1c0
Showing
20 changed files
with
1,050 additions
and
2,213 deletions.
There are no files selected for viewing
This file was deleted.
Oops, something went wrong.
This file was deleted.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -169,7 +169,7 @@ function Differential_Evolution(params) | |
|
||
|
||
% Simulation of the sampled points, using subroutine simulatedMovingBed | ||
Population(:, opt.IndivSize+1) = arrayfun( @(idx) feval(@SMB.simulatedMovingBed, ... | ||
Population(:, opt.IndivSize+1) = arrayfun( @(idx) feval(@simulatedMovingBed, ... | ||
exp(Population(idx, 1:opt.IndivSize)) ), 1: opt.PopulSize ); | ||
|
||
|
||
|
@@ -278,7 +278,7 @@ function Differential_Evolution(params) | |
|
||
|
||
% Simulate the new population and compare their objective function values | ||
tempValue(:, 1) = arrayfun(@(idx) feval( @SMB.simulatedMovingBed, exp(tempPop(idx, 1:C)) ), 1:R ); | ||
tempValue(:, 1) = arrayfun(@(idx) feval( @simulatedMovingBed, exp(tempPop(idx, 1:C)) ), 1:R ); | ||
|
||
[row, ~] = find(tempValue < Population(:,C+1)); | ||
|
||
|
@@ -496,7 +496,7 @@ function Particle_Swarm_Optimization(params) | |
|
||
|
||
% Simulation of the sampled points, using subroutine simulatedMovingBed | ||
ParSwarm(: ,2 * opt.particleSize + 1) = arrayfun( @(idx) feval(@SMB.simulatedMovingBed,... | ||
ParSwarm(: ,2 * opt.particleSize + 1) = arrayfun( @(idx) feval(@simulatedMovingBed,... | ||
exp(ParSwarm(idx, 1:opt.particleSize)) ), 1:opt.swarmSize ); | ||
|
||
% The statistics of the population | ||
|
@@ -614,7 +614,7 @@ function Particle_Swarm_Optimization(params) | |
|
||
|
||
% Simulation of the sampled points, using subroutine simulatedMovingBed | ||
ParSwarm(row, 2*ParCol+1) = feval( @SMB.simulatedMovingBed, exp(ParSwarm(row, 1:ParCol)) ); | ||
ParSwarm(row, 2*ParCol+1) = feval( @simulatedMovingBed, exp(ParSwarm(row, 1:ParCol)) ); | ||
|
||
% if the updated position is better than the current position, the | ||
% particle flies to the updated positon; otherwise, keep still in current position | ||
|
@@ -953,7 +953,7 @@ function Metropolis_Adjusted_Differential_Evolution(params) | |
|
||
|
||
% Simulation of the sampled points, using subroutine simulatedMovingBed | ||
initChain(:,opt.dimension+1) = arrayfun( @(idx) feval( @SMB.simulatedMovingBed, ... | ||
initChain(:,opt.dimension+1) = arrayfun( @(idx) feval( @simulatedMovingBed, ... | ||
exp( initChain(idx,1:opt.dimension)) ), 1: opt.Nchain); | ||
|
||
end | ||
|
@@ -984,7 +984,7 @@ function Metropolis_Adjusted_Differential_Evolution(params) | |
rho = 0; | ||
else | ||
|
||
newSS = feval( @SMB.simulatedMovingBed, exp(proposal) ); | ||
newSS = feval( @simulatedMovingBed, exp(proposal) ); | ||
SS = states(j, opt.dimension+1); | ||
|
||
% rho = exp( -0.5*(newSS - SS) / sigmaSqu(j)); | ||
|
@@ -1220,7 +1220,7 @@ function Metropolis_Adjusted_Differential_Evolution(params) | |
end | ||
% ============================================================================= | ||
% SMB - The Simulated Moving Bed Chromatography for separation of | ||
% target compounds, such as fructose and glucose. | ||
% target compounds, either binary or ternary. | ||
% | ||
% Author: QiaoLe He E-mail: [email protected] | ||
% | ||
|
This file was deleted.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.