You can subscribe to this list here.
2003 
_{Jan}
(3) 
_{Feb}
(4) 
_{Mar}
(23) 
_{Apr}
(5) 
_{May}
(6) 
_{Jun}
(23) 
_{Jul}
(5) 
_{Aug}
(9) 
_{Sep}
(5) 
_{Oct}
(1) 
_{Nov}
(2) 
_{Dec}
(1) 

2004 
_{Jan}
(3) 
_{Feb}
(3) 
_{Mar}
(1) 
_{Apr}

_{May}
(1) 
_{Jun}
(1) 
_{Jul}
(2) 
_{Aug}
(2) 
_{Sep}
(3) 
_{Oct}
(1) 
_{Nov}

_{Dec}

2005 
_{Jan}
(1) 
_{Feb}
(1) 
_{Mar}
(2) 
_{Apr}
(1) 
_{May}
(2) 
_{Jun}
(5) 
_{Jul}
(6) 
_{Aug}
(4) 
_{Sep}
(6) 
_{Oct}
(4) 
_{Nov}
(4) 
_{Dec}
(8) 
2006 
_{Jan}
(8) 
_{Feb}
(6) 
_{Mar}
(3) 
_{Apr}
(10) 
_{May}
(8) 
_{Jun}
(8) 
_{Jul}
(5) 
_{Aug}
(2) 
_{Sep}
(15) 
_{Oct}
(2) 
_{Nov}
(3) 
_{Dec}
(2) 
2007 
_{Jan}
(14) 
_{Feb}
(16) 
_{Mar}
(23) 
_{Apr}
(8) 
_{May}
(8) 
_{Jun}
(14) 
_{Jul}
(4) 
_{Aug}
(20) 
_{Sep}
(4) 
_{Oct}
(22) 
_{Nov}
(15) 
_{Dec}
(12) 
2008 
_{Jan}
(18) 
_{Feb}
(4) 
_{Mar}
(9) 
_{Apr}
(43) 
_{May}
(36) 
_{Jun}
(28) 
_{Jul}
(17) 
_{Aug}
(10) 
_{Sep}
(25) 
_{Oct}
(4) 
_{Nov}
(9) 
_{Dec}
(10) 
2009 
_{Jan}
(16) 
_{Feb}
(19) 
_{Mar}
(21) 
_{Apr}
(8) 
_{May}
(12) 
_{Jun}
(2) 
_{Jul}
(5) 
_{Aug}
(16) 
_{Sep}
(11) 
_{Oct}
(9) 
_{Nov}
(12) 
_{Dec}
(21) 
2010 
_{Jan}
(44) 
_{Feb}
(23) 
_{Mar}
(9) 
_{Apr}
(1) 
_{May}
(9) 
_{Jun}
(8) 
_{Jul}
(3) 
_{Aug}
(10) 
_{Sep}
(12) 
_{Oct}
(5) 
_{Nov}
(3) 
_{Dec}
(8) 
2011 
_{Jan}
(2) 
_{Feb}
(2) 
_{Mar}
(6) 
_{Apr}
(9) 
_{May}
(5) 
_{Jun}
(1) 
_{Jul}
(1) 
_{Aug}
(3) 
_{Sep}
(2) 
_{Oct}
(1) 
_{Nov}
(5) 
_{Dec}
(9) 
2012 
_{Jan}
(5) 
_{Feb}
(3) 
_{Mar}

_{Apr}
(12) 
_{May}
(23) 
_{Jun}
(5) 
_{Jul}
(12) 
_{Aug}
(1) 
_{Sep}
(7) 
_{Oct}
(4) 
_{Nov}
(2) 
_{Dec}
(2) 
2013 
_{Jan}
(8) 
_{Feb}
(13) 
_{Mar}
(1) 
_{Apr}
(5) 
_{May}
(4) 
_{Jun}
(7) 
_{Jul}
(2) 
_{Aug}
(4) 
_{Sep}
(2) 
_{Oct}
(12) 
_{Nov}

