In smart driving for rail transit,a reliable obstacle detection system is an important guarantee for the safety of trains.Therein,the detection of the rail area directly affects the accuracy of the system to identify ...In smart driving for rail transit,a reliable obstacle detection system is an important guarantee for the safety of trains.Therein,the detection of the rail area directly affects the accuracy of the system to identify dangerous targets.Both the rail line and the lane are presented as thin line shapes in the image,but the rail scene is more complex,and the color of the rail line is more difficult to distinguish from the background.By comparison,there are already many deep learning-based lane detection algorithms,but there is a lack of public datasets and targeted deep learning detection algorithms for rail line detection.To address this,this paper constructs a rail image dataset RailwayLine and labels the rail line for the training and testing of models.This dataset contains rich rail images including single-rail,multi-rail,straight rail,curved rail,crossing rails,occlusion,blur,and different lighting conditions.To address the problem of the lack of deep learning-based rail line detection algorithms,we improve the CLRNet algorithm which has an excellent performance in lane detection,and propose the CLRNet-R algorithm for rail line detection.To address the problem of the rail line being thin and occupying fewer pixels in the image,making it difficult to distinguish from complex backgrounds,we introduce an attention mechanism to enhance global feature extraction ability and add a semantic segmentation head to enhance the features of the rail region by the binary probability of rail lines.To address the poor curve recognition performance and unsmooth output lines in the original CLRNet algorithm,we improve the weight allocation for line intersection-over-union calculation in the original framework and propose two loss functions based on local slopes to optimize the model’s local sampling point training constraints,improving the model’s fitting performance on curved rails and obtaining smooth and stable rail line detection results.Through experiments,this paper demonstrates that compared with other mainstream lane detection algorithms,the algorithm proposed in this paper has a better performance for rail line detection.展开更多
Due to the NP-hardness of the two-sided assembly line balancing （TALB） problem, multiple constraints existing in real applications are less studied, especially when one task is involved with several constraints. In ...Due to the NP-hardness of the two-sided assembly line balancing （TALB） problem, multiple constraints existing in real applications are less studied, especially when one task is involved with several constraints. In this paper, an effective hybrid algorithm is proposed to address the TALB problem with multiple constraints （TALB-MC）. Considering the discrete attribute of TALB-MC and the continuous attribute of the standard teaching-learning-based optimization （TLBO） algorithm, the random-keys method is hired in task permutation representation, for the purpose of bridging the gap between them. Subsequently, a special mechanism for handling multiple constraints is developed. In the mechanism, the directions constraint of each task is ensured by the direction check and adjustment. The zoning constraints and the synchronism constraints are satisfied by teasing out the hidden correlations among constraints. The positional constraint is allowed to be violated to some extent in decoding and punished in cost fimction. Finally, with the TLBO seeking for the global optimum, the variable neighborhood search （VNS） is further hybridized to extend the local search space. The experimental results show that the proposed hybrid algorithm outperforms the late acceptance hill-climbing algorithm （LAHC） for TALB-MC in most cases, especially for large-size problems with multiple constraints, and demonstrates well balance between the exploration and the exploitation. This research proposes an effective and efficient algorithm for solving TALB-MC problem by hybridizing the TLBO and VNS.展开更多
In a manufacturing industry, mixed model assembly line(MMAL) is preferred in order to meet the variety in product demand. MMAL balancing helps in assembling products with similar characteristics in a random fashion. T...In a manufacturing industry, mixed model assembly line(MMAL) is preferred in order to meet the variety in product demand. MMAL balancing helps in assembling products with similar characteristics in a random fashion. The objective of this work aims in reducing the number of workstations, work load index between stations and within each station. As manual contribution of workers in final assembly line is more, ergonomics is taken as an additional objective function. Ergonomic risk level of a workstation is evaluated using a parameter called accumulated risk posture(ARP), which is calculated using rapid upper limb assessment(RULA) check sheet. This work is based on the case study of an MMAL problem in Rane(Madras) Ltd.(India), in which a problem based genetic algorithm(GA) has been proposed to minimize the mentioned objectives. The working of the genetic operators such as selection, crossover and mutation has been modified with respect to the addressed MMAL problem. The results show that there is a significant impact over productivity and the process time of the final assembled product, i.e., the rate of production is increased by 39.5% and the assembly time for one particular model is reduced to 13 min from existing 18 min. Also, the space required using the proposed assembly line is only 200 m2 against existing 350 m2. Further, the algorithm helps in reducing workers fatigue(i.e., ergonomic friendly).展开更多
Traditional parafoil homing usually uses a point as object. As the mobility of parafoil is limited by its glide ratio and wind, in some cases when the parafoil scatter area is large, or the glide ratio of parafoil is ...Traditional parafoil homing usually uses a point as object. As the mobility of parafoil is limited by its glide ratio and wind, in some cases when the parafoil scatter area is large, or the glide ratio of parafoil is small, the deviation of its landing point to object point will be arduous to control. Accordingly, during these situations, when parafoil is used in recovery of spacecraft or satellite, the landing area of parafoil can be set as a rectangle, and the object of parafoil can be set as a line segment. The thesis of this work is designing an algorithm for parafoil homing using line segment as object. The algorithm of wind velocity and direction calculation in different flying segments was also investigated. The algorithm designed navigates the parafoil to land into the predestined area and largely reduce the probability of recovery loads falling to unwanted area to damage houses and people.展开更多
To improve the measurement accuracy of structured laser for inner surface dimensions of a deep hole, a new method to extract the laser stripe center line is proposed. An improved adaptive genetic algorithm that can co...To improve the measurement accuracy of structured laser for inner surface dimensions of a deep hole, a new method to extract the laser stripe center line is proposed. An improved adaptive genetic algorithm that can converge rapidly and search the global optimum is used to determine the threshold for the laser stripe segmentation. And then NURBS interpolation which has a good local control capability is adopted to extract the laser stripe center line. Experiments show that the extracted laser stripe center line is stable and the diameter of the deep hole can be measured accurately.展开更多
In the classical multiprocessor scheduling problems, it is assumed that the problems are considered in off\|line or on\|line environment. But in practice, problems are often not really off\|line or on\|line but someh...In the classical multiprocessor scheduling problems, it is assumed that the problems are considered in off\|line or on\|line environment. But in practice, problems are often not really off\|line or on\|line but somehow in between. This means that, with respect to the on\|line problem, some further information about the tasks is available, which allows the improvement of the performance of the best possible algorithms. Problems of this class are called semi on\|line ones. The authors studied two semi on\|line multiprocessor scheduling problems, in which, the total processing time of all tasks is known in advance, or all processing times lie in a given interval. They proposed approximation algorithms for minimizing the makespan and analyzed their performance guarantee. The algorithms improve the known results for 3 or more processor cases in the literature.展开更多
In response to the production capacity and functionality variations, a genetic algorithm （GA） embedded with deterministic timed Petri nets（DTPN） for reconfigurable production line（RPL） is proposed to solve its s...In response to the production capacity and functionality variations, a genetic algorithm （GA） embedded with deterministic timed Petri nets（DTPN） for reconfigurable production line（RPL） is proposed to solve its scheduling problem. The basic DTPN modules are presented to model the corresponding variable structures in RPL, and then the scheduling model of the whole RPL is constructed. And in the scheduling algorithm, firing sequences of the Petri nets model are used as chromosomes, thus the selection, crossover, and mutation operator do not deal with the elements in the problem space, but the elements of Petri nets model. Accordingly, all the algorithms for GA operations embedded with Petri nets model are proposed. Moreover, the new weighted single-objective optimization based on reconfiguration cost and E/T is used. The results of a DC motor RPL scheduling suggest that the presented DTPN-GA scheduling algorithm has a significant impact on RPL scheduling, and provide obvious improvements over the conventional scheduling method in practice that meets duedate, minimizes reconfiguration cost, and enhances cost effectivity.展开更多
Shuffled frog leaping algorithm( SFLA) was used to solve multi-objective sequencing problem of mixed model assembly line( MMAL). Local convergence can be avoided and optimal solution can be obtained to a certain exten...Shuffled frog leaping algorithm( SFLA) was used to solve multi-objective sequencing problem of mixed model assembly line( MMAL). Local convergence can be avoided and optimal solution can be obtained to a certain extent. However,the multi-objective sequencing problem of MMAL is an non-deterministic polynomial hard( NP-hard) problem and the shortcomings are slow convergence rate and low precision. To solve the shortcomings for optimization objectives of minimizing total utility time and keeping average consumption rate of parts, a chaos differential evolution SFLA( CDESFLA) is proposed in this study. Because SFLA is easy to fall into local optimum,the evolution operator of differential evolution algorithms is introduced in SFLA as a local search strategy,and differential mutation operator is introduced in chaotic sequence to prevent premature convergence. The examples show that the proposed CDESFLA is better for convergence accuracy than SFLA,genetic algorithm( GA) and particle swarm optimization( PSO)展开更多
In this paper, an adaptive line spectral pair filter is derived from an adaptive lattice filter. A least-mean-square(LMS) type adaptive algorithm used to calculate directly the line spectral pair(LSP) coefficients on ...In this paper, an adaptive line spectral pair filter is derived from an adaptive lattice filter. A least-mean-square(LMS) type adaptive algorithm used to calculate directly the line spectral pair(LSP) coefficients on a stage-by-stage basis is presented. Experimental results show that the algorithm has higher convergence rate and lower misadjustment as compared with the other algorithms. The LSP coefficients calculated by the algorithm have been used to carry out speech linear predictive synthesis, resulting in better results than PARCOR coefficients.展开更多
A new algorithm for clipping line segments by a rectangular window on rectangular coordinate system is presented in this paper. The algorithm is very different to the other line clipping algorithms. For the line segme...A new algorithm for clipping line segments by a rectangular window on rectangular coordinate system is presented in this paper. The algorithm is very different to the other line clipping algorithms. For the line segments that cannot be identified as completely inside or outside the window by simple testings, this algorithm applies affine transformations (the shearing transformations) to the line segments and the window, and changes the slopes of the line segments and the shape of the window. Thus, it is clear for the line segment to be outside or inside of the window. If the line segments intersect the window, the algorithm immediately (no solving equations) gets the intersection points. Having applied the inverse transformations to the intersection points, the algorithm has the final results. The algorithm is successful to avoid the complex classifications and computations. Besides, the algorithm is effective to simplify the processes of finding the intersection points. Comparing to some classical algorithms, the algorithm of this paper is faster for clipping line segments and more efficient for calculations.展开更多
The growing global competition compels manufacturing organizations to engage themselves in all productivity improvement activities. In this direction, the consideration of mixed-model assembly line balancing problem a...The growing global competition compels manufacturing organizations to engage themselves in all productivity improvement activities. In this direction, the consideration of mixed-model assembly line balancing problem and implementing in industries plays a major role in improving organizational productivity. In this paper, the mixed model assembly line balancing problem with deterministic task times is considered. The authors made an attempt to develop a genetic algorithm for realistic design of the mixed-model assembly line balancing problem. The design is made using the originnal task times of the models, which is a realistic approach. Then, it is compared with the generally perceived design of the mixed-model assembly line balancing problem.展开更多
A line-feature based SLAM algorithm is presented in this paper to resolve the conflict between the requirements of computational complexity and information-richness within the point-feature based SLAM algorithm, All o...A line-feature based SLAM algorithm is presented in this paper to resolve the conflict between the requirements of computational complexity and information-richness within the point-feature based SLAM algorithm, All operations required for building and maintaining the map, such as model-setting, data association, and state-updating, are described and formulated. This approach has been programmed and successfully tested in the simulation work, and results are shown at the end of this paper.展开更多
Buffer influences the performance of production lines greatly.To solve the buffer allocation problem(BAP) in serial production lines with unreliable machines effectively,an optimization method is proposed based on an ...Buffer influences the performance of production lines greatly.To solve the buffer allocation problem(BAP) in serial production lines with unreliable machines effectively,an optimization method is proposed based on an improved ant colony optimization(IACO) algorithm.Firstly,a problem domain describing buffer allocation is structured.Then a mathematical programming model is established with an objective of maximizing throughput rate of the production line.On the basis of the descriptions mentioned above,combining with a two-opt strategy and an acceptance probability rule,an IACO algorithm is built to solve the BAP.Finally,the simulation experiments are designed to evaluate the proposed algorithm.The results indicate that the IACO algorithm is valid and practical.展开更多
The dense and accurate measurement of 3D texture is helpful in evaluating the pavement function.To form dense mandatory constraints and improve matching accuracy,the traditional binocular reconstruction technology was...The dense and accurate measurement of 3D texture is helpful in evaluating the pavement function.To form dense mandatory constraints and improve matching accuracy,the traditional binocular reconstruction technology was improved threefold.First,a single moving laser line was introduced to carry out global scanning constraints on the target,which would well overcome the difficulty of installing and recognizing excessive laser lines.Second,four kinds of improved algorithms,namely,disparity replacement,superposition synthesis,subregion segmentation,and subregion segmentation centroid enhancement,were established based on different constraint mechanism.Last,the improved binocular reconstruction test device was developed to realize the dual functions of 3D texture measurement and precision self-evaluation.Results show that compared with traditional algorithms,the introduction of a single laser line scanning constraint is helpful in improving the measurement’s accuracy.Among various improved algorithms,the improvement effect of the subregion segmentation centroid enhancement method is the best.It has a good effect on both overall measurement and single pointmeasurement,which can be considered to be used in pavement function evaluation.展开更多
In this paper, we present a new line search and trust region algorithm for unconstrained optimization problems. The trust region center locates at somewhere in the negative gradient direction with the current best ite...In this paper, we present a new line search and trust region algorithm for unconstrained optimization problems. The trust region center locates at somewhere in the negative gradient direction with the current best iterative point being on the boundary. By doing these, the trust region subproblems are constructed at a new way different with the traditional ones. Then, we test the efficiency of the new line search and trust region algorithm on some standard benchmarking. The computational results reveal that, for most test problems, the number of function and gradient calculations are reduced significantly.展开更多
The control design, based on self-adaptive PID with genetic algorithms(GA) tuning on-line was investigated, for the temperature control of industrial microwave drying rotary device with the multi-layer(IMDRDWM) and wi...The control design, based on self-adaptive PID with genetic algorithms(GA) tuning on-line was investigated, for the temperature control of industrial microwave drying rotary device with the multi-layer(IMDRDWM) and with multivariable nonlinear interaction of microwave and materials. The conventional PID control strategy incorporated with optimization GA was put forward to maintain the optimum drying temperature in order to keep the moisture content below 1%, whose adaptation ability included the cost function of optimization GA according to the output change. Simulations on five different industrial process models and practical temperature process control system for selenium-enriched slag drying intensively by using IMDRDWM were carried out systematically, indicating the reliability and effectiveness of control design. The parameters of proposed control design are all on-line implemented without iterative predictive calculations, and the closed-loop system stability is guaranteed, which makes the developed scheme simpler in its synthesis and application, providing the practical guidelines for the control implementation and the parameter design.展开更多
Aiming at assembly line balancing problem,a double chromosome genetic algorithm(DCGA)is proposed to avoid trapping in local optimum,which is a disadvantage of standard genetic algorithm(SGA).In this algorithm,there ar...Aiming at assembly line balancing problem,a double chromosome genetic algorithm(DCGA)is proposed to avoid trapping in local optimum,which is a disadvantage of standard genetic algorithm(SGA).In this algorithm,there are two chromosomes of each individual,and the better one,regarded as dominant chromosome,determines the fitness.Dominant chromosome keeps excellent gene segments to speed up the convergence,and recessive chromosome maintains population diversity to get better global search ability to avoid local optimal solution.When the amounts of chromosomes are equal,the population size of DCGA is half that of SGA,which significantly reduces evolutionary time.Finally,the effectiveness is verified by experiments.展开更多
Assessment of imprecise time-variant reliability in engineering is a critical task when accounting for both the variability of structural properties and loads over time and the presence of uncertainties involved in th...Assessment of imprecise time-variant reliability in engineering is a critical task when accounting for both the variability of structural properties and loads over time and the presence of uncertainties involved in the ambiguity of parameters simultaneously.To estimate the Imprecise Time-variant Failure Probability Function(ITFPF)and derive the imprecise reliability results as a byproduct,Adaptive Combination Augmented Line Sampling(ACALS)is proposed.It consists of three integrated features:Augmented Line Sampling(ALS),adaptive strategy,and the optimal combination.ALS is adopted as an efficient analysis tool to obtain the failure probability function w.r.t.imprecise parameters.Then,the adaptive strategy iteratively applies ALS while considering both imprecise parameters and time simultaneously.Finally,the optimal combination algorithm collects all result components in an optimal manner to minimize the Coefficient of Variance(C.o.V.)of the ITFPF estimate.Overall,the proposed ACALS method outperforms the original ALS method by efficiently estimating the ITFPF while guaranteeing a minimal C.o.V.Thus,the proposed approach can serve as an effective tool for imprecise time-variant reliability analysis in real engineering applications.Several examples are presented to demonstrate the superiority of the proposed approach in addressing the challenges of estimating the ITFPF.展开更多
This paper proposed the scheme of transmission lines distance protection based on differential equation algorithms (DEA) and Hilbert-Huang transform (HHT). The measured impedance based on EDA is affected by various fa...This paper proposed the scheme of transmission lines distance protection based on differential equation algorithms (DEA) and Hilbert-Huang transform (HHT). The measured impedance based on EDA is affected by various factors, such as the distributed capacitance, the transient response characteristics of current transformer and voltage transformer, etc. In order to overcome this problem, the proposed scheme applies HHT to improve the apparent impedance estimated by DEA. Empirical mode decomposition (EMD) is used to decompose the data set from DEA into the intrinsic mode functions (IMF) and the residue. This residue has monotonic trend and is used to evaluate the impedance of faulty line. Simulation results show that the proposed scheme improves significantly the accuracy of the estimated impedance.展开更多
基金the Sichuan Science and Technology Program(No.2022YFS0557)the National Natural Science Foundation of China(No.61972271)。
文摘In smart driving for rail transit,a reliable obstacle detection system is an important guarantee for the safety of trains.Therein,the detection of the rail area directly affects the accuracy of the system to identify dangerous targets.Both the rail line and the lane are presented as thin line shapes in the image,but the rail scene is more complex,and the color of the rail line is more difficult to distinguish from the background.By comparison,there are already many deep learning-based lane detection algorithms,but there is a lack of public datasets and targeted deep learning detection algorithms for rail line detection.To address this,this paper constructs a rail image dataset RailwayLine and labels the rail line for the training and testing of models.This dataset contains rich rail images including single-rail,multi-rail,straight rail,curved rail,crossing rails,occlusion,blur,and different lighting conditions.To address the problem of the lack of deep learning-based rail line detection algorithms,we improve the CLRNet algorithm which has an excellent performance in lane detection,and propose the CLRNet-R algorithm for rail line detection.To address the problem of the rail line being thin and occupying fewer pixels in the image,making it difficult to distinguish from complex backgrounds,we introduce an attention mechanism to enhance global feature extraction ability and add a semantic segmentation head to enhance the features of the rail region by the binary probability of rail lines.To address the poor curve recognition performance and unsmooth output lines in the original CLRNet algorithm,we improve the weight allocation for line intersection-over-union calculation in the original framework and propose two loss functions based on local slopes to optimize the model’s local sampling point training constraints,improving the model’s fitting performance on curved rails and obtaining smooth and stable rail line detection results.Through experiments,this paper demonstrates that compared with other mainstream lane detection algorithms,the algorithm proposed in this paper has a better performance for rail line detection.
基金Supported by National Natural Science Foundation of China(Grant Nos.51275366,50875190,51305311)Specialized Research Fund for the Doctoral Program of Higher Education of China(Grant No.20134219110002)
文摘Due to the NP-hardness of the two-sided assembly line balancing （TALB） problem, multiple constraints existing in real applications are less studied, especially when one task is involved with several constraints. In this paper, an effective hybrid algorithm is proposed to address the TALB problem with multiple constraints （TALB-MC）. Considering the discrete attribute of TALB-MC and the continuous attribute of the standard teaching-learning-based optimization （TLBO） algorithm, the random-keys method is hired in task permutation representation, for the purpose of bridging the gap between them. Subsequently, a special mechanism for handling multiple constraints is developed. In the mechanism, the directions constraint of each task is ensured by the direction check and adjustment. The zoning constraints and the synchronism constraints are satisfied by teasing out the hidden correlations among constraints. The positional constraint is allowed to be violated to some extent in decoding and punished in cost fimction. Finally, with the TLBO seeking for the global optimum, the variable neighborhood search （VNS） is further hybridized to extend the local search space. The experimental results show that the proposed hybrid algorithm outperforms the late acceptance hill-climbing algorithm （LAHC） for TALB-MC in most cases, especially for large-size problems with multiple constraints, and demonstrates well balance between the exploration and the exploitation. This research proposes an effective and efficient algorithm for solving TALB-MC problem by hybridizing the TLBO and VNS.
基金support and help of many individuals in the SASTRA University
文摘In a manufacturing industry, mixed model assembly line(MMAL) is preferred in order to meet the variety in product demand. MMAL balancing helps in assembling products with similar characteristics in a random fashion. The objective of this work aims in reducing the number of workstations, work load index between stations and within each station. As manual contribution of workers in final assembly line is more, ergonomics is taken as an additional objective function. Ergonomic risk level of a workstation is evaluated using a parameter called accumulated risk posture(ARP), which is calculated using rapid upper limb assessment(RULA) check sheet. This work is based on the case study of an MMAL problem in Rane(Madras) Ltd.(India), in which a problem based genetic algorithm(GA) has been proposed to minimize the mentioned objectives. The working of the genetic operators such as selection, crossover and mutation has been modified with respect to the addressed MMAL problem. The results show that there is a significant impact over productivity and the process time of the final assembled product, i.e., the rate of production is increased by 39.5% and the assembly time for one particular model is reduced to 13 min from existing 18 min. Also, the space required using the proposed assembly line is only 200 m2 against existing 350 m2. Further, the algorithm helps in reducing workers fatigue(i.e., ergonomic friendly).
基金Project(61503077)supported by the National Natural Science Foundation of ChinaProject(BK20130628)supported by the Jiangsu Natural Science Foundation,China
文摘Traditional parafoil homing usually uses a point as object. As the mobility of parafoil is limited by its glide ratio and wind, in some cases when the parafoil scatter area is large, or the glide ratio of parafoil is small, the deviation of its landing point to object point will be arduous to control. Accordingly, during these situations, when parafoil is used in recovery of spacecraft or satellite, the landing area of parafoil can be set as a rectangle, and the object of parafoil can be set as a line segment. The thesis of this work is designing an algorithm for parafoil homing using line segment as object. The algorithm of wind velocity and direction calculation in different flying segments was also investigated. The algorithm designed navigates the parafoil to land into the predestined area and largely reduce the probability of recovery loads falling to unwanted area to damage houses and people.
基金the Excellent Young Teacher Foundation from Ministry of Education (203078)
文摘To improve the measurement accuracy of structured laser for inner surface dimensions of a deep hole, a new method to extract the laser stripe center line is proposed. An improved adaptive genetic algorithm that can converge rapidly and search the global optimum is used to determine the threshold for the laser stripe segmentation. And then NURBS interpolation which has a good local control capability is adopted to extract the laser stripe center line. Experiments show that the extracted laser stripe center line is stable and the diameter of the deep hole can be measured accurately.
文摘In the classical multiprocessor scheduling problems, it is assumed that the problems are considered in off\|line or on\|line environment. But in practice, problems are often not really off\|line or on\|line but somehow in between. This means that, with respect to the on\|line problem, some further information about the tasks is available, which allows the improvement of the performance of the best possible algorithms. Problems of this class are called semi on\|line ones. The authors studied two semi on\|line multiprocessor scheduling problems, in which, the total processing time of all tasks is known in advance, or all processing times lie in a given interval. They proposed approximation algorithms for minimizing the makespan and analyzed their performance guarantee. The algorithms improve the known results for 3 or more processor cases in the literature.
基金This project is supported by Key Science-Technology Project of Shanghai City Tenth Five-Year-Plan, China (No.031111002)Specialized Research Fund for the Doctoral Program of Higher Education, China (No.20040247033)Municipal Key Basic Research Program of Shanghai, China (No.05JC14060)
文摘In response to the production capacity and functionality variations, a genetic algorithm （GA） embedded with deterministic timed Petri nets（DTPN） for reconfigurable production line（RPL） is proposed to solve its scheduling problem. The basic DTPN modules are presented to model the corresponding variable structures in RPL, and then the scheduling model of the whole RPL is constructed. And in the scheduling algorithm, firing sequences of the Petri nets model are used as chromosomes, thus the selection, crossover, and mutation operator do not deal with the elements in the problem space, but the elements of Petri nets model. Accordingly, all the algorithms for GA operations embedded with Petri nets model are proposed. Moreover, the new weighted single-objective optimization based on reconfiguration cost and E/T is used. The results of a DC motor RPL scheduling suggest that the presented DTPN-GA scheduling algorithm has a significant impact on RPL scheduling, and provide obvious improvements over the conventional scheduling method in practice that meets duedate, minimizes reconfiguration cost, and enhances cost effectivity.
基金National Natural Science Foundation of China(o.61370037)
文摘Shuffled frog leaping algorithm( SFLA) was used to solve multi-objective sequencing problem of mixed model assembly line( MMAL). Local convergence can be avoided and optimal solution can be obtained to a certain extent. However,the multi-objective sequencing problem of MMAL is an non-deterministic polynomial hard( NP-hard) problem and the shortcomings are slow convergence rate and low precision. To solve the shortcomings for optimization objectives of minimizing total utility time and keeping average consumption rate of parts, a chaos differential evolution SFLA( CDESFLA) is proposed in this study. Because SFLA is easy to fall into local optimum,the evolution operator of differential evolution algorithms is introduced in SFLA as a local search strategy,and differential mutation operator is introduced in chaotic sequence to prevent premature convergence. The examples show that the proposed CDESFLA is better for convergence accuracy than SFLA,genetic algorithm( GA) and particle swarm optimization( PSO)
文摘In this paper, an adaptive line spectral pair filter is derived from an adaptive lattice filter. A least-mean-square(LMS) type adaptive algorithm used to calculate directly the line spectral pair(LSP) coefficients on a stage-by-stage basis is presented. Experimental results show that the algorithm has higher convergence rate and lower misadjustment as compared with the other algorithms. The LSP coefficients calculated by the algorithm have been used to carry out speech linear predictive synthesis, resulting in better results than PARCOR coefficients.
文摘A new algorithm for clipping line segments by a rectangular window on rectangular coordinate system is presented in this paper. The algorithm is very different to the other line clipping algorithms. For the line segments that cannot be identified as completely inside or outside the window by simple testings, this algorithm applies affine transformations (the shearing transformations) to the line segments and the window, and changes the slopes of the line segments and the shape of the window. Thus, it is clear for the line segment to be outside or inside of the window. If the line segments intersect the window, the algorithm immediately (no solving equations) gets the intersection points. Having applied the inverse transformations to the intersection points, the algorithm has the final results. The algorithm is successful to avoid the complex classifications and computations. Besides, the algorithm is effective to simplify the processes of finding the intersection points. Comparing to some classical algorithms, the algorithm of this paper is faster for clipping line segments and more efficient for calculations.
文摘The growing global competition compels manufacturing organizations to engage themselves in all productivity improvement activities. In this direction, the consideration of mixed-model assembly line balancing problem and implementing in industries plays a major role in improving organizational productivity. In this paper, the mixed model assembly line balancing problem with deterministic task times is considered. The authors made an attempt to develop a genetic algorithm for realistic design of the mixed-model assembly line balancing problem. The design is made using the originnal task times of the models, which is a realistic approach. Then, it is compared with the generally perceived design of the mixed-model assembly line balancing problem.
基金Supported by National Natural Science Foundation of P. R. China (60475031)
文摘A line-feature based SLAM algorithm is presented in this paper to resolve the conflict between the requirements of computational complexity and information-richness within the point-feature based SLAM algorithm, All operations required for building and maintaining the map, such as model-setting, data association, and state-updating, are described and formulated. This approach has been programmed and successfully tested in the simulation work, and results are shown at the end of this paper.
基金Supported by the National Natural Science Foundation of China(No.61273035,71471135)
文摘Buffer influences the performance of production lines greatly.To solve the buffer allocation problem(BAP) in serial production lines with unreliable machines effectively,an optimization method is proposed based on an improved ant colony optimization(IACO) algorithm.Firstly,a problem domain describing buffer allocation is structured.Then a mathematical programming model is established with an objective of maximizing throughput rate of the production line.On the basis of the descriptions mentioned above,combining with a two-opt strategy and an acceptance probability rule,an IACO algorithm is built to solve the BAP.Finally,the simulation experiments are designed to evaluate the proposed algorithm.The results indicate that the IACO algorithm is valid and practical.
基金supported by National Natural Science Foundation of China (52178422)Doctoral Research Foundation of Hubei University of Arts and Science (2059047)National College Students’Innovation and Entrepreneurship Training Program (202210519021).
文摘The dense and accurate measurement of 3D texture is helpful in evaluating the pavement function.To form dense mandatory constraints and improve matching accuracy,the traditional binocular reconstruction technology was improved threefold.First,a single moving laser line was introduced to carry out global scanning constraints on the target,which would well overcome the difficulty of installing and recognizing excessive laser lines.Second,four kinds of improved algorithms,namely,disparity replacement,superposition synthesis,subregion segmentation,and subregion segmentation centroid enhancement,were established based on different constraint mechanism.Last,the improved binocular reconstruction test device was developed to realize the dual functions of 3D texture measurement and precision self-evaluation.Results show that compared with traditional algorithms,the introduction of a single laser line scanning constraint is helpful in improving the measurement’s accuracy.Among various improved algorithms,the improvement effect of the subregion segmentation centroid enhancement method is the best.It has a good effect on both overall measurement and single pointmeasurement,which can be considered to be used in pavement function evaluation.
文摘In this paper, we present a new line search and trust region algorithm for unconstrained optimization problems. The trust region center locates at somewhere in the negative gradient direction with the current best iterative point being on the boundary. By doing these, the trust region subproblems are constructed at a new way different with the traditional ones. Then, we test the efficiency of the new line search and trust region algorithm on some standard benchmarking. The computational results reveal that, for most test problems, the number of function and gradient calculations are reduced significantly.
基金Project(51090385) supported by the Major Program of National Natural Science Foundation of ChinaProject(2011IB001) supported by Yunnan Provincial Science and Technology Program,China+1 种基金Project(2012DFA70570) supported by the International Science & Technology Cooperation Program of ChinaProject(2011IA004) supported by the Yunnan Provincial International Cooperative Program,China
文摘The control design, based on self-adaptive PID with genetic algorithms(GA) tuning on-line was investigated, for the temperature control of industrial microwave drying rotary device with the multi-layer(IMDRDWM) and with multivariable nonlinear interaction of microwave and materials. The conventional PID control strategy incorporated with optimization GA was put forward to maintain the optimum drying temperature in order to keep the moisture content below 1%, whose adaptation ability included the cost function of optimization GA according to the output change. Simulations on five different industrial process models and practical temperature process control system for selenium-enriched slag drying intensively by using IMDRDWM were carried out systematically, indicating the reliability and effectiveness of control design. The parameters of proposed control design are all on-line implemented without iterative predictive calculations, and the closed-loop system stability is guaranteed, which makes the developed scheme simpler in its synthesis and application, providing the practical guidelines for the control implementation and the parameter design.
基金Supported by the 12th Five-Year Plan National Pre-research Program of Chinathe Aerospace Science Foundation of China(20111652016)+1 种基金the China Postdoctoral Science Foundation(2012M511748)the Jiangsu Planned Projects for Postdoctoral Research Funds(1102053C)
文摘Aiming at assembly line balancing problem,a double chromosome genetic algorithm(DCGA)is proposed to avoid trapping in local optimum,which is a disadvantage of standard genetic algorithm(SGA).In this algorithm,there are two chromosomes of each individual,and the better one,regarded as dominant chromosome,determines the fitness.Dominant chromosome keeps excellent gene segments to speed up the convergence,and recessive chromosome maintains population diversity to get better global search ability to avoid local optimal solution.When the amounts of chromosomes are equal,the population size of DCGA is half that of SGA,which significantly reduces evolutionary time.Finally,the effectiveness is verified by experiments.
基金The Aeronautical Science Foundation of China(Nos.20170968002,20230003068002)The National Major Science and Technology Projects of China(Nos.J2019-II-0022-0043,J2019-VII-0013-0153).
文摘Assessment of imprecise time-variant reliability in engineering is a critical task when accounting for both the variability of structural properties and loads over time and the presence of uncertainties involved in the ambiguity of parameters simultaneously.To estimate the Imprecise Time-variant Failure Probability Function(ITFPF)and derive the imprecise reliability results as a byproduct,Adaptive Combination Augmented Line Sampling(ACALS)is proposed.It consists of three integrated features:Augmented Line Sampling(ALS),adaptive strategy,and the optimal combination.ALS is adopted as an efficient analysis tool to obtain the failure probability function w.r.t.imprecise parameters.Then,the adaptive strategy iteratively applies ALS while considering both imprecise parameters and time simultaneously.Finally,the optimal combination algorithm collects all result components in an optimal manner to minimize the Coefficient of Variance(C.o.V.)of the ITFPF estimate.Overall,the proposed ACALS method outperforms the original ALS method by efficiently estimating the ITFPF while guaranteeing a minimal C.o.V.Thus,the proposed approach can serve as an effective tool for imprecise time-variant reliability analysis in real engineering applications.Several examples are presented to demonstrate the superiority of the proposed approach in addressing the challenges of estimating the ITFPF.
文摘This paper proposed the scheme of transmission lines distance protection based on differential equation algorithms (DEA) and Hilbert-Huang transform (HHT). The measured impedance based on EDA is affected by various factors, such as the distributed capacitance, the transient response characteristics of current transformer and voltage transformer, etc. In order to overcome this problem, the proposed scheme applies HHT to improve the apparent impedance estimated by DEA. Empirical mode decomposition (EMD) is used to decompose the data set from DEA into the intrinsic mode functions (IMF) and the residue. This residue has monotonic trend and is used to evaluate the impedance of faulty line. Simulation results show that the proposed scheme improves significantly the accuracy of the estimated impedance.
