Rank: 1871 based on 65 downloads (last 30 days) and 2 files submitted
photo

Johannes

E-mail

Personal Profile:

 

Watch this Author's files

 

Files Posted by Johannes View all
Updated   File Tags Downloads
(last 30 days)
Comments Rating
16 Apr 2013 Screenshot Ant System TSP Solver A demo of an Ant System algorithm solving classical Traveling Salesman Problems. Author: Johannes ant colony optimizati..., ant system as, traveling salesman pr..., amrit wander 44 6
  • 3.33333
3.3 | 3 ratings
08 Dec 2011 Hypervolume Computation Scripts for computing the hypervolume and related stuff. Author: Johannes hypervolume, multiobjective, optimization, lebesgue 21 8
  • 4.0
4.0 | 1 rating
Comments and Ratings by Johannes View all
Updated File Comments Rating
04 Jul 2013 Hypervolume Computation Scripts for computing the hypervolume and related stuff. Author: Johannes

Hi Esmond,

Your workaround is not really one that I would use. Rather, you should make sure that you use that same upper bound reference point during the optimization. This way, the hypervolume will always increase.

15 Apr 2013 Ant System TSP Solver A demo of an Ant System algorithm solving classical Traveling Salesman Problems. Author: Johannes

Hi Zhang, I incorporated the change that you suggested. This was a bug.

27 Feb 2012 Ant System TSP Solver A demo of an Ant System algorithm solving classical Traveling Salesman Problems. Author: Johannes

Hi Chetak, I don't have a point set for Portugal. However, you could construct it yourself using, e.g., the data from

http://www.timegenie.com/latitude_and_longitude/country_coordinates/pt

08 Dec 2011 Hypervolume Computation Scripts for computing the hypervolume and related stuff. Author: Johannes

Hi Jose,

It seems you have found a small bug. Change at line 106 b to ub and it should be fine. I updated the file in this file-exchange (takes a few hours to update, though).

Comments and Ratings on Johannes 's Files View all
Updated File Comment by Comments Rating
09 Oct 2013 Ant System TSP Solver A demo of an Ant System algorithm solving classical Traveling Salesman Problems. Author: Johannes mehdi izri

where is the main program all the files its function file

01 Aug 2013 Hypervolume Computation Scripts for computing the hypervolume and related stuff. Author: Johannes Esmarie Scholtz

I suggest changing lebesgue_2D to this:

function [lm] = lebesgue_2D(F, ub)
% Efficient method for 2D objective function values
L = sortrows(F',1)';
l = length(L(1,:));
orig=ub(2);
lm = 0;
for i = 1:l
lm = lm + (min((L(1,i) - ub(1)),0) * min((L(2,i) - ub(2)),0));
if L(2,i)<=orig
ub(2) = L(2,i);
end
end
end

Please let me know if there is something fundamentally wrong with my change.

01 Aug 2013 Hypervolume Computation Scripts for computing the hypervolume and related stuff. Author: Johannes Esmarie Scholtz

Hi Johannes

I was using your Lebesgue measure for comparing a few algorithm, but when very few (less than 10) points fall below the reference point, the algorithm produces a negative value. Originally I thought the negative values might happen when no points fall below the reference points and that I could simply replace the negative values with zeroes, but that does not seem to be the case.

04 Jul 2013 Hypervolume Computation Scripts for computing the hypervolume and related stuff. Author: Johannes Esmond

Thanks Johannes, I was just logging in to say the same thing - I figured it out for myself! Thanks for the code, very helpful.

04 Jul 2013 Hypervolume Computation Scripts for computing the hypervolume and related stuff. Author: Johannes Johannes

Hi Esmond,

Your workaround is not really one that I would use. Rather, you should make sure that you use that same upper bound reference point during the optimization. This way, the hypervolume will always increase.

Contact us