_{Dec}

2014 
_{Jan}
(2) 
_{Feb}

_{Mar}

_{Apr}
(2) 
_{May}
(1) 
_{Jun}

_{Jul}
(6) 
_{Aug}

_{Sep}

_{Oct}

_{Nov}

_{Dec}

S  M  T  W  T  F  S 




1

2

3

4

5

6
(2) 
7
(4) 
8
(1) 
9

10

11

12

13

14
(1) 
15
(2) 
16
(1) 
17

18
(1) 
19

20

21

22

23

24

25

26
(1) 
27
(2) 
28

29

30
(2) 
31
(3) 

From: smartkenny <smartkenny@gm...>  20070831 17:04:38

Thank you, Klaus. That helps a lot. I appreciate your great help. Have a good day. Kenny Klaus Meffert wrote: > Kenny, > > I think you are setting the application data onto the sample gene. But you > have to set it onto a gene within a chromosome of the population. This has > to happen after initializing the population (e.g. b calling > Genotype.randomInitialGenotype). If you want to modify the app.data during > evolution you could do this in your fitness function, e.g. > > You may also look at the new test case in class BaseGeneTest, method > testSetApplicationData_1 (see CVS). There, setting the app.data ist > demonstrated in short. > > Best > > Klaus > > > >> Original Message >> From: jgapusersbounces@... >> [mailto:jgapusersbounces@...] On Behalf >> Of smartkenny >> Sent: Thursday, August 30, 2007 11:12 AM >> To: jgapusers@... >> Subject: [jgapusers] Question about application data >> >> Hi, All >> >> I am trying to use Gene.getApplicationData() and >> Gene.setApplicationData(), but after I generate sampleGenes >> and set application data for each gene, after calling >> population.evolve(), I can't get back the application data in >> FitnessFunction.evaluate() method for the gene of potential >> chromosome. The getApplicationData() will always return null. >> >> Can anybody help me to make it work? Or confirm that >> application data doesn't work at present? >> >> Thank you so much. >> Kenny >> > > > 
From: Klaus Meffert <jgap@kl...>  20070831 16:15:33

Kenny, I think you are setting the application data onto the sample gene. But you have to set it onto a gene within a chromosome of the population. This has to happen after initializing the population (e.g. b calling Genotype.randomInitialGenotype). If you want to modify the app.data during evolution you could do this in your fitness function, e.g. You may also look at the new test case in class BaseGeneTest, method testSetApplicationData_1 (see CVS). There, setting the app.data ist demonstrated in short. Best Klaus > Original Message > From: jgapusersbounces@... > [mailto:jgapusersbounces@...] On Behalf > Of smartkenny > Sent: Thursday, August 30, 2007 11:12 AM > To: jgapusers@... > Subject: [jgapusers] Question about application data > > Hi, All > > I am trying to use Gene.getApplicationData() and > Gene.setApplicationData(), but after I generate sampleGenes > and set application data for each gene, after calling > population.evolve(), I can't get back the application data in > FitnessFunction.evaluate() method for the gene of potential > chromosome. The getApplicationData() will always return null. > > Can anybody help me to make it work? Or confirm that > application data doesn't work at present? > > Thank you so much. > Kenny 
From: Klaus Meffert <jgap@kl...>  20070831 15:58:39

Hello, this class is part of the thirdparty lib JCGRID. You can download it's source from http://jcgrid.sourceforge.net/. Best Klaus Meffert > Original Message > From: jgapusersbounces@... > [mailto:jgapusersbounces@...] On Behalf Of thealy > Sent: Thursday, August 30, 2007 6:40 PM > To: jgapusers@... > Subject: [jgapusers] GridNodeWorkerConfig source > > > Can someone tell me where to find the source for GridNodeWorkerConfig? > > Thanks 
From: thealy <thealy@bn...>  20070830 16:40:14

Can someone tell me where to find the source for GridNodeWorkerConfig? Thanks  View this message in context: http://www.nabble.com/GridNodeWorkerConfigsourcetf4355455.html#a12411238 Sent from the jgapusers mailing list archive at Nabble.com. 
From: smartkenny <smartkenny@gm...>  20070830 09:11:50

Hi, All I am trying to use Gene.getApplicationData() and Gene.setApplicationData(), but after I generate sampleGenes and set application data for each gene, after calling population.evolve(), I can't get back the application data in FitnessFunction.evaluate() method for the gene of potential chromosome. The getApplicationData() will always return null. Can anybody help me to make it work? Or confirm that application data doesn't work at present? Thank you so much. Kenny 
From: thealy <thealy@bn...>  20070827 20:47:37

I'm wrestling with the basic TravellingSalesman.java example to try and understand JGAP in general. I've copied the code into NetBeans so I can use the debugger. I started by pushing up the number of cities so I could play with the number of evolutions, population size, etc. I was attempting to use the setAcceptableCost method when I got stuck. I attempted to set the value to CITIES+1. My results were not consistent at all. So I dragged the Salesman.java into the debugger under my own package, along with SalesmanFitnessFunction. I let the acceptable cost default to 1. I found that the code below (from within findOptimalPath method of Salesman) ALWAYS exits on the first loop since I'm getting best fitness values like 1.073741809E9 in this loop, and acceptable cost is 1 (default). Evolution: for (int i = 0; i < getMaxEvolution(); i++) { population.evolve(); best = population.getFittestChromosome(); >>> if (best.getFitnessValue() >= getAcceptableCost()) { break Evolution; } } // Return the best solution we found. //  return(best); When the sample program exits, it displays the "score" value that seems to be what I really want to compare to my "acceptable cost" i.e if there are 15 cities, I will accept any score < 17 for example. I don't understand what this how this code (from main of TravellingSalesman.java): System.out.println("Score " + (Integer.MAX_VALUE / 2  optimal.getFitnessValue())); Relates to the values like 1.073741809 E9 that I'm seeing in the evolution loop. Sorry if I'm making some bonehead newbie error here, but what am I missing? Thanks, Terry 
From: Klaus Meffert <jgap@kl...>  20070827 20:21:29

Hi Michael, I think JGAP offers what you need. If you look at the Fibonacci example (class Fibonacci, method create()) you will find the setup for individuals with two independent trees (nodeset[0] and nodeset[1]). If you need further information, please come back. Best Klaus _____ From: jgapusersbounces@... [mailto:jgapusersbounces@...] On Behalf Of michi b Sent: Sunday, August 26, 2007 11:42 AM To: jgapusers@... Subject: [jgapusers] system of difference equations Hello, I intend to create a GP System that evolves 'special' systems fo difference equations. I therefore need individuals that are represented by multiple trees (each individual represents a system of difference equations). Does JGAP currently support mulitiple tree individuals or can it easily be extended that way? thank you very much for your help! Best Regards Michael Bergbauer Vienna 
From: michi b <michi9999@gm...>  20070826 09:42:26

Hello, I intend to create a GP System that evolves 'special' systems fo difference equations. I therefore need individuals that are represented by multiple trees (each individual represents a system of difference equations). Does JGAP currently support mulitiple tree individuals or can it easily be extended that way? thank you very much for your help! Best Regards Michael Bergbauer Vienna 
From: Laszlo Illyes <laszlo6783@ya...>  20070818 08:14:50

