multiindepintegermutation.m

this file is a zip file for multi objective optimization by matlab.

function [parent] = multiIndepIntegerMutation(parent,bounds,Ops)
% changes an iit (integer digit) randomly
%
% function [newSol] = multiIndepIntegerMutation(parent,bounds,Ops)
% parent  - the first parent ( [solution string function value] )
% bounds  - the bounds matrix for the solution space
% Ops     - Options for multiIndepIntegerMutation [gen force]
%           force = 1: try until digit is mutated
%           force = 0: allow parent to be returned unaltered

% Binary and Real-Valued Simulation Evolution for Matlab 
% Copyright (C) 1996 C.R. Houck, J.A. Joines, M.G. Kay 
%
% C.R. Houck, J.Joines, and M.Kay. A genetic algorithm for function
% optimization: A Matlab implementation. ACM Transactions on Mathmatical
% Software, Submitted 1996.
%
% Modified by Kerry W. Lothrop <[e-mail]> to work with more
% complex objective functions enabling design vectors containing
% binary digits, dependent integers, independent integers and floating
% point numbers
% University of Colorado, 2002
%
% Lothrop, K.W.: Conceptual Design Optimization of a Cis-Lunar
% Transportation Architecture Using Genetic Algorithms, Universit鋞
% Stuttgart, University of Colorado, 2003
%
% This program is free software; you can redistribute it and/or modify
% it under the terms of the GNU General Public License as published by
% the Free Software Foundation; either version 1, or (at your option)
% any later version.
%
% This program is distributed in the hope that it will be useful,
% but WITHOUT ANY WARRANTY; without even the implied warranty of
% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
% GNU General Public License for more details. A copy of the GNU 
% General Public License can be obtained from the 
% Free Software Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.

numOfPossVals = bounds(2) - bounds(1) + 1;
newval = floor(rand * numOfPossVals) + bounds(1);
if Ops(2) == 1
  if bounds(2) > bounds(1) % prevent endless loop
    while newval == parent % always mutate
      newval = floor(rand * numOfPossVals) + bounds(1);
    end
  end
end
parent = newval;