期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到3,653篇文章
< 1 2 … 183 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
A multi-line laser scanning system design and evaluation framework based on physical simulation 认领 引用
1
作者 Yunpeng LI Yifan CHEN +3 位作者 Limei SONG Hongyi WANG Hongmin WANG Baozhen GE 《Optoelectronics Letters》 EI 2026年第5期268-274,共7页
We propose a multi-line laser simulation system utilizing computer graphics and physical simulation to generate virtual multi-line laser datasets.Our framework provides key physical properties of the scene,including c... We propose a multi-line laser simulation system utilizing computer graphics and physical simulation to generate virtual multi-line laser datasets.Our framework provides key physical properties of the scene,including camera parameters,depth values,surface normals,and the actual two-dimensional(2D)and three-dimensional(3D)coordinates of the laser stripe centers for each rendered image.Beyond,we construct a virtual line laser scanning image dataset with a complex background by simulating interactions between lasers and object surfaces with the Monte Carlo method.With the proposed framework and dataset,a multi-line laser extraction algorithm based on a robust sorting algorithm is proposed and tested,which utilizes distance-based error analysis,connected component labeling,and iterative optimization refinement techniques.Both simulation and actual experiments show that our method outperforms the other state-of-the-art multi-line laser stripe center extraction methods.The proposed framework can be applied to different types of laser scanning systems in the future. 展开更多
关键词 physical simulation computer graphics Robust sorting algorithm Monte Carlo method Multi line laser scanning simulating interactions las virtual line laser scanning image dataset
暂未订购 下载PDF
Rail Line Detection Algorithm Based on Improved CLRNet 认领 引用
2
作者 ZHOU Bowei XING Guanyu LIU Yanli 《Journal of Shanghai Jiaotong university(Science)》 EI 2025年第5期923-934,共12页
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. 展开更多
关键词 rail line detection attention mechanism semantic segmentation loss function CLRNet algorithm
暂未订购 下载PDF
Design and simulation for large parafoil fix line object homing algorithm 认领 引用 被引量：4
3
作者 LI Chun TENG Hai-shan +5 位作者 ZHU Yan-hua JIANG Wan-song ZHOU Peng HUANG Wei CHEN Xu LIU Jing-lei 《Journal of Central South University》 SCIE EI CAS CSCD 2016年第9期2276-2283,共8页
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 sma... 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. 展开更多
关键词 fix line homing parafoil algorithm design simulation
暂未订购 下载PDF
Effective Hybrid Teaching-learning-based Optimization Algorithm for Balancing Two-sided Assembly Lines with Multiple Constraints 认领 引用 被引量：8
4
作者 TANG Qiuhua LI Zixiang +2 位作者 ZHANG Liping FLOUDAS C A CAO Xiaojun 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2015年第5期1067-1079,共13页
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. 展开更多
关键词 two-sided assembly line balancing teaching-learning-based optimization algorithm variable neighborhood search positional constraints zoning constraints synchronism constraints
暂未订购 下载PDF
Extraction of Laser Stripe Center Line Based on Genetic Algorithm and NURBS Interpolation 认领 引用 被引量：2
5
作者 朱文娟 焦开河 +1 位作者 徐春广 肖定国 《Journal of Beijing Institute of Technology》 EI CAS 2008年第2期143-147,共5页
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. 展开更多
关键词 structured laser center line adaptive genetic algorithm NURBS interpolation
暂未订购 下载PDF
Improvement of Binocular Reconstruction Algorithm for Measuring 3D Pavement Texture Using a Single Laser Line Scanning Constraint 认领 引用 被引量：2
6
作者 Yuanyuan Wang RuiWang +1 位作者 Xiaofeng Ren Junan Lei 《Computer Modeling in Engineering & Sciences》 SCIE EI 2023年第8期1951-1972,共22页
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. 展开更多
关键词 3D pavement texture binocular reconstruction algorithm single laser line scanning constraint improved stereo matching
暂未订购 下载PDF
Algorithms for semi on-line multiprocessor scheduling problems 认领 引用 被引量：8
7
作者 杨启帆 谈之奕 +1 位作者 姚恩瑜 何勇 《Journal of Zhejiang University Science》 2002年第1期60-64,共5页
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 someho... 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. 展开更多
关键词 analysis of algorithm on\|line scheduling worst\|case ratio
暂未订购 下载PDF
Sequencing of Mixed Model Assembly Lines Based on Improved Shuffled Frog Leaping Algorithm 认领 引用 被引量：1
8
作者 ZHAO Xiaoqiang JI Shurong 《Journal of Donghua University(English Edition)》 CAS 2018年第2期154-159,共6页
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) 展开更多
关键词 mixed model assembly line (MMAL) sequencing shuffledfrog leaping algorithm (SFLA) chaos optimization differentialevolution algorithm
暂未订购 下载PDF
Buffer allocation method of serial production lines based on improved ant colony optimization algorithm 认领 引用 被引量：2
9
作者 周炳海 Yu Jiadi 《High Technology Letters》 EI CAS 2016年第2期113-119,共7页
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. 展开更多
关键词 buffer allocation improved ant colony optimization （IACO） algorithm serial pro-duction line throughput rate
暂未订购 下载PDF
RECONFIGURABLE PRODUCTION LINE MODELING AND SCHEDULING USING PETRI NETS AND GENETIC ALGORITHM 认领 引用 被引量：8
10
作者 XIE Nan LI Aiping 《Chinese Journal of Mechanical Engineering》 EI CAS 2006年第3期362-367,共6页
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. 展开更多
关键词 Reconfigurable production line Deterministic timed Petri nets （DTPN） Modeling Scheduling Genetic algorithm（GA）
暂未订购 下载PDF
Augmented line sampling and combination algorithm for imprecise time-variant reliability analysis 认领 引用
11
作者 Xiukai YUAN Weiming ZHENG +1 位作者 Yunfei SHU Yiwei DONG 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2024年第12期258-274,共17页
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. 展开更多
关键词 Time-variant reliability Imprecise reliability Line sampling Adaptive strategy Combination algorithm
暂未订购 下载PDF
Multi-Objective Optimization of Multi-Product Parallel Disassembly Line Balancing Problem Considering Multi-Skilled Workers Using a Discrete Chemical Reaction Optimization Algorithm 认领 引用
12
作者 Xiwang Guo Liangbo Zhou +4 位作者 Zhiwei Zhang Liang Qi Jiacun Wang Shujin Qin Jinrui Cao 《Computers, Materials & Continua》 SCIE EI 2024年第9期4475-4496,共22页
This work investigates a multi-product parallel disassembly line balancing problem considering multi-skilled workers.A mathematical model for the parallel disassembly line is established to achieve maximized disassemb... This work investigates a multi-product parallel disassembly line balancing problem considering multi-skilled workers.A mathematical model for the parallel disassembly line is established to achieve maximized disassembly profit and minimized workstation cycle time.Based on a product’s AND/OR graph,matrices for task-skill,worker-skill,precedence relationships,and disassembly correlations are developed.A multi-objective discrete chemical reaction optimization algorithm is designed.To enhance solution diversity,improvements are made to four reactions:decomposition,synthesis,intermolecular ineffective collision,and wall invalid collision reaction,completing the evolution of molecular individuals.The established model and improved algorithm are applied to ball pen,flashlight,washing machine,and radio combinations,respectively.Introducing a Collaborative Resource Allocation(CRA)strategy based on a Decomposition-Based Multi-Objective Evolutionary Algorithm,the experimental results are compared with four classical algorithms:MOEA/D,MOEAD-CRA,Non-dominated Sorting Genetic Algorithm Ⅱ(NSGA-Ⅱ),and Non-dominated Sorting Genetic Algorithm Ⅲ(NSGA-Ⅲ).This validates the feasibility and superiority of the proposed algorithm in parallel disassembly production lines. 展开更多
关键词 Parallel disassembly line balancing problem multi-product multiskilled workers discrete chemical reaction optimization algorithm
暂未订购 下载PDF
Schedule for Garment Assembly Line Based on Genetic Algorithm 认领 引用
13
作者 王东云 吴俊 刘淑英 《Journal of Donghua University(English Edition)》 EI CAS 2003年第3期104-107,共4页
A new way to solve the scheduling problem ofgarment assembly line based on genetic algorithmwas proposed. The chromosome was decoded usingtask precedence relation and after the operation ofreproduction, crossover and ... A new way to solve the scheduling problem ofgarment assembly line based on genetic algorithmwas proposed. The chromosome was decoded usingtask precedence relation and after the operation ofreproduction, crossover and mutation, the globaloptimal result can be obtained. Fitness function wasrepresented by smoothness Index ( SI ). Thesimulation shows that the method proposed in thispaper is better than the conventional way and theoptimized solution can be got in this way. 展开更多
关键词 Garment sewing Assembly Line Schedule Genetic Algorithm Smoothness Index
暂未订购 下载PDF
Filtering algorithm of line structured light for long-distance obstacle detection 认领 引用
14
作者 邵海燕 张振海 李科杰 《Journal of Beijing Institute of Technology》 EI CAS 2016年第4期521-525,共5页
Since unmanned ground vehicles often encounter concave and convex obstacles in wild ground, a filtering algorithm using line structured light to detect these long distance obstacles is proposed. For the line structure... Since unmanned ground vehicles often encounter concave and convex obstacles in wild ground, a filtering algorithm using line structured light to detect these long distance obstacles is proposed. For the line structured light image, a ranked-order based adaptively extremum median （RAEM） filter algorithm on salt and pepper noise is presented. In the algorithm, firstly effective points and noise points in a filtering window are differentiated; then the gray values of noise points are replaced by the medium of gray values of the effective pixels, with the efficient points＇ gray values unchanged; in the end this algorithm is proved to be efficient by experiments. Experimental resuits demonstrate that the image blur, resulting into proposed algorithm can remove noise points effectively and minimize the protecting the edge information as much as possible. 展开更多
关键词 unmanned ground vehicles line structured light concave and convex obstacles detec-tion ranked-order based adaptively extremum median （RAEM） filter filter algorithm
暂未订购 下载PDF
Assembly Line Balancing Based on Double Chromosome Genetic Algorithm 认领 引用
15
作者 刘俨后 左敦稳 张丹 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI 2014年第6期622-628,共7页
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. 展开更多
关键词 double chromosome genetic algorithm assembly line balancing mathematical model global optimum
暂未订购 下载PDF
A scenario relaxation algorithm for finite scenario based robust assembly line balancing 认领 引用
16
作者 徐炜达 Xiao Tianyuan 《High Technology Letters》 EI CAS 2011年第1期1-6,共6页
A balancing problem for a mixed model assembly line with uncertain task processmg Ume anO daily model mixed changes is considered, and the objective is to minimize the work variances between stations in the line. For ... A balancing problem for a mixed model assembly line with uncertain task processmg Ume anO daily model mixed changes is considered, and the objective is to minimize the work variances between stations in the line. For the balancing problem for the scenario-based robust assembly line with a finitely large number of potential scenarios, the direct solution methodology considering all potential scenarios is quite time-consuming. A scenario relaxation algorithm that embeds genetic al- gorithm is developed. This new algorithm guarantees termination at an optimal robust solution with relatively short running time, and makes it possible to solve robust problems with large quantities of potential scenarios. Extensive computational results are reported to show the efficiency and effectiveness of the proposed algorithm. 展开更多
关键词 scenario-based decision making robust optimization assembly line balancing genetic algorithm
暂未订购 下载PDF
Optimization of assembly line balancing using genetic algorithm 认领 引用 被引量：7
17
作者 N.Barathwaj P.Raja S.Gokulraj 《Journal of Central South University》 SCIE EI CAS CSCD 2015年第10期3957-3969,共13页
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). 展开更多
关键词 optimization line balancing genetic algorithm product family assembly line
暂未订购 下载PDF
A Multi-Object Genetic Algorithm for the Assembly Line Balance Optimization in Garment Flexible Job Shop Scheduling 认领 引用 被引量：1
18
作者 Junru Liu Yonggui Lv 《Intelligent Automation & Soft Computing》 SCIE 2023年第8期2421-2439,共19页
Numerous clothing enterprises in the market have a relatively low efficiency of assembly line planning due to insufficient optimization of bottleneck stations.As a result,the production efficiency of the enterprise is... Numerous clothing enterprises in the market have a relatively low efficiency of assembly line planning due to insufficient optimization of bottleneck stations.As a result,the production efficiency of the enterprise is not high,and the production organization is not up to expectations.Aiming at the problem of flexible process route planning in garment workshops,a multi-object genetic algorithm is proposed to solve the assembly line bal-ance optimization problem and minimize the machine adjustment path.The encoding method adopts the object-oriented path representation method,and the initial population is generated by random topology sorting based on an in-degree selection mechanism.The multi-object genetic algorithm improves the mutation and crossover operations according to the characteristics of the clothing process to avoid the generation of invalid offspring.In the iterative process,the bottleneck station is optimized by reasonable process splitting,and process allocation conforms to the strict limit of the station on the number of machines in order to improve the compilation efficiency.The effectiveness and feasibility of the multi-object genetic algorithm are proven by the analysis of clothing cases.Compared with the artificial allocation process,the compilation efficiency of MOGA is increased by more than 15%and completes the optimization of the minimum machine adjustment path.The results are in line with the expected optimization effect. 展开更多
关键词 Assembly line balance topological order genetic algorithm compilation efficiency pre-production scheduling
暂未订购 下载PDF
Genetic Algorithm for Concurrent Balancing of Mixed-Model Assembly Lines with Original Task Times of Models 认领 引用 被引量：2
19
作者 Panneerselvam Sivasankaran Peer Mohamed Shahabudeen 《Intelligent Information Management》 2013年第3期84-92,共9页
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. 展开更多
关键词 Assembly Line Balancing Cycle Time Genetic Algorithm Crossover Operation Mixed-Model
暂未订购 下载PDF
On Iterative Algorithm and Perturbation Analysis for the Nonlinear Matrix Equation 认领 引用
20
作者 Chacha Stephen Chacha 《Communications on Applied Mathematics and Computation》 2022年第3期1158-1174,共17页
In this study,an iterative algorithm is proposed to solve the nonlinear matrix equation X+A∗eXA=In.Explicit expressions for mixed and componentwise condition numbers with their upper bounds are derived to measure the ... In this study,an iterative algorithm is proposed to solve the nonlinear matrix equation X+A∗eXA=In.Explicit expressions for mixed and componentwise condition numbers with their upper bounds are derived to measure the sensitivity of the considered nonlinear matrix equation.Comparative analysis for the derived condition numbers and the proposed algorithm are presented.The proposed iterative algorithm reduces the number of iterations significantly when incorporated with exact line searches.Componentwise condition number seems more reliable to detect the sensitivity of the considered equation than mixed condition number as validated by numerical examples. 展开更多
关键词 Mixed condition number Componentwise condition number Iterative algorithm Perturbation analysis Exact line search
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 183 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