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 research on scheduling and heat integration of batch process plays an important role in reducing energy consumption,improving production efficiency and enhancing the competitiveness of industries.The complexity an...The research on scheduling and heat integration of batch process plays an important role in reducing energy consumption,improving production efficiency and enhancing the competitiveness of industries.The complexity and difficulty of the model solving are increased due to the comprehensive consideration of both scheduling and heat integration.In this paper,the mixed integer nonlinear programming(MINLP) mathematical model of multi-product plant heat integration optimization with the goal of energy-saving annual profit(EAP) is established.The simultaneous optimization and sequential optimization are carried out respectively by bi-level programming(BP) based on the genetic algorithm(GA),and the calculation results are compared.EAP better captures the trade-off relationship between scheduling schemes,energy-saving profits,and equipment costs.The bi-level programming approach based on GA categorizes variables into integer and real types,enabling structural optimization and parameter optimization of the heat exchanger network.This,in turn,enhances solution efficiency and overcomes the limitations of conventional optimization algorithms in terms of solution speed and quality.Two examples show that the EAP of indirect heat integration considering the storage tank are 21% and 2% higher than that of the direct heat integration,and EAP of the simultaneous optimization are26% and 6% higher than that of the sequential optimization.The example demonstrates that the model and algorithm are applicable to batch multi-product plants,such as those in the chemical,pharmaceutical,and food industries,and possess strong practicality and innovation.展开更多
Based on genetic algorithms, a solution algorithm is presented for the bi-level decision making problem with continuous variables in the upper level in accordance with the bi-level decision making principle. The algor...Based on genetic algorithms, a solution algorithm is presented for the bi-level decision making problem with continuous variables in the upper level in accordance with the bi-level decision making principle. The algorithm is compared with Monte Carlo simulated annealing algorithm, and its feasibility and effectiveness are verified with two calculating examples.展开更多
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.展开更多
In silico approaches for metabolites optimization have been derived from the flood of sequenced and annotated genomes. However, there exist still numerous degrees of freedom in terms of optimization algorithm approach...In silico approaches for metabolites optimization have been derived from the flood of sequenced and annotated genomes. However, there exist still numerous degrees of freedom in terms of optimization algorithm approaches that can be exploited in order to enhance yield of processes which are based on biological reactions. Here, we propose an evolutionary approach aiming to suggest different mutant for augmenting ethanol yield using glycerol as substrate in Escherichia coli. We found that this algorithm, even though is far from providing the global optimum, is able to uncover genes that a global optimizer would be incapable of. By over-expressing accB, eno, dapE, and accA mutants in ethanol production was augmented up to 2 fold compared to its counterpart E. coli BW25113.展开更多
Wind farm layout optimization is a critical challenge in renewable energy development,especially in regions with complex terrain.Micro-siting of wind turbines has a significant impact on the overall efficiency and eco...Wind farm layout optimization is a critical challenge in renewable energy development,especially in regions with complex terrain.Micro-siting of wind turbines has a significant impact on the overall efficiency and economic viability of wind farm,where the wake effect,wind speed,types of wind turbines,etc.,have an impact on the output power of the wind farm.To solve the optimization problem of wind farm layout under complex terrain conditions,this paper proposes wind turbine layout optimization using different types of wind turbines,the aim is to reduce the influence of the wake effect and maximize economic benefits.The linear wake model is used for wake flow calculation over complex terrain.Minimizing the unit energy cost is taken as the objective function,considering that the objective function is affected by cost and output power,which influence each other.The cost function includes construction cost,installation cost,maintenance cost,etc.Therefore,a bi-level constrained optimization model is established,in which the upper-level objective function is to minimize the unit energy cost,and the lower-level objective function is to maximize the output power.Then,a hybrid evolutionary algorithm is designed according to the characteristics of the decision variables.The improved genetic algorithm and differential evolution are used to optimize the upper-level and lower-level objective functions,respectively,these evolutionary operations search for the optimal solution as much as possible.Finally,taking the roughness of different terrain,wind farms of different scales and different types of wind turbines as research scenarios,the optimal deployment is solved by using the algorithm in this paper,and four algorithms are compared to verify the effectiveness of the proposed algorithm.展开更多
Due to the fact that headway is a key factor to be considered in bus scheduling, this paper proposes a bi-level programming model for optimizing bus headway in public transit lines. In this model, with the interests o...Due to the fact that headway is a key factor to be considered in bus scheduling, this paper proposes a bi-level programming model for optimizing bus headway in public transit lines. In this model, with the interests of bus companies and passengers in mind, the upper-level model＇s objective is to minimize the total cost, which is affected by frequency settings, both in time and economy in the transit system. The lower-level model is a transit assignment model used to describe the assignment of passengers＇ trips to the network based on the optimal bus headway. In order to solve the proposed model, a hybrid genetic algorithm, namely the genetic algorithm and the simulated annealing algorithm （GA-SA）, is designed. Finally, the model and the algorithm are tested against the transit data, by taking some of the bus lines of Changzhou city as an example. Results indicate that the proposed model allows supply and demand to be linked, which is reasonable, and the solving algorithm is effective.展开更多
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.展开更多
The Scheduling of the Multi-EOSs Area Target Observation(SMEATO)is an EOS resource schedul-ing problem highly coupled with computational geometry.The advances in EOS technology and the ex-pansion of wide-area remote s...The Scheduling of the Multi-EOSs Area Target Observation(SMEATO)is an EOS resource schedul-ing problem highly coupled with computational geometry.The advances in EOS technology and the ex-pansion of wide-area remote sensing applications have increased the practical significance of SMEATO.In this paper,an adaptive local grid nesting-based genetic algorithm(ALGN-GA)is proposed for developing SMEATO solutions.First,a local grid nesting(LGN)strategy is designed to discretize the target area into parts,so as to avoid the explosive growth of calculations.A genetic algorithm(GA)framework is then used to share reserve information for the population during iterative evolution,which can generate high-quality solutions with low computational costs.On this basis,an adaptive technique is introduced to determine whether a local region requires nesting and whether the grid scale is sufficient.The effectiveness of the proposed model is assessed experimentally with nine randomly generated tests at different scales.The results show that the ALGN-GA offers advantages over several conventional algorithms in 88.9%of instances,especially in large-scale instances.These fully demonstrate the high efficiency and stability of the ALGN-GA.展开更多
基金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.
文摘The research on scheduling and heat integration of batch process plays an important role in reducing energy consumption,improving production efficiency and enhancing the competitiveness of industries.The complexity and difficulty of the model solving are increased due to the comprehensive consideration of both scheduling and heat integration.In this paper,the mixed integer nonlinear programming(MINLP) mathematical model of multi-product plant heat integration optimization with the goal of energy-saving annual profit(EAP) is established.The simultaneous optimization and sequential optimization are carried out respectively by bi-level programming(BP) based on the genetic algorithm(GA),and the calculation results are compared.EAP better captures the trade-off relationship between scheduling schemes,energy-saving profits,and equipment costs.The bi-level programming approach based on GA categorizes variables into integer and real types,enabling structural optimization and parameter optimization of the heat exchanger network.This,in turn,enhances solution efficiency and overcomes the limitations of conventional optimization algorithms in terms of solution speed and quality.Two examples show that the EAP of indirect heat integration considering the storage tank are 21% and 2% higher than that of the direct heat integration,and EAP of the simultaneous optimization are26% and 6% higher than that of the sequential optimization.The example demonstrates that the model and algorithm are applicable to batch multi-product plants,such as those in the chemical,pharmaceutical,and food industries,and possess strong practicality and innovation.
文摘Based on genetic algorithms, a solution algorithm is presented for the bi-level decision making problem with continuous variables in the upper level in accordance with the bi-level decision making principle. The algorithm is compared with Monte Carlo simulated annealing algorithm, and its feasibility and effectiveness are verified with two calculating examples.
基金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.
基金the support of the National BioResource Project(NIG,Japan):E.coli Strain for kindly providing us with the Keio Collection using for our experimental sectionAlso this work is funded by Vicerrectoria de investigaciones at Universidad de los Andes.
文摘In silico approaches for metabolites optimization have been derived from the flood of sequenced and annotated genomes. However, there exist still numerous degrees of freedom in terms of optimization algorithm approaches that can be exploited in order to enhance yield of processes which are based on biological reactions. Here, we propose an evolutionary approach aiming to suggest different mutant for augmenting ethanol yield using glycerol as substrate in Escherichia coli. We found that this algorithm, even though is far from providing the global optimum, is able to uncover genes that a global optimizer would be incapable of. By over-expressing accB, eno, dapE, and accA mutants in ethanol production was augmented up to 2 fold compared to its counterpart E. coli BW25113.
基金supported by the National Natural Science Foundation of China[Grant No.12461035]Qinghai University Students Innovative Training Program Project[2024-QX-57].
文摘Wind farm layout optimization is a critical challenge in renewable energy development,especially in regions with complex terrain.Micro-siting of wind turbines has a significant impact on the overall efficiency and economic viability of wind farm,where the wake effect,wind speed,types of wind turbines,etc.,have an impact on the output power of the wind farm.To solve the optimization problem of wind farm layout under complex terrain conditions,this paper proposes wind turbine layout optimization using different types of wind turbines,the aim is to reduce the influence of the wake effect and maximize economic benefits.The linear wake model is used for wake flow calculation over complex terrain.Minimizing the unit energy cost is taken as the objective function,considering that the objective function is affected by cost and output power,which influence each other.The cost function includes construction cost,installation cost,maintenance cost,etc.Therefore,a bi-level constrained optimization model is established,in which the upper-level objective function is to minimize the unit energy cost,and the lower-level objective function is to maximize the output power.Then,a hybrid evolutionary algorithm is designed according to the characteristics of the decision variables.The improved genetic algorithm and differential evolution are used to optimize the upper-level and lower-level objective functions,respectively,these evolutionary operations search for the optimal solution as much as possible.Finally,taking the roughness of different terrain,wind farms of different scales and different types of wind turbines as research scenarios,the optimal deployment is solved by using the algorithm in this paper,and four algorithms are compared to verify the effectiveness of the proposed algorithm.
基金The National Natural Science Foundation of China(No.50978057)the National Key Technology R& D Program of China duringthe 11th Five-Year Plan Period (No.2006BAJ18B03)+1 种基金the Scientific Research Foundation of Graduate School of Southeast University ( No.YBJJ1013)the Program for Postgraduates Research Innovation in University of Jiangsu Province(No.CX09B 060Z)
文摘Due to the fact that headway is a key factor to be considered in bus scheduling, this paper proposes a bi-level programming model for optimizing bus headway in public transit lines. In this model, with the interests of bus companies and passengers in mind, the upper-level model＇s objective is to minimize the total cost, which is affected by frequency settings, both in time and economy in the transit system. The lower-level model is a transit assignment model used to describe the assignment of passengers＇ trips to the network based on the optimal bus headway. In order to solve the proposed model, a hybrid genetic algorithm, namely the genetic algorithm and the simulated annealing algorithm （GA-SA）, is designed. Finally, the model and the algorithm are tested against the transit data, by taking some of the bus lines of Changzhou city as an example. Results indicate that the proposed model allows supply and demand to be linked, which is reasonable, and the solving algorithm is effective.
基金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.
基金supported in part by the National Natural Science Foundation of China(NSFC),under Grant Nos.72271074 and 72071064.
文摘The Scheduling of the Multi-EOSs Area Target Observation(SMEATO)is an EOS resource schedul-ing problem highly coupled with computational geometry.The advances in EOS technology and the ex-pansion of wide-area remote sensing applications have increased the practical significance of SMEATO.In this paper,an adaptive local grid nesting-based genetic algorithm(ALGN-GA)is proposed for developing SMEATO solutions.First,a local grid nesting(LGN)strategy is designed to discretize the target area into parts,so as to avoid the explosive growth of calculations.A genetic algorithm(GA)framework is then used to share reserve information for the population during iterative evolution,which can generate high-quality solutions with low computational costs.On this basis,an adaptive technique is introduced to determine whether a local region requires nesting and whether the grid scale is sufficient.The effectiveness of the proposed model is assessed experimentally with nine randomly generated tests at different scales.The results show that the ALGN-GA offers advantages over several conventional algorithms in 88.9%of instances,especially in large-scale instances.These fully demonstrate the high efficiency and stability of the ALGN-GA.
