Papers by Author: Yan Wei Zhao

Paper TitlePage

Authors: Wei Bo Yang, Yan Wei Zhao, Jing Jie, Wan Liang Wang
Abstract: Tool-path airtime optimization problem during multi-contour processing in leather cutting is regarded as generalized traveling salesman problem. A hybrid intelligence algorithm is proposed. The improved genetic simulated annealing algorithm is applied to optimize cutting path selected arbitrarily firstly, and an optimal contour sequence is founded, then problem is changed into multi- segment map problem solved with dynamic programming algorithm. The algorithm's process and its various parameters are given simultaneously, and its performance is compared with simulated annealing and standard genetic algorithm alone. The results show that the algorithm is more effective.
373
Authors: W.L. Wang, S.X. Chen, Yan Wei Zhao, J.L. Zhang, H.Y. Wang
Abstract: The plan scheduling is an important part for forming a dynamic alliance on the ASP platform. In order to solve this problem, in the first place, a scheduling model of multi-objectives and multi-enterprise has been developed. The scheduling objectives of this model considered the enterprise credibility, production tasks, production process and the relationship between them. Secondly, a bi-level quantum evolutionary algorithm is provided for this model. One level is the coding of processes that determines the sequence of process. The other level is the coding of bidding enterprise that chooses each procedure of bidding enterprise. This scheduling approach in an ASP platform realizing dynamic alliance production scheduling system has been applied actually. And the approach can get faster convergence and better characteristics.
783
Authors: Wan Liang Wang, F.G. Zhao, Yan Wei Zhao, N. Su, F. Zhang
Abstract: Common platform design for product families is an important step in the modularity field. It is impossible to find the similar components in alterative design stages for the traditional similarity measure used in module division. So, a new common platform design method on extension-distance is presented. In different design environments, three distance concepts are discussed, namely, feature-to-feature, feature-to-set and set-to-set. The first concept will be employed as the base for extension-cluster method in the platform design on the thought of each structure’ s features between two adjacent structure components, while the second is used to build the tolerance-constraint function in the customized components division for the common platform generation. Last the adaptability measure is used to find the optimal case in the database. The method took the gasoline saw as an example.
606
Authors: Yan Wei Zhao, Z.C. Wang, Guo Xiong Zhang
772
Authors: Xin Hua Dai, Wan Liang Wang, Yan Wei Zhao, H.X. Teng
Abstract: Double-workshop mixed chlor-alkali planned model production process is a multi-level multi-product multi-constraint mixed batch planning problem production line model, taking into account the actual production of joint production of dual-workshop mode of production to determine the products and materials at various workshops, various Plan period on the production quantity, at the end of each period to meet the delivery needs of the type and quantity simultaneously, during the product implementation plan the goal of profit maximization. It uses particle swarm algorithm to reach the answer, indicating the feasibility of the method and effectiveness through examples of the calculation.
611
Authors: Yan Wei Zhao, F. Zhang, M.Y. Zhang, Jian Chen, N. Su
Abstract: The interface was regarded as standard and not considered in traditional configuration design, which made it difficult to apply to the existence product configuration. The paper proposes an extension case-based reasoning for product configuration design. With matter-elements, reasoning model of Extension Case-Based Reasoning (ECBR) is established, and its corresponding algorithm is proposed. During the configuration design, the solution space of configuration schemes is obtained by the similarity calculation, and then the overall evaluation of similarity and compatible degrees is adopted to form the final configuration scheme. A prototype system of reducer configuration design is successfully developed according to the method, and it proves the proposed method that is feasible and effective.
616
Authors: W.L. Wang, X.L. Xu, Yan Wei Zhao, Q. Guan
Abstract: The mechanism of vaccination was analyzed in the immune system and the improved immune algorithm for the job-shop scheduling problem was presented. The proposed method can reserve the advantage of vaccination and it is independent of the initial antibodies. Especially, the adaptive process of vaccination with the automatic pattern recognition can not only quicken the convergence of the algorithm but also overcome some deficiencies in distilling manually the transcendent knowledge of the problem. Simulation results show that it is an effective approach.
481
Authors: Yan Wei Zhao, Jun Wei Li, Huan Wang, Zhi Sheng Yu
Abstract: The stability problem of eccentric rotor in high-speed cutting process is the main factor affecting the performance of cutter transmission system. A modal analysis of eccentric rotor for multi-layer leather high-speed cutting machine based on bond graph method is proposed to obtain the complete modal parameters. The lateral vibration mathematical model of the eccentric rotor is build using bond graph theory. The inherent frequency, deformation modal vibration shape, and velocity modal vibration shape of eccentric rotor are obtained through the Matlab numerical calculation. Then the modal test for eccentric rotor is done and the compared results are given. The results show that using the bond graph method solves the problem more easily than Newton's theory, obtains the two type of modal vibration shape, and its relative error is less than 0.4%. The complete modal information is given that provides a theoretical basis to better understanding the dynamic properties of eccentric rotor and provides the basic parameters for dynamic performance optimization and dynamic balancing analysis of cutter transmission system.
307
Authors: Yan Wei Zhao, J.L. Zhang, D.J. Peng
Abstract: Open vehicle routing problem is a kind of special vehicle routing problem, in which the vehicles do not return the depots after completing the task. Aiming at open vehicle routing problem, the mathematical model was founded by introducing virtual depots. A quantum evolutionary algorithm combined with local optimization algorithms was proposed in this paper, in which 0-1 matrix encoding was used to construct chromosomes, rotation gate with adaptively adjusting rotation angle was used to realize evolution, nearest neighbors and 2-Opt were incorporated to further improve solutions. Based on benchmark problems, the algorithm’s parameters were discussed, and the computation result was compared to those of other algorithms. The Computation results indicated that the proposed algorithm was an efficient method for solving open vehicle routing problem.
807
Authors: Yan Wei Zhao, B. Wu, W.L. Wang, Ying Li Ma, W.A. Wang, H. Sun
Abstract: The investigation of the performance of the Particle Swarm Optimization (PSO) method for Vehicle Routing Problem with Time Windows is the main theme of the paper. “Exchange minus operator” is constructed to compute particle’s velocity. We use Saving algorithm, Nearest Neighbor algorithm, and Solomon insertion heuristics for parameter initialization and apply the “Routing first and Cluster second” strategy for solution generation. By PSO, customers are sorted in an ordered sequence for vehicle assignment and Nearest Neighbor algorithm is used to optimize every vehicle route. In our experiments, two different PSO algorithms (global and local), and three construct algorithms are investigated for omparison. Computational results show that global PSO algorithm with Solomon insertion heuristics is more efficiency than the others.
801
Showing 1 to 10 of 15 Paper Titles