Method generateSol2

biteopt.h:661–707

	 */

	void generateSol2( CBiteRnd& rnd )
	{
		ptype* const Params = TmpParams;

		const CBitePop& ParPop = *this;
		const int ParPopSize = ParPop.getCurPopSize();
		const int ParPopSize1 = ParPopSize - 1;

		const int si1 = getMinSolIndex( 1, rnd, ParPopSize );
		const ptype* const rp1 = ParPop.getParamsOrdered( si1 );
		const ptype* const rp3 = ParPop.getParamsOrdered( ParPopSize1 - si1 );

		const int si2 = 1 + rnd.getInt( ParPopSize1 );
		const ptype* const rp2 = ParPop.getParamsOrdered( si2 );

		const int si4 = rnd.getSqrInt( ParPopSize );
		const ptype* const rp4 = ParPop.getParamsOrdered( si4 );
		const ptype* const rp5 = ParPop.getParamsOrdered( ParPopSize1 - si4 );

		// The "step in the right direction" (Differential Evolution
		// "mutation") operation towards the best (minimal) and away from
		// the worst (maximal) parameter vector, plus a difference of two
		// random vectors.

		const int Mode = select( Gen2ModeSel, rnd );
		int i;

		if( Mode == 0 )
		{
			for( i = 0; i < ParamCount; i++ )
			{
				Params[ i ] = rp1[ i ] + ((( rp2[ i ] - rp3[ i ]) +
					( rp4[ i ] - rp5[ i ])) >> 1 );
			}
		}
		else
		{
			const ptype* const rp1b = ParPop.getParamsOrdered(
				rnd.getSqrInt( ParPopSize ));

			for( i = 0; i < ParamCount; i++ )
			{
				Params[ i ] = (( rp1[ i ] + rp1b[ i ]) +
					( rp2[ i ] - rp3[ i ]) + ( rp4[ i ] - rp5[ i ])) >> 1;
			}
		}
	}

	/**
	 * An alternative "Differential Evolution"-based solution generator.