Genetic algorithms, function optimization, and facility layout design

Article Abstract:

The solution of function optimization problems by genetic algorithms involves the use coding schemes that specify solutions as strings of finite length. The genetic algorithm provides for a search of the solution space by samples of various sectors of the space in parallel. The coding scheme considers area and shape limitations of individual facilities with the facilities on a continuous plane. Moreover, the recursive partitioning mechanism creates precise layouts, thus, eliminating scaling.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems

Article Abstract:

Exact enumerative algorithms were designed to find the optimal solution of a given NP-hard combinatorial optimization problem.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code:

A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems

Article Abstract:

Solution for minimum sum-of-squares clustering problem is derived using an algorithm.

User Contributions:

Comment about this article or add new information about this topic:

Comment:  (50-4000 characters)

Name:

E-mail:

Security Code: