Research on packing problem based on simulated annealing algorithm;

Based on reality, this article use simulated annealing approach to resolve the packing problem, which is given the initial layout by the heuristic approach.

Based on extensive researches on various heuristic methods, an objective-based heuristic algorithm was developed to solve the 2D rectangle packing problem.

Model and the solving strategy for packing problems;

According to the analysis on packing problems and simulated annealing algorithm, this paper presents a simulated annealing packing algorithm which can be used to solve packing problems.

Heuristic algorithm for solving placement problem with pre-placed rectangles;

By improving the method for placing rectangle based on placement points,the estimation of distribution algorithm(EDA) for two dimensional placement problem is presented.

Thereafter we bring visual degree and abstract degree into genetic algorithm and present a new way of layout problem solution specifically applicable to bornite craftworks.

With the modeling problem of layout items in high dimensional layout problem as the application object, this paper introduces the concept of 2n-tree representation.

According to the idea of Systematic Layout Planning,this paper proposes a bi-criteria mathematic model concerning the material handling costs and nonmaterial relation requirements for a layout problem with fixed lengthways and transverse passageways between sections.

A Novel Neural Network Model for Solving Programming Problems Based on Linear Restraints;