Hi Ashish, 4. Te accuracy???!!!!!! or OPTIMALITY This is a heuristical algorithm for nonpolinomial problems. U have to deal with an algorithm, that not guarantee the optimal solution, but a good solution. Question is, what is the time U have to run the algorithm. There are more than 100 heuristics for TSP. U search on the Internet, like first 10 heuristics for TSP Your TSP is in Euclidean Plain, or in Graph, or what? There are many problems to deal with it. I think, if your problem formulation is better, we can say more from that. Regards Laszlo Ashish Kulkarni <ashish.kulkarni13@...> wrote: Hi Thanks for the previous answer i came up the following program, can you please take a look and let me know if it is okay, I have some questions though, 1, i hope the alogrithm just considers ABC and not ABCA in distance method. 2, Does this program consider A is starting point? since it is the first element in array "places"? 3, Can i get the actual value of the soluction for example ABC would be 0.5 + 1.0 = 1.5 4, What is the accuracy of this alorithm, i have a situation where i have to find the fastest way between 20 or more places? 5, Can i specify the starting point and end point and let the alogrithm find the best possible points in between. I really appreciate your help Regards Ashish import org.jgap.Chromosome; import org.jgap.Gene; import org.jgap.IChromosome; import org.jgap.impl.IntegerGene; import org.jgap.impl.salesman.Salesman; public class MySalesman extends Salesman { private String [] places =new String[]{"A", "B", "C"}; private String[] fromTo =new String[]{"AB","AC","BA","BC","CA","CB"};; private double[] values = new double[]{0.5, 1.0, 2.0, 1.0, 2.0,1.0}; public MySalesman() { } @Override public IChromosome createSampleChromosome(Object arg0) { try { Gene[] genes = new Gene[places.length]; for (int i = 0; i < genes.length; i++) { genes[i] = new IntegerGene(getConfiguration(), 0, genes.length  1); genes[i].setAllele(new Integer(i)); } IChromosome sample = new Chromosome(getConfiguration(), genes); shuffle(genes); return sample; } catch(Exception exc) { exc.printStackTrace(); } return null; } @Override public double distance(Gene a_from, Gene a_to) { IntegerGene a = (IntegerGene) a_from; IntegerGene b = (IntegerGene) a_to; int A = a.intValue(); int B = b.intValue(); String from = places[A]; String to = places[B]; for(int i=0; i < fromTo.length; i++) { String ft= fromTo[i]; if(ft.equals(from+to)) { return values[i]; } } return 1.0; } public String name (int i) { return places[i]; } /** * @param args */ public static void main(String[] args) { try { MySalesman t = new MySalesman(); System.out.println("Max evalution " + t.getPopulationSize()); IChromosome optimal = t.findOptimalPath(null); System.out.println("Solution: "); Gene result[] = optimal.getGenes(); for(int i=0,size = result.length; i < size; i++) { Gene gene = result[i]; Integer integer = (Integer)(gene.getAllele()); System.out.println( t.name (integer.intValue())); } System.out.println(optimal); System.out.println("Score " + (optimal.getAge())); } catch (Exception ex) { ex.printStackTrace(); } } } On 8/15/07, Klaus Meffert < jgap@...> wrote: Dear Ashish, to your first question (finding the best route ABCD without cycle, in opposite to TSP): In class TravellingSalesman change the function "distance", so that the block if (A == 0 && B == CITIES  1) { return 1; } if (B == 0 && A == CITIES  1) { return 1; } is erased. You then also need to encode the distances between the cities. For that, introduce an array[0..n1,0..n1] with n = Number of CITIES (see variable CITIES in class TravellingSalesman). In the array keep the distance between each pair of cities. Maybe it's necessary to ensure in the "distance" function ( i.e. the fitness function) that not a city is starting and ending point at the same time. Instead of returning abs(AB) (see method "distance") return the distance between city A and B, computed via the newly introduced array. Maybe first try to enhance the TSP example so that it does not rely on a cycle but computed he shortest rout without a cycle. Then introduce the distance array. Best Klaus  From: jgapusersbounces@... [mailto:jgapusersbounces@...] On Behalf Of Ashish Kulkarni Sent: Wednesday, August 15, 2007 5:15 AM To: jgapusers@... Subject: [jgapusers] question with salesman problem Hi I have a situation where i need to find fastest way to visit all the points for example i have point A, B, C, D and i know that AB is 2 AC is 3 AD is 2 BA is 3 BC is 2 BD is 5 and so on so i have to find the fastest way for all possible permutations so the permutations i have is like below ABCD ACBD BACD BCAD and so on I was thinking of using salesman algorithm to solve it, but in salesman, the algorithm it completes a full circlet, like it will consider ABCDA for calculation where as i want it to calculate only ABCD Is it possible to do so? Also i need to find the best soluction for AD, then AC, AB etc this is sort of Simulated Annealing algorithm issue Any Ideas or suggestions Ashish  This SF.net email is sponsored by: Splunk Inc. Still grepping through log files to find problems? Stop. Now Search log events and configuration files using AJAX and a browser. Download your FREE copy of Splunk now >> http://get.splunk.com/_______________________________________________ jgapusers mailing list jgapusers@... https://lists.sourceforge.net/lists/listinfo/jgapusers Laszlo Illyes Teachingassistant Databases, Operational Research Sapientia University (Csikszereda) MiercureaCiuc Tel:+40266317310 Fax:+40266372099 Mobil:+40740055706 Email: illyeslaszlo@... webpage: http://sapientia.siculorum.ro/~illyeslaszlo/  Park yourself in front of a world of choices in alternative vehicles. Visit the Yahoo! Auto Green Center. 
From: Ashish Kulkarni <ashish.kulkarni13@gm...>  20070816 20:12:05

