changhe160 / ofec_alpha Goto Github PK

View Code? Open in Web Editor NEW

6.0 6.0 4.0 37.09 MB

A major update

C++ 97.68% Makefile 0.07% C 0.38% CMake 1.86%

cplusplus evolutionary-computation parallel-computing

ofec_alpha's People

Contributors

Stargazers

Watchers

Forkers

cugzhouli elf-diao strawberry9583 hinzhuo

ofec_alpha's Issues

call classical_orthonormalize for the orthogonalization in Suganthan's test suites

this method is used only for suganthan's suites, and we can remove the method below: classical_generate_rotation

OFEC_Alpha/utility/matrix.cpp

Lines 175 to 191 in c366d7b

    
           	void matrix::generate_rotation(normal *rand, double CondiNum) { 
        
           		/*P. N. Suganthan, N. Hansen, J. J. Liang, K. Deb, Y.-P. Chen, A. Auger and S. Tiwari, 
        
           		"Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter 
        
           		Optimization", Technical Report, Nanyang Technological University, Singapore, May 2005 AND KanGAL 
        
           		Report #2005005, IIT Kanpur, India.*/ 
        
           		matrix ortholeft(m_row_size), orthoright(m_row_size), diagonal(m_row_size); 
        
           		ortholeft.randomize(rand); 
        
           		ortholeft.orthonormalize(); 
        
           		orthoright.randomize(rand); 
        
           		orthoright.orthonormalize(); 
        
           		diagonal.diagonalize(rand, CondiNum); 
        
           		ortholeft *= diagonal; 
        
           		ortholeft *= orthoright; 
        
           		*this = ortholeft; 
        
           		m_is_det_flag = false; 
        
           	}

epa的编码为什么从typevar继承下来

OFEC_Alpha/instance/problem/realworld/EPANET/epa_encoding.h

Line 64 in 80ca4c8

struct epa_type : typevar {

Add the origin of this method, check it from the old platform

OFEC_Alpha/utility/matrix.cpp

Lines 138 to 157 in c366d7b

    
           void matrix::diagonalize(normal * rand, double CondiNum) { 
        
           	if (m_row_size != m_col_size) throw myexcept("can not be diagonal, matrix must be squre@matrix::diagonalize"); 
        
           	double min, max; 
        
           	double *r = new double[m_row_size]; 
        
           	for (int i = 0; i < m_row_size; i++)	r[i] = rand->next_non_standard(1., m_row_size*1.0); 
        
           	min = max = r[0]; 
        
           	for (int i = 0; i < m_row_size; i++) { 
        
           		if (min > r[i])min = r[i]; 
        
           		if (max < r[i]) max = r[i]; 
        
           	} 
        
           	for (int i = 0; i < m_row_size; i++) { 
        
           		for (int j = 0; j < m_col_size; j++) 
        
           			if (j != i) m_row[i][j] = 0.; 
        
           			else m_row[i][j] = pow(CondiNum, (r[i] - min) / (max - min)); 
        
           	} 
        
           	delete[]r; 
        
           	m_is_det_flag = false; 
        
           }

wrong introduction

OFEC_Alpha/core/problem/problem.h

Line 16 in 19c3ee4

* macros used in OFEC

"macros used in OFEC" is the introduction of class definition.

Think about how to hit the first non-dominated value as quickly as possible. Remember the hint I told you yesterday!

OFEC_Alpha/utility/NDS/LinkSort.cpp

Line 126 in 43b7817

for (int i = 0; i < N; ++i)

class problem's member function `variable_distance`

The pure virtual member function variable_distance() of class problem has a const property which i think should be removed.
In class travelling_sales_man, variable_distance() need to change the value of mvv_solut.
I think some other member functions' const property could also be removed.

dominance graph

@Changhe160

issues of num_optima_found()

OFEC_Alpha/core/problem/optima.h

Line 186 in ea2ffa5

int num_optima_found() const {

it will cause serious error when the problem is not continuous
I removed the function of num_variable_found and num_objective_found, but here you again put them back to the new platform. Something wrong here like the issue above, please remove them as well as num_optima_found, which is not a good implementation neither.
Please check the .second of m_var or m_obj for what you need outside.
For ur is_optimal_objective function, the logic is not totally ok: 1) if you want to check with location information in the case of location of target is known; 2) if not, perform ur current procedures.

a spelling mistake?

OFEC_Alpha/core/problem/problem.h

Line 152 in 19c3ee4

std::stringstream m_paramters;

paramters->parameters

I recommend an open-source C++ benchmarking framework for single-objective evolutionary optimization algorithms. You can find it at https://github.com/yangyongkang2000/SEvoBench.

a bug here, please check m_row_size and m_col_size

OFEC_Alpha/utility/matrix.cpp

Lines 253 to 260 in c366d7b

    
           void matrix::transpose() { 
        
           	std::vector<Vector> temp(m_col_size, Vector(m_row_size)); 
        
           	for (int i = 0; i<m_row_size; i++) 
        
           		for (int j = 0; j<m_col_size; j++) { 
        
           			temp[j][i] = m_row[i][j]; 
        
           		} 
        
           	m_row = std::move(temp); 
        
           }

	void matrix::generate_rotation(normal *rand, double CondiNum) {
	/*P. N. Suganthan, N. Hansen, J. J. Liang, K. Deb, Y.-P. Chen, A. Auger and S. Tiwari,
	"Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter
	Optimization", Technical Report, Nanyang Technological University, Singapore, May 2005 AND KanGAL
	Report #2005005, IIT Kanpur, India.*/

	matrix ortholeft(m_row_size), orthoright(m_row_size), diagonal(m_row_size);
	ortholeft.randomize(rand);
	ortholeft.orthonormalize();
	orthoright.randomize(rand);
	orthoright.orthonormalize();
	diagonal.diagonalize(rand, CondiNum);
	ortholeft *= diagonal;
	ortholeft *= orthoright;
	*this = ortholeft;
	m_is_det_flag = false;
	}

	void matrix::diagonalize(normal * rand, double CondiNum) {
	if (m_row_size != m_col_size) throw myexcept("can not be diagonal, matrix must be squre@matrix::diagonalize");

	double min, max;
	double *r = new double[m_row_size];
	for (int i = 0; i < m_row_size; i++) r[i] = rand->next_non_standard(1., m_row_size*1.0);

	min = max = r[0];
	for (int i = 0; i < m_row_size; i++) {
	if (min > r[i])min = r[i];
	if (max < r[i]) max = r[i];
	}
	for (int i = 0; i < m_row_size; i++) {
	for (int j = 0; j < m_col_size; j++)
	if (j != i) m_row[i][j] = 0.;
	else m_row[i][j] = pow(CondiNum, (r[i] - min) / (max - min));
	}
	delete[]r;
	m_is_det_flag = false;
	}

	void matrix::transpose() {
	std::vector<Vector> temp(m_col_size, Vector(m_row_size));
	for (int i = 0; i<m_row_size; i++)
	for (int j = 0; j<m_col_size; j++) {
	temp[j][i] = m_row[i][j];
	}
	m_row = std::move(temp);
	}

changhe160 / ofec_alpha Goto Github PK

ofec_alpha's People

Contributors

Stargazers

Watchers

Forkers

ofec_alpha's Issues

Recommend Projects

Recommend Topics

Recommend Org