Home | Trees | Indices | Help |
---|
|
object --+ | DataStructure
class DataStructure() - defines basic data structure interface Used by Optimization Algorithms to access the implemented data structure subclasses. The needed module data is obtained using the Benchmark class. The most important variable is data, which stores the benchmark information. It's format is as following: data = {modulename : [moduletype, dimensions, connections] where dimensions is a list and connections is a dictionary.
|
|||
|
|||
|
|||
abstract_solutions |
|
||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
Inherited from |
|
|||
|
|
|||
MODULETYPE = 0
|
|||
DIMENSIONS = 1
|
|||
CONNECTIONS = 2
|
|||
ORIGINAL = 0
|
|||
ROTATED = 1
|
|||
name =
|
|
|||
Inherited from |
|
x.__init__(...) initializes x; see x.__class__.__doc__ for signature
|
benchmark ... sets benchmark which is currently used Loading benchmark into data structure. So all the important informations (e.g., number of modules, dimensions, ...) can be used. |
abstract_solutions ... list of all possible abstract solutions This method generates all possible abstract solutions. The returned format is strongy dependend on the underlying data structure. When benchmarks with a big number of modules is loaded very long computation and intense memory and processor usage can occur!
|
number ranges between 0 and num_representations-1 global mapping method to get a specific representation out of all the abstract representations. Not optimal, cause its used very often to generate the solution space. So take care! |
OBSOLETE!!! assuming seperate lists, sequences, etc. (e.g., representations = (locii1_permutations, locii2_permutations)) so that a for each element in each part of the datastructrure the combination which each other element combination of the other parts is assumed to be the abstract_solution. This is done due to lower memory usage. |
returns packing in dict format packing = {'name' : [x, y, z, w, h, d], ...} |
Calculate and return costs of current representation applied to benchmark. criteria ... cost evaluation criteria to calculate, list return_packing ... if True also return packing costs ... return a list of costs This pre-implemented cost_evaluation can be used data structure independent. But for some specific data structures it could be possible to optimize the evaluation by using internal information. Supported criteria listed in COST_CRITERIA_LIST. Short names are used. Parameter criteria is in list format. !!Instead of changing calculation of existent criteria, add a new one!! Weights and cost factors have to be implemented inside optimization. |
returns a dict of possible operations onto a abstract solution {'name' : [function, globality_factor]} globality_factor ... the higher, the bigger is the solution change this factor is given by the authors but it also can be determined in test runs evaluation the cost influences caused by applying the according function. |
Merge two representations into all possible children. Typically, used for genetic and/or evolutionary algorithms. Returns a list with all possible children. |
Home | Trees | Indices | Help |
---|
Generated by Epydoc 3.0.1 on Wed Apr 27 17:47:09 2011 | http://epydoc.sourceforge.net |