Hi Thanks for the previous answer i came up the following program, can you please take a look and let me know if it is okay, I have some questions though, 1, i hope the alogrithm just considers ABC and not ABCA in distance method. 2, Does this program consider A is starting point? since it is the first element in array "places"? 3, Can i get the actual value of the soluction for example ABC would be 0.5 + 1.0 = 1.5 4, What is the accuracy of this alorithm, i have a situation where i have to find the fastest way between 20 or more places? 5, Can i specify the starting point and end point and let the alogrithm find the best possible points in between. I really appreciate your help Regards Ashish import org.jgap.Chromosome; import org.jgap.Gene; import org.jgap.IChromosome; import org.jgap.impl.IntegerGene; import org.jgap.impl.salesman.Salesman; public class MySalesman extends Salesman { private String [] places =new String[]{"A", "B", "C"}; private String[] fromTo =new String[]{"AB","AC","BA","BC","CA","CB"};; private double[] values = new double[]{0.5, 1.0, 2.0, 1.0, 2.0,1.0}; public MySalesman() { } @Override public IChromosome createSampleChromosome(Object arg0) { try { Gene[] genes = new Gene[places.length]; for (int i = 0; i < genes.length; i++) { genes[i] = new IntegerGene(getConfiguration(), 0, genes.length  1); genes[i].setAllele(new Integer(i)); } IChromosome sample = new Chromosome(getConfiguration(), genes); shuffle(genes); return sample; } catch(Exception exc) { exc.printStackTrace(); } return null; } @Override public double distance(Gene a_from, Gene a_to) { IntegerGene a = (IntegerGene) a_from; IntegerGene b = (IntegerGene) a_to; int A = a.intValue(); int B = b.intValue(); String from = places[A]; String to = places[B]; for(int i=0; i < fromTo.length; i++) { String ft= fromTo[i]; if(ft.equals(from+to)) { return values[i]; } } return 1.0; } public String name (int i) { return places[i]; } /** * @param args */ public static void main(String[] args) { try { MySalesman t = new MySalesman(); System.out.println("Max evalution " + t.getPopulationSize()); IChromosome optimal = t.findOptimalPath(null); System.out.println("Solution: "); Gene result[] = optimal.getGenes(); for(int i=0,size = result.length; i < size; i++) { Gene gene = result[i]; Integer integer = (Integer)(gene.getAllele()); System.out.println(t.name (integer.intValue())); } System.out.println(optimal); System.out.println("Score " + (optimal.getAge())); } catch (Exception ex) { ex.printStackTrace(); } } } On 8/15/07, Klaus Meffert <jgap@...> wrote: > > Dear Ashish, > > to your first question (finding the best route ABCD without cycle, in > opposite to TSP): > In class TravellingSalesman change the function "distance", so that the > block > if (A == 0 && B == CITIES  1) { > return 1; > } > if (B == 0 && A == CITIES  1) { > return 1; > } > is erased. > > You then also need to encode the distances between the cities. For that, > introduce an array[0..n1,0..n1] with n = Number of CITIES (see variable > CITIES in class TravellingSalesman). In the array keep the distance between > each pair of cities. Maybe it's necessary to ensure in the "distance" > function ( i.e. the fitness function) that not a city is starting and > ending point at the same time. > Instead of returning abs(AB) (see method "distance") return the distance > between city A and B, computed via the newly introduced array. > > Maybe first try to enhance the TSP example so that it does not rely on a > cycle but computed he shortest rout without a cycle. Then introduce the > distance array. > Best > > Klaus > > >  > *From:* jgapusersbounces@... [mailto: > jgapusersbounces@...] *On Behalf Of *Ashish Kulkarni > *Sent:* Wednesday, August 15, 2007 5:15 AM > *To:* jgapusers@... > *Subject:* [jgapusers] question with salesman problem > > Hi > I have a situation where i need to find fastest way to visit all the > points > for example > i have point A, B, C, D > and i know that > AB is 2 > AC is 3 > AD is 2 > BA is 3 > BC is 2 > BD is 5 > and so on > > so i have to find the fastest way for all possible permutations > so the permutations i have is like below > > ABCD > ACBD > BACD > BCAD > and so on > > I was thinking of using salesman algorithm to solve it, > but in salesman, the algorithm it completes a full circlet, like it will > consider ABCDA for calculation > where as i want it to calculate only ABCD > Is it possible to do so? > Also i need to find the best soluction for AD, then AC, AB etc > this is sort of Simulated Annealing algorithm issue > Any Ideas or suggestions > > Ashish > > > > > 
From: Klaus Meffert <jgap@kl...>  20070815 19:36:33

