@article{Salcedo-Sanz:2005:GPEM,
	title = {Meta-Heuristic Algorithms for {FPGA} Segmented Channel
                 Routing Problems with Non-standard Cost Functions},
	author = {Sancho Salcedo-Sanz and Yong Xu and Xin Yao},
	journal = {Genetic Programming and Evolvable Machines},
	month = {December},
	number = {4},
	pages = {359--379},
	volume = {6},
	year = {2005},
	biburl = {http://www.bibsonomy.org/bibtex/2f2d0f72766685f051d19c41f65ab2c4f/brazovayeye},
	abstract = {we present three meta-heuristic approaches for FPGA
                 segmented channel routing problems (FSCRPs) with a new
                 cost function in which the cost of each assignment is
                 not known in advance, and the cost of a solution only
                 can be obtained from entire feasible assignments.
                 Previous approaches to FSCPs cannot be applied to this
                 kind of cost functions, and meta-heuristics are a good
                 option to tackle the problem. We present two hybrid
                 algorithms which use a Hopfield neural network to solve
                 the problem's constraints, mixed with a Genetic
                 Algorithm (GA) and a Simulated Annealing (SA). The
                 third approach is a GA which manages the problem's
                 constraints with a penalty function. We provide a
                 complete analysis of the three metaheuristics, by
                 tested them in several FSCRP instances, and comparing
                 their performance and suitability to solve the FSCRP.},
	issn = {1389-2576}, size = {21 pages}, doi = {doi:10.1007/s10710-005-3295-z},
	keywords = {FPGAs, algorithms, annealing architecture, channel evolvable genetic hardware, hybrid segmented simulated }
}