We propose a new constructive algorithm, called HAPE3 D, which is a heuristic algorithm based on the principle of minimum total potential energy for the 3D irregular packing problem, involving packing a set of irregul...We propose a new constructive algorithm, called HAPE3 D, which is a heuristic algorithm based on the principle of minimum total potential energy for the 3D irregular packing problem, involving packing a set of irregularly shaped polyhedrons into a box-shaped container with fixed width and length but unconstrained height. The objective is to allocate all the polyhedrons in the container, and thus minimize the waste or maximize profit. HAPE3 D can deal with arbitrarily shaped polyhedrons, which can be rotated around each coordinate axis at different angles. The most outstanding merit is that HAPE3 D does not need to calculate no-fit polyhedron(NFP), which is a huge obstacle for the 3D packing problem. HAPE3 D can also be hybridized with a meta-heuristic algorithm such as simulated annealing. Two groups of computational experiments demonstrate the good performance of HAPE3 D and prove that it can be hybridized quite well with a meta-heuristic algorithm to further improve the packing quality.展开更多
强调了激活函数在ANN设计中的重要性,提出一种基于构造性设计及GA的网络结构及神经元激活函数类型自动优化的ANN模型(constructived and GA based activation function,简称为CGBAF),并给出其一般形式和算法.本模型用于多层前向神经网络...强调了激活函数在ANN设计中的重要性,提出一种基于构造性设计及GA的网络结构及神经元激活函数类型自动优化的ANN模型(constructived and GA based activation function,简称为CGBAF),并给出其一般形式和算法.本模型用于多层前向神经网络时,其网络结构及激活函数类型可自动优化,进而可大大提高ANN的泛化能力.通过例子验证了本方法的有效性,并进行了分析.展开更多
基金supported by the Natural Science Foundation of Guangdong Province,China(No.S2013040016594)the Natural Science Foundation of Liaoning Province,China(No.201102164)the Fundamental Research Funds for the Central Universities,China(No.2013ZM0124)
文摘We propose a new constructive algorithm, called HAPE3 D, which is a heuristic algorithm based on the principle of minimum total potential energy for the 3D irregular packing problem, involving packing a set of irregularly shaped polyhedrons into a box-shaped container with fixed width and length but unconstrained height. The objective is to allocate all the polyhedrons in the container, and thus minimize the waste or maximize profit. HAPE3 D can deal with arbitrarily shaped polyhedrons, which can be rotated around each coordinate axis at different angles. The most outstanding merit is that HAPE3 D does not need to calculate no-fit polyhedron(NFP), which is a huge obstacle for the 3D packing problem. HAPE3 D can also be hybridized with a meta-heuristic algorithm such as simulated annealing. Two groups of computational experiments demonstrate the good performance of HAPE3 D and prove that it can be hybridized quite well with a meta-heuristic algorithm to further improve the packing quality.
文摘强调了激活函数在ANN设计中的重要性,提出一种基于构造性设计及GA的网络结构及神经元激活函数类型自动优化的ANN模型(constructived and GA based activation function,简称为CGBAF),并给出其一般形式和算法.本模型用于多层前向神经网络时,其网络结构及激活函数类型可自动优化,进而可大大提高ANN的泛化能力.通过例子验证了本方法的有效性,并进行了分析.