Dear Ashish, to your first question (finding the best route ABCD without cycle, in opposite to TSP): In class TravellingSalesman change the function "distance", so that the block if (A == 0 && B == CITIES  1) { return 1; } if (B == 0 && A == CITIES  1) { return 1; } is erased. You then also need to encode the distances between the cities. For that, introduce an array[0..n1,0..n1] with n = Number of CITIES (see variable CITIES in class TravellingSalesman). In the array keep the distance between each pair of cities. Maybe it's necessary to ensure in the "distance" function (i.e. the fitness function) that not a city is starting and ending point at the same time. Instead of returning abs(AB) (see method "distance") return the distance between city A and B, computed via the newly introduced array. Maybe first try to enhance the TSP example so that it does not rely on a cycle but computed he shortest rout without a cycle. Then introduce the distance array. Best Klaus _____ From: jgapusersbounces@... [mailto:jgapusersbounces@...] On Behalf Of Ashish Kulkarni Sent: Wednesday, August 15, 2007 5:15 AM To: jgapusers@... Subject: [jgapusers] question with salesman problem Hi I have a situation where i need to find fastest way to visit all the points for example i have point A, B, C, D and i know that AB is 2 AC is 3 AD is 2 BA is 3 BC is 2 BD is 5 and so on so i have to find the fastest way for all possible permutations so the permutations i have is like below ABCD ACBD BACD BCAD and so on I was thinking of using salesman algorithm to solve it, but in salesman, the algorithm it completes a full circlet, like it will consider ABCDA for calculation where as i want it to calculate only ABCD Is it possible to do so? Also i need to find the best soluction for AD, then AC, AB etc this is sort of Simulated Annealing algorithm issue Any Ideas or suggestions Ashish 
From: Ashish Kulkarni <ashish.kulkarni13@gm...>  20070815 03:15:13

