Package ec.steadystate

Examples of ec.steadystate.QueueIndividual

159
160
161
162
163
164
165
166
167
168
169
    // evaluate a regular individual
    public void evaluate(EvolutionState state, Individual ind, int subpopulation, int threadnum)
        {
        if (jobSize > 1 && batchMode == true)    // chunked evaluation mechanism
            {
            queue.add(new QueueIndividual(ind, subpopulation));
            if (queue.size() >= jobSize)
                flush(state, threadnum);
            }
        else    /// ordinary evaluation mechanism 
            evaluate(state, new Individual[] { ind }, new int[] { subpopulation }, threadnum);          
View Full Code Here
177
178
179
180
181
182
183
184
185
186
187
            {
            Individual[] inds = new Individual[queue.size()];
            int[] subpopulations = new int[queue.size()];
            for(int i = 0; i < queue.size(); i++)
                {
                QueueIndividual qind = (QueueIndividual)(queue.get(i));
                inds[i] = qind.ind;
                subpopulations[i] = qind.subpop;
                }
            evaluate(state, inds, subpopulations, threadnum);
            }
View Full Code Here
445
446
447
448
449
450
451
452
453
454
           
            // At any rate, add ALL the individuals that came back to the evaluatedIndividuals LinkedList
            synchronized(evaluatedIndividuals)
                {
                for(int x=0; x<job.inds.length;x++)
                    evaluatedIndividuals.addLast( new QueueIndividual(job.inds[x], job.subPops[x]) );
                notifyMonitor(evaluatedIndividuals);
                }
            }
        }
View Full Code Here
TOP

Related Classes of ec.steadystate.QueueIndividual

  • ec.eval.MasterProblem
  • ec.eval.SlaveMonitor
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.