A distributed blackboard decision-making framework for collaborative planning based on nested genetic algorithm （NGA） is proposed. By using blackboard-based communication paradigm and shared data structure, multiple...A distributed blackboard decision-making framework for collaborative planning based on nested genetic algorithm （NGA） is proposed. By using blackboard-based communication paradigm and shared data structure, multiple decision-makers （DMs） can collaboratively solve the tasks-platforms allocation scheduling problems dynamically through the coordinator. This methodo- logy combined with NGA maximizes tasks execution accuracy, also minimizes the weighted total workload of the DM which is measured in terms of intra-DM and inter-DM coordination. The intra-DM employs an optimization-based scheduling algorithm to match the tasks-platforms assignment request with its own platforms. The inter-DM coordinates the exchange of collaborative request information and platforms among DMs using the blackboard architecture. The numerical result shows that the proposed black- board DM framework based on NGA can obtain a near-optimal solution for the tasks-platforms collaborative planning problem. The assignment of platforms-tasks and the patterns of coordination can achieve a nice trade-off between intra-DM and inter-DM coordination workload.展开更多
A nested genetic algorithm, including genetic parameter level and genetic implemented level for peak parameters, was proposed and applied for resolving overlapped spectral bands. By the genetic parameter level, parame...A nested genetic algorithm, including genetic parameter level and genetic implemented level for peak parameters, was proposed and applied for resolving overlapped spectral bands. By the genetic parameter level, parameters of generic algorithm were optimized; moreover, the number of overlapped peaks was determined simultaneously Then parameters of individual peaks were computed with the genetic implemented level.展开更多
Using Genetic Algorithms (GAs) is a powerful tool to get solution to large scale design optimization problems. This paper used GA to solve complicated design optimization problems in two different applications. The ai...Using Genetic Algorithms (GAs) is a powerful tool to get solution to large scale design optimization problems. This paper used GA to solve complicated design optimization problems in two different applications. The aims are to implement the genetic algorithm to solve these two different (nested) problems, and to get the best or optimization solutions.展开更多
The nesting problem involves arranging pieces on a plate to maximize use of material. A new scheme for 2D ir- regular-shaped nesting problem is proposed. The new scheme is based on the NFP (No Fit Polygon) algorithm a...The nesting problem involves arranging pieces on a plate to maximize use of material. A new scheme for 2D ir- regular-shaped nesting problem is proposed. The new scheme is based on the NFP (No Fit Polygon) algorithm and a new placement principle for pieces. The novel placement principle is to place a piece to the position with lowest gravity center based on NFP. In addition, genetic algorithm (GA) is adopted to find an efficient nesting sequence. The proposed scheme can deal with pieces with arbitrary rotation and containing region with holes, and achieves competitive results in experiment on benchmark datasets.展开更多
We present a new algorithm for nesting problems.Many equally spaced points are set on a sheet,and a piece is moved to one of the points and rotated by an angle.Both the point and the rotation angle constitute the pack...We present a new algorithm for nesting problems.Many equally spaced points are set on a sheet,and a piece is moved to one of the points and rotated by an angle.Both the point and the rotation angle constitute the packing attitude of the piece.We propose a new algorithm named HAPE(Heuristic Algorithm based on the principle of minimum total Potential Energy) to find the optimal packing attitude at which the piece has the lowest center of gravity.In addition,a new technique for polygon overlap testing is proposed which avoids the time-consuming calculation of no-fit-polygon(NFP).The detailed implementation of HAPE is presented and two computational experiments are described.The first experiment is based on a real industrial problem and the second on 11 published benchmark problems.Using a hill-climbing(HC) search method,the proposed algorithm performs well in comparison with other published solutions.展开更多
Nested linear array enables to enhance localization resolution and achieve under-determined direction of arrival(DOA)estimation.In this paper,the traditional two-level nested linear array is improved to achieve more d...Nested linear array enables to enhance localization resolution and achieve under-determined direction of arrival(DOA)estimation.In this paper,the traditional two-level nested linear array is improved to achieve more degrees of freedom(DOFs)and better angle estimation performance.Furthermore,a computationally efficient DOA estimation algorithm is proposed.The discrete Fourier transform(DFT)method is utilized to obtain coarse DOA estimates,and subsequently,fine DOA estimates are achieved by spatial smoothing multiple signals classification(SS-MUSIC)algorithm.Compared to SS-MUSIC algorithm,the proposed algorithm has the same estimation accuracy with lower computational complexity because the coarse DOA estimates enable to shrink the range of angle spectral search.In addition,the estimation of the number of signals is not required in advance by DFT method.Extensive simulation results testify the effectiveness of the proposed algorithm.展开更多
The face recognition with expression and occlusion variation becomes the greatest challenge in biometric applications to recognize people. The proposed work concentrates on recognizing occlusion and seven kinds of exp...The face recognition with expression and occlusion variation becomes the greatest challenge in biometric applications to recognize people. The proposed work concentrates on recognizing occlusion and seven kinds of expression variations such as neutral, surprise, happy, sad, fear, disgust and angry. During enrollment process, principle component analysis (PCA) detects facial regions on the input image. The detected facial region is converted into fuzzy domain data to make decision during recognition process. The Haar wavelet transform extracts features from the detected facial regions. The Nested Hidden markov model is employed to train these features and each feature of face image is considered as states in a Markov chain to perform learning among the features. The maximum likelihood for the input image was estimated by using Baum Welch algorithm and these features were kept on database. During recognition process, the expression and occlusion varied face image is taken as the test image and maximum likelihood for test image is found by following same procedure done in enrollment process. The matching score between maximum likelihood of input image and test image is computed and it is utilized by fuzzy rule based method to decide whether the test image belongs to authorized or unauthorized. The proposed work was tested among several expression varied and occluded face images of JAFFE and AR datasets respectively.展开更多
According to the cutting stock problem of 2-dimensional shapes, a nesting system （NS） based on hybrid genetic algorithm （HGA） is established. The system optimizes the sequence and angles of polygons with hybrid Ge...According to the cutting stock problem of 2-dimensional shapes, a nesting system （NS） based on hybrid genetic algorithm （HGA） is established. The system optimizes the sequence and angles of polygons with hybrid Genetic Algorithm to accomplish the superior solution. It nests the irregular shape directly without covering irregular shapes with a rectangle. It also improves the decoding strategy of 2-dimensional shapes nesting based on the classical bottom-left strategy, makes the new strategy be universal to convex polygons, concave polygons and line-circular composted polygons.展开更多
The nesting problem in the leather manufacturing is the problem of placing a set of irregularly shaped pieces (called stencils) on a set of irregularly shaped surfaces (called leathers sheets). This paper presents a n...The nesting problem in the leather manufacturing is the problem of placing a set of irregularly shaped pieces (called stencils) on a set of irregularly shaped surfaces (called leathers sheets). This paper presents a novel and promising processing approach. After the profile of leather sheets and stencils is obtained with digitizer, the discretization makes the processing independent of the specific geometrical information. The constraints of profile are regarded thoroughly. A heuristic bottom-left placement strategy is employed to sequentially locate stencils on sheets. The optimal placement sequence and rotation are deterimined by genetic algorithms (GA). A natural concise encoding method is developed to satisfy all the possible requirements of the leather nesting problem. The experimental results show that the proposed algorithm can not only be applied to the normal two-dimensional nesting problem, but also especially suitable for the placement of multiple two-dimensional irregular stencils on multiple two-dimensional irregular sheets.展开更多
This review article provides a comprehensive analysis of nesting optimization algorithms in the shipbuilding industry,emphasizing their role in improving material utilization,minimizing waste,and enhancing production ...This review article provides a comprehensive analysis of nesting optimization algorithms in the shipbuilding industry,emphasizing their role in improving material utilization,minimizing waste,and enhancing production efficiency.The shipbuilding process involves the complex cutting and arrangement of steel plates,making the optimization of these operations vital for cost-effectiveness and sustainability.Nesting algorithms are broadly classified into four categories:exact,heuristic,metaheuristic,and hybrid.Exact algorithms ensure optimal solutions but are computationally demanding.In contrast,heuristic algorithms deliver quicker results using practical rules,although they may not consistently achieve optimal outcomes.Metaheuristic algorithms combine multiple heuristics to effectively explore solution spaces,striking a balance between solution quality and computational efficiency.Hybrid algorithms integrate the strengths of different approaches to further enhance performance.This review systematically assesses these algorithms using criteria such as material dimensions,part geometry,component layout,and computational efficiency.The findings highlight the significant potential of advanced nesting techniques to improve material utilization,reduce production costs,and promote sustainable practices in shipbuilding.By adopting suitable nesting solutions,shipbuilders can achieve greater efficiency,optimized resource management,and superior overall performance.Future research directions should focus on integrating machine learning and real-time adaptability to further enhance nesting algorithms,paving the way for smarter,more sustainable manufacturing practices in the shipbuilding industry.展开更多
First, the main procedures and the distinctive features of the most-obtuse-angle（MOA）row or column pivot rules are introduced for achieving primal or dual feasibility in linear programming. Then, two special auxilia...First, the main procedures and the distinctive features of the most-obtuse-angle（MOA）row or column pivot rules are introduced for achieving primal or dual feasibility in linear programming. Then, two special auxiliary problems are constructed to prove that each of the rules can be actually considered as a simplex approach for solving the corresponding auxiliary problem. In addition, the nested pricing rule is also reviewed and its geometric interpretation is offered based on the heuristic characterization of an optimal solution.展开更多
In the process of protected protocol recognition,an improved AGglomerative NESting algorithm( IAGNES) with high adaptability is proposed,which is based on the AGglomerative NESting algorithm( AGNES),for the challengin...In the process of protected protocol recognition,an improved AGglomerative NESting algorithm( IAGNES) with high adaptability is proposed,which is based on the AGglomerative NESting algorithm( AGNES),for the challenging issue of how to obtain single protocol data frames from multiprotocol data frames. It can improve accuracy and efficiency by similarity between bit-stream data frames and clusters,extract clusters in the process of clustering. Every cluster obtained contains similarity evaluation index which is helpful to evaluation. More importantly,IAGNES algorithm can automatically recognize the number of cluster. Experiments on the data set published by Lincoln Laboratory shows that the algorithm can cluster the protocol data frames with high accuracy.展开更多
基金supported by the National Aerospace Science Foundation of China(20138053038)the Graduate Starting Seed Fund of Northwestern Polytechnical University(Z2015111)
文摘A distributed blackboard decision-making framework for collaborative planning based on nested genetic algorithm （NGA） is proposed. By using blackboard-based communication paradigm and shared data structure, multiple decision-makers （DMs） can collaboratively solve the tasks-platforms allocation scheduling problems dynamically through the coordinator. This methodo- logy combined with NGA maximizes tasks execution accuracy, also minimizes the weighted total workload of the DM which is measured in terms of intra-DM and inter-DM coordination. The intra-DM employs an optimization-based scheduling algorithm to match the tasks-platforms assignment request with its own platforms. The inter-DM coordinates the exchange of collaborative request information and platforms among DMs using the blackboard architecture. The numerical result shows that the proposed black- board DM framework based on NGA can obtain a near-optimal solution for the tasks-platforms collaborative planning problem. The assignment of platforms-tasks and the patterns of coordination can achieve a nice trade-off between intra-DM and inter-DM coordination workload.
文摘A nested genetic algorithm, including genetic parameter level and genetic implemented level for peak parameters, was proposed and applied for resolving overlapped spectral bands. By the genetic parameter level, parameters of generic algorithm were optimized; moreover, the number of overlapped peaks was determined simultaneously Then parameters of individual peaks were computed with the genetic implemented level.
文摘Using Genetic Algorithms (GAs) is a powerful tool to get solution to large scale design optimization problems. This paper used GA to solve complicated design optimization problems in two different applications. The aims are to implement the genetic algorithm to solve these two different (nested) problems, and to get the best or optimization solutions.
基金Project (No. 60573146) supported by the National Natural ScienceFoundation of China
文摘The nesting problem involves arranging pieces on a plate to maximize use of material. A new scheme for 2D ir- regular-shaped nesting problem is proposed. The new scheme is based on the NFP (No Fit Polygon) algorithm and a new placement principle for pieces. The novel placement principle is to place a piece to the position with lowest gravity center based on NFP. In addition, genetic algorithm (GA) is adopted to find an efficient nesting sequence. The proposed scheme can deal with pieces with arbitrary rotation and containing region with holes, and achieves competitive results in experiment on benchmark datasets.
文摘We present a new algorithm for nesting problems.Many equally spaced points are set on a sheet,and a piece is moved to one of the points and rotated by an angle.Both the point and the rotation angle constitute the packing attitude of the piece.We propose a new algorithm named HAPE(Heuristic Algorithm based on the principle of minimum total Potential Energy) to find the optimal packing attitude at which the piece has the lowest center of gravity.In addition,a new technique for polygon overlap testing is proposed which avoids the time-consuming calculation of no-fit-polygon(NFP).The detailed implementation of HAPE is presented and two computational experiments are described.The first experiment is based on a real industrial problem and the second on 11 published benchmark problems.Using a hill-climbing(HC) search method,the proposed algorithm performs well in comparison with other published solutions.
基金supported by the Postgraduate Research & Practice Innovation Program of Jiangsu Province (No.SJCX18_0103)Key Laboratory of Dynamic Cognitive System of Electromagnetic Spectrum Space (Nanjing University of Aeronautics and Astronautics), Ministry of Industry and Information Technology (No.KF20181915)
文摘Nested linear array enables to enhance localization resolution and achieve under-determined direction of arrival(DOA)estimation.In this paper,the traditional two-level nested linear array is improved to achieve more degrees of freedom(DOFs)and better angle estimation performance.Furthermore,a computationally efficient DOA estimation algorithm is proposed.The discrete Fourier transform(DFT)method is utilized to obtain coarse DOA estimates,and subsequently,fine DOA estimates are achieved by spatial smoothing multiple signals classification(SS-MUSIC)algorithm.Compared to SS-MUSIC algorithm,the proposed algorithm has the same estimation accuracy with lower computational complexity because the coarse DOA estimates enable to shrink the range of angle spectral search.In addition,the estimation of the number of signals is not required in advance by DFT method.Extensive simulation results testify the effectiveness of the proposed algorithm.
文摘The face recognition with expression and occlusion variation becomes the greatest challenge in biometric applications to recognize people. The proposed work concentrates on recognizing occlusion and seven kinds of expression variations such as neutral, surprise, happy, sad, fear, disgust and angry. During enrollment process, principle component analysis (PCA) detects facial regions on the input image. The detected facial region is converted into fuzzy domain data to make decision during recognition process. The Haar wavelet transform extracts features from the detected facial regions. The Nested Hidden markov model is employed to train these features and each feature of face image is considered as states in a Markov chain to perform learning among the features. The maximum likelihood for the input image was estimated by using Baum Welch algorithm and these features were kept on database. During recognition process, the expression and occlusion varied face image is taken as the test image and maximum likelihood for test image is found by following same procedure done in enrollment process. The matching score between maximum likelihood of input image and test image is computed and it is utilized by fuzzy rule based method to decide whether the test image belongs to authorized or unauthorized. The proposed work was tested among several expression varied and occluded face images of JAFFE and AR datasets respectively.
基金Supported by the National Key Technology and Equipment Project of the 10th Five-Year Plan (ZZ02-03-03-01)
文摘According to the cutting stock problem of 2-dimensional shapes, a nesting system （NS） based on hybrid genetic algorithm （HGA） is established. The system optimizes the sequence and angles of polygons with hybrid Genetic Algorithm to accomplish the superior solution. It nests the irregular shape directly without covering irregular shapes with a rectangle. It also improves the decoding strategy of 2-dimensional shapes nesting based on the classical bottom-left strategy, makes the new strategy be universal to convex polygons, concave polygons and line-circular composted polygons.
文摘The nesting problem in the leather manufacturing is the problem of placing a set of irregularly shaped pieces (called stencils) on a set of irregularly shaped surfaces (called leathers sheets). This paper presents a novel and promising processing approach. After the profile of leather sheets and stencils is obtained with digitizer, the discretization makes the processing independent of the specific geometrical information. The constraints of profile are regarded thoroughly. A heuristic bottom-left placement strategy is employed to sequentially locate stencils on sheets. The optimal placement sequence and rotation are deterimined by genetic algorithms (GA). A natural concise encoding method is developed to satisfy all the possible requirements of the leather nesting problem. The experimental results show that the proposed algorithm can not only be applied to the normal two-dimensional nesting problem, but also especially suitable for the placement of multiple two-dimensional irregular stencils on multiple two-dimensional irregular sheets.
文摘This review article provides a comprehensive analysis of nesting optimization algorithms in the shipbuilding industry,emphasizing their role in improving material utilization,minimizing waste,and enhancing production efficiency.The shipbuilding process involves the complex cutting and arrangement of steel plates,making the optimization of these operations vital for cost-effectiveness and sustainability.Nesting algorithms are broadly classified into four categories:exact,heuristic,metaheuristic,and hybrid.Exact algorithms ensure optimal solutions but are computationally demanding.In contrast,heuristic algorithms deliver quicker results using practical rules,although they may not consistently achieve optimal outcomes.Metaheuristic algorithms combine multiple heuristics to effectively explore solution spaces,striking a balance between solution quality and computational efficiency.Hybrid algorithms integrate the strengths of different approaches to further enhance performance.This review systematically assesses these algorithms using criteria such as material dimensions,part geometry,component layout,and computational efficiency.The findings highlight the significant potential of advanced nesting techniques to improve material utilization,reduce production costs,and promote sustainable practices in shipbuilding.By adopting suitable nesting solutions,shipbuilders can achieve greater efficiency,optimized resource management,and superior overall performance.Future research directions should focus on integrating machine learning and real-time adaptability to further enhance nesting algorithms,paving the way for smarter,more sustainable manufacturing practices in the shipbuilding industry.
基金The National Natural Science Foundation of China(No.10371017).
文摘First, the main procedures and the distinctive features of the most-obtuse-angle（MOA）row or column pivot rules are introduced for achieving primal or dual feasibility in linear programming. Then, two special auxiliary problems are constructed to prove that each of the rules can be actually considered as a simplex approach for solving the corresponding auxiliary problem. In addition, the nested pricing rule is also reviewed and its geometric interpretation is offered based on the heuristic characterization of an optimal solution.
基金Supported by the National Natural Science Foundation of China(No.F020704)
文摘In the process of protected protocol recognition,an improved AGglomerative NESting algorithm( IAGNES) with high adaptability is proposed,which is based on the AGglomerative NESting algorithm( AGNES),for the challenging issue of how to obtain single protocol data frames from multiprotocol data frames. It can improve accuracy and efficiency by similarity between bit-stream data frames and clusters,extract clusters in the process of clustering. Every cluster obtained contains similarity evaluation index which is helpful to evaluation. More importantly,IAGNES algorithm can automatically recognize the number of cluster. Experiments on the data set published by Lincoln Laboratory shows that the algorithm can cluster the protocol data frames with high accuracy.