Hi I have a situation where i need to find fastest way to visit all the points for example i have point A, B, C, D and i know that AB is 2 AC is 3 AD is 2 BA is 3 BC is 2 BD is 5 and so on so i have to find the fastest way for all possible permutations so the permutations i have is like below ABCD ACBD BACD BCAD and so on I was thinking of using salesman algorithm to solve it, but in salesman, the algorithm it completes a full circlet, like it will consider ABCDA for calculation where as i want it to calculate only ABCD Is it possible to do so? Also i need to find the best soluction for AD, then AC, AB etc this is sort of Simulated Annealing algorithm issue Any Ideas or suggestions Ashish 
From: Florian Hafner <fhafner@gm...>  20070814 12:44:29

Hi, I'm trying to use JGAP for an application which schedules aircraft to airports. My chromosomes are composite genes and represent indexes, which are linked to individual flights out of a schedule. Essentially I am trying to obtain an optimal sequence of flights in and out of an airport. The chromosomes are not initialized randomly, but are initialized with indexes that point to aircraft which want to arrive around the given time period. The theory here is that my first guess based on the aircraft's scheduled arrival and departure times is far better than a randomly initialized ordering of flights. Now, the basic problem I am running into is that after evolving the population and applying standard Mutation and Crossover operators to it (See configuration options below), I get duplicate values in my final fittest chromosome. For a scheduling application, I cannot have the same aircraft land/depart twice. Is there a way to solve this problem? When chromosomes are reproduced and mutated, are random values produced without looking at existing values in the chromosome? Thanks very much for your help. Florian  Configuration gaConf = new DefaultConfiguration(); gaConf.reset(); gaConf.setPreservFittestIndividual(true); gaConf.setKeepPopulationSizeConstant(false); BestChromosomesSelector bcs = new BestChromosomesSelector(gaConf); gaConf.addNaturalSelector(bcs, true); gaConf.addGeneticOperator(new CrossoverOperator(gaConf,SysConf.CROSSOVER_RATE)); gaConf.addGeneticOperator(new MutationOperator(gaConf,SysConf.MUTATION_RATE)); gaConf.setPopulationSize(SysConf.popSize); 
From: Daniel Rosowski <Daniel.R<osowski@gm...>  20070808 08:39:42

Hi list, I have a question about adding genes to a CompositeGene. Is there a way to add a gene to a specific position, similar to the method setGene(int a_index, Gene a_gene) from BaseChromosome? It's rather important to me, since my algorithm depends on the position of the genes in the CompositeGene. Cheers, Daniel  Ist Ihr Browser Vistakompatibel? Jetzt die neuesten BrowserVersionen downloaden: http://www.gmx.net/de/go/browser 
From: Klaus Meffert <jgap@kl...>  20070807 18:27:24

Daniel, you are rigth with that there is no dedicated method returning all genes within the CompositeGene. I just added a method getGenes() to CompositeGenes, as well as a new unit test Best Klaus > Original Message > From: jgapusersbounces@... > [mailto:jgapusersbounces@...] On Behalf > Of Daniel Rosowski > Sent: Tuesday, August 07, 2007 12:31 PM > To: jgapusers@... > Subject: [jgapusers] getGenes for CompositeGene > > Hello, > > wouldn't it make sense to add a method like getGenes() to the > CompositeGene class that returns an array of all the genes > contained in that CompositeGene? > Right now I have to loop through all the genes by calling geneAt(). > Or did I miss a method here? > > Cheers, > Daniel 
From: Laszlo Illyes <laszlo6783@ya...>  20070807 17:22:31

