作者: Ying Lin Li, Man Liang Qiu, Lian He Yang

摘要: In view of the defect and shortage in cutting path automatic optimization of 2D pattern pieces in current garment automatic cutter, a new optimization method of computer is explored. If there is no cutting path optimization implemented by garment automatic cutter before cutting, some problems will be caused, such as too much unless travel and too long processing time. At present, both at home and abroad, the studies on automatic optimization in cutting preprocessing are relatively weak. According to the “segment cutting from left to right” feature of automatic cutter in cutting process, an algorithm which can be summarized as “segment and reducing point” was proposed. This algorithm combined with the solution of shortest path problem, its purpose is to seek for the approximate optimal solution of cutting path. The algorithm implemented through Visual C++ 6.0 programming. Used in production by enterprise shows that the program is simple to operate, and has a high compute speed. Averagely, unless travel in cutting process reduced more than 10%. It proves that the algorithm is feasible and efficient. Using this algorithm achieved the purpose of reducing unless travel, improving cutting efficiency and lowering the cost.

973

作者: Hui Qin Sun, Zhi Hong Xue, Ke Jun Sun, Su Zhi Wang, Yun Du

摘要: BP neural network is currently the most widely used of neural network models in practical application in transformer fault diagnosis. BP algorithm is a local search algorithm which is easy to make the network into the local minimum values. Network training results are poor. It discusses PSO-BP algorithm which combines the particle swarm optimization (PSO) algorithm with the BP algorithm in this paper. It uses PSO algorithm to optimize the BP network’s weights and threshold. It is used in power transformer fault diagnosis. Experimental data results show that PSO-BP network fault diagnosis accuracy is higher than BP algorithm.

789

摘要: A new algorithms for parameters of an image irregular boundary circle parameters is presented, which is based on “Curve-Approximate Method” .For a set of an image circle boundary points by image pre-processing, firstly this paper introduces a substitute variant curve approximate reputably while picking out the irregular boundary points in all points, until to fit the terminate condition. Finally, it succeeds to get the optimal estimation of parameters of a circle. Example show that the algorithms runs more quickly and automatically than traditional generalized hough transform, and a good result is obtained if the irregular boundary points is small proportion in all points of a circle.

639

作者: Fang Li, Yu Wang, Ying Chun Zhong, Zhi Tan

摘要: An optimization of multi-varieties and small-batch of production scheduling is proposed, which is embodied the utilization ratio of equipment. First, the production scheduling model with multi-varieties and small-batch is improved by adding a new constraint. Second, the feeding behavior, clustering and rear collision of artificial fish algorithm are improved in order to describe the multi-varieties and small-batch of production scheduling. Finally, the optimizing results influenced by iteration times and quantity of artificial fish are analyzed. The experiments show that the utilization ratio of equipments are nearly same and the Man Hour is decreased obviously while the optimization method is used, which testifies the validity of the new optimization method.

3177

作者: Sun Xin Wang, Yan Li, Yan Rong Zhang

摘要: In this paper a hybrid algorithm named IPSO-VND is proposed and applied to solving the vehicle routing problem with simultaneous pickup and delivery (VRPSPD). The IPSO-VND algorithm combines two meta-heuristics: Improved Particle Swarm Optimization (IPSO) is used to find a group of excellent solutions, and then the Variable Neighborhood Descent (VND) is implemented to deeply search to achieve the optimal solution around these solutions. During the IPSO procedure, in order to make up for the change of a particle’s position, a velocity component is added to the movement of any particle which has been optimized or made feasible. During the VND procedure, three different neighborhood structures: insertion, swap and cross are successively used. Computational results on the benchmark problems show that our IPSO-VND algorithm is effective.

2326