Tmp - Revision history

Root: /* Prerequisites */

2007-04-09T15:12:23Z

Prerequisites

← Older revision		Revision as of 15:12, 9 April 2007
Line 7:		Line 7:
	In this lesson, we push the abilities we have gained to the limit! We link two code libraries, namely, Evolving objects -- a versatile genetic algorithm code and EPAnet (toolkit) a pipe network calculation model by writing some relatively simple code and create a running program. The following section explains the problem we have selected to solve (please note that the problem itself is of secondary importance here, what we are trying to do is to hone the skills we have gained and build confidence to attack bigger coding projects).		In this lesson, we push the abilities we have gained to the limit! We link two code libraries, namely, Evolving objects -- a versatile genetic algorithm code and EPAnet (toolkit) a pipe network calculation model by writing some relatively simple code and create a running program. The following section explains the problem we have selected to solve (please note that the problem itself is of secondary importance here, what we are trying to do is to hone the skills we have gained and build confidence to attack bigger coding projects).

	You can download the set of files needed for this exercise from : [[Image:cbcpp_EO.~~zip~~\|EO.~~zip~~]].		You can download the set of files needed for this exercise from : [[Image:cbcpp_EO.rar\|EO.rar]].

	==Problem==		==Problem==

Root: /* Putting it all together -- Optimization and EPAnet */

2007-04-09T12:14:23Z

Putting it all together -- Optimization and EPAnet

← Older revision		Revision as of 12:14, 9 April 2007
Line 6:		Line 6:
	# A basic understanding of Genetic Algorithms (Follow these links: [http://en.wikipedia.org/wiki/Genetic_Algorithm],[http://cs.felk.cvut.cz/~xobitko/ga/],[http://math.hws.edu/xJava/GA/] and spend some time if not.)		# A basic understanding of Genetic Algorithms (Follow these links: [http://en.wikipedia.org/wiki/Genetic_Algorithm],[http://cs.felk.cvut.cz/~xobitko/ga/],[http://math.hws.edu/xJava/GA/] and spend some time if not.)
	In this lesson, we push the abilities we have gained to the limit! We link two code libraries, namely, Evolving objects -- a versatile genetic algorithm code and EPAnet (toolkit) a pipe network calculation model by writing some relatively simple code and create a running program. The following section explains the problem we have selected to solve (please note that the problem itself is of secondary importance here, what we are trying to do is to hone the skills we have gained and build confidence to attack bigger coding projects).		In this lesson, we push the abilities we have gained to the limit! We link two code libraries, namely, Evolving objects -- a versatile genetic algorithm code and EPAnet (toolkit) a pipe network calculation model by writing some relatively simple code and create a running program. The following section explains the problem we have selected to solve (please note that the problem itself is of secondary importance here, what we are trying to do is to hone the skills we have gained and build confidence to attack bigger coding projects).

			You can download the set of files needed for this exercise from : [[Image:cbcpp_EO.zip\|EO.zip]].

	==Problem==		==Problem==

Root: /* A touch of sophistication -- let's get rid of hard coding */

2007-04-09T12:12:52Z

A touch of sophistication -- let's get rid of hard coding

← Older revision		Revision as of 12:12, 9 April 2007
Line 504:		Line 504:
	int index=-1;		int index=-1;
	char tmp[MAX_LABEL_LEN]; // this gimmick here is to convet a c++ string to a c style char*		char tmp[MAX_LABEL_LEN]; // this gimmick here is to convet a c++ string to a c style char*
	~~strcpy_s~~(tmp,pipes[i].c_str()); // because epanet is writtin in old c, which does not accept strings.		strcpy(tmp,pipes[i].c_str()); // because epanet is writtin in old c, which does not accept strings.
	ret=ENgetlinkindex(tmp,&index);		ret=ENgetlinkindex(tmp,&index);
	//cout << "At opening Epanet retured : "<<ret<<'\n';		//cout << "At opening Epanet retured : "<<ret<<'\n';
Line 518:		Line 518:
	int index=-1;		int index=-1;
	char tmp[MAX_LABEL_LEN]; // convert c++ string to c style char*		char tmp[MAX_LABEL_LEN]; // convert c++ string to c style char*
	~~strcpy_s~~(tmp,nodes[i].c_str());		strcpy(tmp,nodes[i].c_str());
	ret=ENgetnodeindex(tmp,&index);		ret=ENgetnodeindex(tmp,&index);
	float value;		float value;
Line 554:		Line 554:
	;<tt>RealEA.cpp</tt>:		;<tt>RealEA.cpp</tt>:
	<source lang=cpp>		<source lang=cpp>
			#define _CRT_SECURE_NO_DEPRECATE
			//above is to get rid of deprecation warnings of Microsoft compiler. Needed because we use strcpy() function.
	#include <iostream>		#include <iostream>

	#include <es/make_real.h>		#include <es/make_real.h>
	#include "real_value.h"		#include "real_value.h"

Root: /* A touch of sophistication -- let's get rid of hard coding */

2007-04-09T12:03:32Z

A touch of sophistication -- let's get rid of hard coding

← Older revision		Revision as of 12:03, 9 April 2007
Line 386:		Line 386:

	==A touch of sophistication -- let's get rid of hard coding==		==A touch of sophistication -- let's get rid of hard coding==
			{{Wbox\|This section is here mostly for the sake of completion. Ignore this section if you don't have time or inclination.}}
	We can change the behavior of the GA without recompiling the code, thanks to the sophistication of the design of EO library. However, we have given up some of this flexibility in the way we have designed our cost function. We have hard coded a number of items:		We can change the behavior of the GA without recompiling the code, thanks to the sophistication of the design of EO library. However, we have given up some of this flexibility in the way we have designed our cost function. We have hard coded a number of items:
	# Name of the network file.		# Name of the network file.

Root: /* Putting it all together -- Optimization and EPAnet */

2007-04-09T12:02:18Z

Putting it all together -- Optimization and EPAnet

← Older revision		Revision as of 12:02, 9 April 2007
Line 1:		Line 1:
	=Putting it all together -- Optimization and EPAnet=		=Putting it all together -- Optimization and EPAnet=
	{{~~hbox~~\| This section contains some advanced stuff. Don't be discouraged if you don't understand all and difficult to complete it without the help of somebody else.}}		{{box\|This section contains some advanced stuff. Don't be discouraged if you don't understand all and difficult to complete it without the help of somebody else.}}
	==Prerequisites==		==Prerequisites==
	# You should have completed the C++ programming primer preceeding this section.		# You should have completed the C++ programming primer preceeding this section.

Root: /* Putting it all together -- Optimization and EPAnet */

2007-04-09T12:02:05Z

Putting it all together -- Optimization and EPAnet

← Older revision		Revision as of 12:02, 9 April 2007
Line 1:		Line 1:
	=Putting it all together -- Optimization and EPAnet=		=Putting it all together -- Optimization and EPAnet=
			{{hbox\| This section contains some advanced stuff. Don't be discouraged if you don't understand all and difficult to complete it without the help of somebody else.}}
	==Prerequisites==		==Prerequisites==
	# You should have completed the C++ programming primer preceeding this section.		# You should have completed the C++ programming primer preceeding this section.

Root: /* A touch of sophistication -- let's get rid of hard coding */

2007-04-09T12:00:31Z

A touch of sophistication -- let's get rid of hard coding

← Older revision		Revision as of 12:00, 9 April 2007
Line 442:		Line 442:
	char file[MAX_PATH_LEN];		char file[MAX_PATH_LEN];
	char rept[MAX_PATH_LEN];		char rept[MAX_PATH_LEN];
	vector<string> nodes;		vector<string> nodes; // notice, now we use vectors instead of traditional arrays.
	vector<string> pipes;		vector<string> pipes;

Line 450:		Line 450:


			/** read the text file specified by filename argument and obtain epanet related parameters */
	void parse_epanet_para(char* filename){		void parse_epanet_para(char* filename){
	cout << "I read epanet related data from "<<filename<<"\n";		cout << "I read epanet related data from "<<filename<<"\n"; // inform the user
	//open the file		//open the file
	ifstream myfile (filename);		ifstream myfile (filename);
	if(!myfile.is_open()){		if(!myfile.is_open()){ // this is important.
	cout << "I can not open the file:"<<filename <<" I quit!!\n";		cout << "I can not open the file:"<<filename <<" I quit!!\n";
	exit(1);		exit(1);
	}		}
	myfile >> file; //read the name of the file		myfile >> file; //read the name of the file
	myfile >> rept; //read the name of the file		myfile >> rept; //read the name of the (new) report file
	myfile >> npipes;		myfile >> npipes; //number of pipes
	for(int i=0;i<npipes;i++){		for(int i=0;i<npipes;i++){ // read those pipe ids
	char tmp[MAX_LABEL_LEN];		char tmp[MAX_LABEL_LEN];
	myfile >> tmp;		myfile >> tmp;
	pipes.push_back(tmp);		pipes.push_back(tmp);
	}		}
	myfile >> nnodes;		myfile >> nnodes; //number of junctions
	for(int i=0;i<nnodes;i++){		for(int i=0;i<nnodes;i++){//those ids
	char tmp[MAX_LABEL_LEN];		char tmp[MAX_LABEL_LEN];
	myfile >> tmp;		myfile >> tmp;
	nodes.push_back(tmp);		nodes.push_back(tmp);
	}		}







	}		}


	double real_value(const std::vector<double>& _ind)		double real_value(const std::vector<double>& _ind)
Line 509:		Line 501:
	for(unsigned int i=0;i<npipes;i++){		for(unsigned int i=0;i<npipes;i++){
	int index=-1;		int index=-1;
	char tmp[MAX_LABEL_LEN];		char tmp[MAX_LABEL_LEN]; // this gimmick here is to convet a c++ string to a c style char*
	strcpy_s(tmp,pipes[i].c_str());		strcpy_s(tmp,pipes[i].c_str()); // because epanet is writtin in old c, which does not accept strings.
	ret=ENgetlinkindex(tmp,&index);		ret=ENgetlinkindex(tmp,&index);
	//cout << "At opening Epanet retured : "<<ret<<'\n';		//cout << "At opening Epanet retured : "<<ret<<'\n';
Line 523:		Line 515:
	for(unsigned int i=0;i<nnodes;i++){		for(unsigned int i=0;i<nnodes;i++){
	int index=-1;		int index=-1;
	char tmp[MAX_LABEL_LEN];		char tmp[MAX_LABEL_LEN]; // convert c++ string to c style char*
	strcpy_s(tmp,nodes[i].c_str());		strcpy_s(tmp,nodes[i].c_str());
	ret=ENgetnodeindex(tmp,&index);		ret=ENgetnodeindex(tmp,&index);
Line 540:		Line 532:

	}		}



	void epanet_init(){		void epanet_init(){

Root: /* A touch of sophistication -- let's get rid of hard coding */

2007-04-09T11:56:30Z

A touch of sophistication -- let's get rid of hard coding

← Older revision		Revision as of 11:56, 9 April 2007
Line 621:		Line 621:

	eoParser parser(argc, argv); // for user-parameter reading		eoParser parser(argc, argv); // for user-parameter reading
			eoState state;
	eoState state; ~~// keeps all things allocated~~

	~~///// FIRST, problem or representation dependent stuff~~
	~~//////////////////////////////////////////////////////~~

	~~// The evaluation fn - encapsulated into an eval counter for output~~
	eoEvalFuncPtr<EOT, double, const std::vector<double>&>		eoEvalFuncPtr<EOT, double, const std::vector<double>&>
	mainEval( real_value );		mainEval( real_value );
	eoEvalFuncCounter<EOT> eval(mainEval);		eoEvalFuncCounter<EOT> eval(mainEval);

	~~// the genotype - through a genotype initializer~~
	eoRealInitBounded<EOT>& init = make_genotype(parser, state, EOT());		eoRealInitBounded<EOT>& init = make_genotype(parser, state, EOT());

	// Build the variation operator (any seq/prop construct)		// Build the variation operator (any seq/prop construct)
	eoGenOp<EOT>& op = make_op(parser, state, init);		eoGenOp<EOT>& op = make_op(parser, state, init);

	~~//// Now the representation-independent things~~
	~~//////////////////////////////////////////////~~

	// initialize the population - and evaluate		// initialize the population - and evaluate
	// yes, this is representation indepedent once you have an eoInit		// yes, this is representation indepedent once you have an eoInit
Line 650:		Line 637:
	// algorithm (need the operator!)		// algorithm (need the operator!)
	eoAlgo<EOT>& ea = make_algo_scalar(parser, state, eval, checkpoint, op);		eoAlgo<EOT>& ea = make_algo_scalar(parser, state, eval, checkpoint, op);

	~~///// End of construction of the algorith~~
	~~/////////////////////////////////////////~~
	// to be called AFTER all parameters have been read!!!		// to be called AFTER all parameters have been read!!!
	make_help(parser);		make_help(parser);

	~~//// GO~~
	~~///////~~
	// evaluate intial population AFTER help and status in case it takes time		// evaluate intial population AFTER help and status in case it takes time
	apply<EOT>(eval, pop);		apply<EOT>(eval, pop);

Root: /* A touch of sophistication -- let's get rid of hard coding */

2007-04-09T11:54:53Z

A touch of sophistication -- let's get rid of hard coding

← Older revision		Revision as of 11:54, 9 April 2007
Line 573:		Line 573:
	int main_function(int argc, char* argv[]);		int main_function(int argc, char* argv[]);

			/** Notice that we have moved everything that was previously in main() to
			main_function.
			Now before GA related stuff is handled (by main_function),
			We process the command argument list. Unlike the previous case, now the first argument, i.e.
			the filename of the EPAnet related parameters, is mandatory.
			Then we copy the rest of the arguments in argv to a new array argv_ and pass it to main_function.
			From the GA viewpoint, nothing has changed. It receives a argument array. If there are no arguments in it, GA will
			run with default parameters. Otherwise it will parse the argument array.
			The first command line argument is separately passed parse_epanet_para function.
			*/
	int main(int argc,char *argv[]){		int main(int argc,char *argv[]){
			/* argv[0] is always the name of the program. So, to run properly the program should have
			length of argv (i.e. argc) >=2
			If this is not the case, provide some help. */
	if(argc<2){// no arguments provided at the command line		if(argc<2){// no arguments provided at the command line
	cout << "Usage: argv[0] <epanet_related_datafile> <EO related arguments ...>\n";		cout << "Usage: argv[0] <epanet_related_datafile> <EO related arguments ...>\n";
Line 587:		Line 600:
	exit(1);		exit(1);
	}		}
	char* filename=argv[1];		char* filename=argv[1]; // seperately copy argv[1] (first argument) to variable filename
	char* argv_[MAX_PATH_LEN];		char* argv_[MAX_PATH_LEN];
	argv_[0]=argv[0];		argv_[0]=argv[0]; // argv[0] is the calling program name, copy this as is.
	for(int i=1;i<argc-1;i++){		for(int i=1;i<argc-1;i++){ // then copy the rest (argv[2], argv[3], ...) of arguments to new array
	cerr << argv[i+1];		cerr << argv[i+1];
	argv_[i]=argv[i+1];		argv_[i]=argv[i+1];
	}		}
	argc--;		argc--; // argc should be one less than before
	//now parse the parameter file stright away!		//now parse the parameter file stright away!
	parse_epanet_para(filename);		parse_epanet_para(filename);
	return main_function(argc,argv_);		return main_function(argc,argv_); // now call main_function with new argc, argv_ pair.
	}		}
	int main_function(int argc, char* argv[])		int main_function(int argc, char* argv[])

Root: /* A touch of sophistication -- let's get rid of hard coding */

2007-04-09T11:34:13Z

A touch of sophistication -- let's get rid of hard coding

← Older revision		Revision as of 11:34, 9 April 2007
Line 446:		Line 446:

	double dia_cost_factor=1.; //some factor so that cost=length=diameter*factor (lets keep things simple!)		double dia_cost_factor=1.; //some factor so that cost=length=diameter*factor (lets keep things simple!)
	double pressue_cost_factor=1000000; //multiplier to 'map' pressue defficiency to cost. cost=(pressuredefficiency)*pmult		double pressue_cost_factor=1000000; //multiplier to 'map' pressue defficiency to cost.
			// cost=(pressuredefficiency)*pmult