Hi Daniel, I was interested (and still am I) in Cutting&Packing My system administrator had a problem with the server and my webpage is not reachable. There have I some publications about C&P with genetic algorithms, and also GA for TSP. If You are an ESICUP member, You can see my presentation at the 2nd ESICUP meeting at Southampton. Regards Laszlo Daniel Rosowski <Daniel.Rosowski@...> wrote: Hello to all users and developers of JGAP, at the moment I'm writing my diploma thesis about a problem of the class of the "bin packing problem". Basically I just wanted to say hello to the JGAP folks and congratulate them on this project. I'm sure some questions will pop up in the near future, but right now I'm pretty confident I can solve this problem using JGAP. Wish me luck, but I hope I won't need it ;) Cheers, Daniel  Der GMX SmartSurfer hilft bis zu 70% Ihrer Onlinekosten zu sparen! Ideal für Modem und ISDN: http://www.gmx.net/de/go/smartsurfer  This SF.net email is sponsored by: Splunk Inc. Still grepping through log files to find problems? Stop. Now Search log events and configuration files using AJAX and a browser. Download your FREE copy of Splunk now >> http://get.splunk.com/ _______________________________________________ jgapusers mailing list jgapusers@... https://lists.sourceforge.net/lists/listinfo/jgapusers Laszlo Illyes Teachingassistant Databases, Operational Research Sapientia University (Csikszereda) MiercureaCiuc Tel:+40266317310 Fax:+40266372099 Mobil:+40740055706 Email: illyeslaszlo@... webpage: http://sapientia.siculorum.ro/~illyeslaszlo/  Park yourself in front of a world of choices in alternative vehicles. Visit the Yahoo! Auto Green Center. 
From: Daniel Rosowski <Daniel.R<osowski@gm...>  20070807 10:31:16

Hello, wouldn't it make sense to add a method like getGenes() to the CompositeGene class that returns an array of all the genes contained in that CompositeGene? Right now I have to loop through all the genes by calling geneAt(). Or did I miss a method here? Cheers, Daniel  Der GMX SmartSurfer hilft bis zu 70% Ihrer Onlinekosten zu sparen! Ideal für Modem und ISDN: http://www.gmx.net/de/go/smartsurfer 
From: Daniel Rosowski <Daniel.R<osowski@gm...>  20070807 09:20:09

Hello to all users and developers of JGAP, at the moment I'm writing my diploma thesis about a problem of the class of the "bin packing problem". Basically I just wanted to say hello to the JGAP folks and congratulate them on this project. I'm sure some questions will pop up in the near future, but right now I'm pretty confident I can solve this problem using JGAP. Wish me luck, but I hope I won't need it ;) Cheers, Daniel  Der GMX SmartSurfer hilft bis zu 70% Ihrer Onlinekosten zu sparen! Ideal für Modem und ISDN: http://www.gmx.net/de/go/smartsurfer 
From: Klaus Meffert <jgap@kl...>  20070806 19:03:55

Hi Atul, after reading the instruction PDF, I think it should be possible accomplishing the task with JGAP, i.e. finding a very good solution (possibly not the best one if such exists). Best Klaus _____ From: jgapusersbounces@... [mailto:jgapusersbounces@...] On Behalf Of Atul Yadav Sent: Monday, August 06, 2007 9:30 AM To: jgapusers@... Subject: [jgapusers] Can we solve this problem using GA Hi everybody, I am new to this field of Genetic Algorithms. I have encountered an optimization problem on net and am interested to know whether it can be solved using GA or not. Here is the link to the problem page. http://www.alcyon.co.in/contests/index.html Please help me out with it. Thanks in advance. regards, Atul 
From: Atul Yadav <yadavatul25@gm...>  20070806 07:29:57

Hi everybody, I am new to this field of Genetic Algorithms. I have encountered an optimization problem on net and am interested to know whether it can be solved using GA or not. Here is the link to the problem page. http://www.alcyon.co.in/contests/index.html Please help me out with it. Thanks in advance. regards, Atul 