Authors: Zhi Qiang Xie, Jing Yang, Yu Jing He, Guang Jie Ye
Abstract: Aiming at the dynamic integrated scheduling problem of complex multi-products with different arriving time and identical machines, an algorithm is presented by this paper that complex multi-products can be built a virtual manufacturing tree. And the tree will be divided into many subtrees according to the subsection idea. Then these subtrees will be divided into dependent operations and independent operations. Corresponding scheduling strategy is put forward according to the features of operations and the complementarities of identical machines. For dependent operations, forward greedy rule is mainly adopted. For the independent operations, this paper mainly adopts the optimum scheduling rule. Example shows that favorable results can be obtained according to scheduling strategy adopted by this paper.
897
Authors: Bei Zhan Wang, Xiang Deng, Wei Chuan Ye, Hai Fang Wei
Abstract: The particle swarm optimization (PSO) algorithm is a new type global searching method, which mostly focus on the continuous variables and little on discrete variables. The discrete forms and discretized methods have received more attention in recent years. This paper introduces the basic principles and mechanisms of PSO algorithm firstly, then points out the process of PSO algorithm and depict the operation rules of discrete PSO algorithm. Various improvements and applications of discrete PSO algorithms are reviewed. The mechanisms and characteristics of two different discretized strategies are presented. Some development trends and future research directions about discrete PSO are proposed.
1787
Authors: Fang Li, Yu Wang, Ying Chun Zhong, Zhi Tan
Abstract: 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
Abstract: This paper presents a hybrid algorithm to address the flexible job-shop scheduling problem (FJSP). Based on Differential Evolution (DE), a global search method is introduced in the hybrid algorithm, where variations are made to the mutation and crossover operators in DE, according to the quantum rotation gate. And an Interchange-based local search method is further adopted in the proposed algorithm to gain a better performance. Experiments are performed to show the efficiency of the proposed algorithm.
502
Authors: Sun Xin Wang, Yan Li, Yan Rong Zhang
Abstract: 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
