We present an edge crossing minimization algorithm for hierarchical graphs based on genetic algorithms, and comparing it with some heuristic algorithms. The proposed algorithm is more efficient and has the following a...We present an edge crossing minimization algorithm for hierarchical graphs based on genetic algorithms, and comparing it with some heuristic algorithms. The proposed algorithm is more efficient and has the following advantages: the frame of the algorithms is unified, the method is simple, and its implementation and revision are easy.展开更多
Aimed at the uncertain characteristics of discrete logistics network design,an interval hierarchical triangular uncertain OD demand model based on interval demand and network flow is presented.Under consideration of t...Aimed at the uncertain characteristics of discrete logistics network design,an interval hierarchical triangular uncertain OD demand model based on interval demand and network flow is presented.Under consideration of the system profit,the uncertain demand of logistics network is measured by interval variables and interval parameters,and an interval planning model of discrete logistics network is established.The risk coefficient and maximum constrained deviation are defined to realize the certain transformation of the model.By integrating interval algorithm and genetic algorithm,an interval hierarchical optimal genetic algorithm is proposed to solve the model.It is shown by a tested example that in the same scenario condition an interval solution[3275.3,3 603.7]can be obtained by the model and algorithm which is obviously better than the single precise optimal solution by stochastic or fuzzy algorithm,so it can be reflected that the model and algorithm have more stronger operability and the solution result has superiority to scenario decision.展开更多
Using group and subassembly cluster methods, the hierarchical structure of a product is ?generated automatically, which largely reduces the complexity of planning. Based on genetic algorithm, the optimal of assembly s...Using group and subassembly cluster methods, the hierarchical structure of a product is ?generated automatically, which largely reduces the complexity of planning. Based on genetic algorithm, the optimal of assembly sequence of each structure level can be obtained by sequence-by-sequence search. As a result, a better assembly sequence of the product can be generated by combining the assembly sequences of all hierarchical structures, which provides more parallelism and flexibility for assembly operations. An industrial example is solved by this new approach.展开更多
Maintenance scheduling is essential and crucial for wind turbines (WTs) to avoid breakdowns andreduce maintenance costs. Many maintenance models have been developed for WTs’ maintenance planning, suchas corrective, p...Maintenance scheduling is essential and crucial for wind turbines (WTs) to avoid breakdowns andreduce maintenance costs. Many maintenance models have been developed for WTs’ maintenance planning, suchas corrective, preventive, and predictive maintenance. Due to communities’ dependence on WTs for electricityneeds, preventive maintenance is the most widely used method for maintenance scheduling. The downside tousing this approach is that preventive maintenance (PM) is often done in fixed intervals, which is inefficient. In thispaper, a more detailed maintenance plan for a 2 MW WT has been developed. The paper’s focus is to minimize aWT’s maintenance cost based on a WT’s reliability model. This study uses a two-layer optimization framework:Fibonacci and genetic algorithm. The first layer in the optimization method (Fibonacci) finds the optimal numberof PM required for the system. In the second layer, the optimal times for preventative maintenance and optimalcomponents to maintain have been determined to minimize maintenance costs. The Monte Carlo simulationestimates WT component failure times using their lifetime distributions from the reliability model. The estimatedfailure times are then used to determine the overall corrective and PM costs during the system’s lifetime. Finally,an optimal PM schedule is proposed for a 2 MW WT using the presented method. The method used in this papercan be expanded to a wind farm or similar engineering systems.展开更多
This paper presents four different hybrid genetic algorithms for network design problem in closed loop supply chain. They are compared using a complete factorial experiment with two factors, viz. problem size and algo...This paper presents four different hybrid genetic algorithms for network design problem in closed loop supply chain. They are compared using a complete factorial experiment with two factors, viz. problem size and algorithm. Based on the significance of the factor “algorithm”, the best algorithm is identified using Duncan’s multiple range test. Then it is compared with a mathematical model in terms of total cost. It is found that the best hybrid genetic algorithm identified gives results on par with the mathematical model in statistical terms. So, the best algorithm out of four algorithm proposed in this paper is proved to be superior to all other algorithms for all sizes of problems and its performance is equal to that of the mathematical model for small size and medium size problems.展开更多
A new multicast routing algorithm based on the hybrid genetic algorithm (HGA) is proposed. The coding pattern based on the number of routing paths is used. A fitness function that is computed easily and makes algorith...A new multicast routing algorithm based on the hybrid genetic algorithm (HGA) is proposed. The coding pattern based on the number of routing paths is used. A fitness function that is computed easily and makes algorithm quickly convergent is proposed. A new approach that defines the HGA's parameters is provided. The simulation shows that the approach can increase largely the convergent ratio, and the fitting values of the parameters of this algorithm are different from that of the original algorithms. The optimal mutation probability of HGA equals 0.50 in HGA in the experiment, but that equals 0.07 in SGA. It has been concluded that the population size has a significant influence on the HGA's convergent ratio when it's mutation probability is bigger. The algorithm with a small population size has a high average convergent rate. The population size has little influence on HGA with the lower mutation probability.展开更多
A genetic algorithm-based joint inversion method is presented for evaluating hydrocarbon-bearing geological formations. Conventional inversion procedures routinely used in the oil industry perform the inversion proces...A genetic algorithm-based joint inversion method is presented for evaluating hydrocarbon-bearing geological formations. Conventional inversion procedures routinely used in the oil industry perform the inversion processing of borehole geophysical data locally. As having barely more types of data than unknowns in a depth, a set of marginally over-determined inverse problems has to be solved along a borehole, which is a rather noise sensitive procedure. For the reduction of noise effect, the amount of overdetermination must be increased. To fulfill this requirement, we suggest the use of our interval inversion method, which inverts simultaneously all data from a greater depth interval to estimate petrophysical parameters of reservoirs to the same interval. A series expansion based discretization scheme ensures much more data against unknowns that significantly reduces the estimation error of model parameters. The knowledge of reservoir boundaries is also required for reserve calculation. Well logs contain information about layer-thicknesses, but they cannot be extracted by the local inversion approach. We showed earlier that the depth coordinates of layerboundaries can be determined within the interval inversion procedure. The weakness of method is that the output of inversion is highly influenced by arbitrary assumptions made for layer-thicknesses when creating a starting model (i.e. number of layers, search domain of thicknesses). In this study, we apply an automated procedure for the determination of rock interfaces. We perform multidimensional hierarchical cluster analysis on well-logging data before inversion that separates the measuring points of different layers on a lithological basis. As a result, the vertical distribution of clusters furnishes the coordinates of layer-boundaries, which are then used as initial model parameters for the interval inversion procedure. The improved inversion method gives a fast, automatic and objective estimation to layer-boundaries and petrophysical parameters, which is demonstrated by a hydrocarbon field example.展开更多
The implementation of closed loop supply chain system is becoming essential for fashion leather products industry to ensure an economically sustainable business model and eco-friendly industrial practice as demanded b...The implementation of closed loop supply chain system is becoming essential for fashion leather products industry to ensure an economically sustainable business model and eco-friendly industrial practice as demanded by the environmental regulations, consumer awareness and the prevailing social consciousness. In this context, this research work addresses a closed loop supply chain network problem of fashion leather goods industry, with an objective of minimizing the total cost of the entire supply chain and also reducing the total waste from the end of life product returns. The research work commenced with a literature review on the reverse and closed loop supply chain network design problems of fashion and leather goods industry dealt in the past. Then, the identified CLSCND problem is solved using a mathematical model based on Mixed Integer Non-Linear Programme (MINLP) and then a suitable Hybrid Genetic Algorithm (HGA) developed for the CLSCND is implemented for obtaining optimum solution. Both the MINLP model and HGA are customized as per the CLSCND problem chosen and implemented for the industrial case of an Indian Fashion Leather Goods Industry. Finally, the solutions obtained for MINLP model in LINGO 15 and for HGA in VB.NET platform are compared and presented. The optimum solution obtained from the suitable HGA is illustrated as an optimum shipment pattern for the closed loop supply chain network design problem of the fashion leather goods industry case.展开更多
Recently the integrated modular avionics (IMA) architecture which introduces the concept of resource partitioning becomes popular as an alternative to the traditional federated architecture. A novel hierarchical app...Recently the integrated modular avionics (IMA) architecture which introduces the concept of resource partitioning becomes popular as an alternative to the traditional federated architecture. A novel hierarchical approach is proposed to solve the resource allocation problem for IMA systems in distributed environments. Firstly, the worst case response time of tasks with arbitrary deadlines is analyzed for the two-level scheduler. Then, the hierarchical resource allocation approach is presented in two levels. At the platform level, a task assignment algorithm based on genetic simulated annealing (GSA) is proposed to assign a set of pre-defined tasks to different processing nodes in the form of task groups, so that resources can be allocated as partitions and mapped to task groups. While yielding to all the resource con- straints, the algorithm tries to find an optimal task assignment with minimized communication costs and balanced work load. At the node level, partition parameters are optimized, so that the computational resource can be allocated further. An example is shown to illustrate the hierarchal resource allocation approach and manifest the validity. Simulation results comparing the performance of the proposed GSA with that of traditional genetic algorithms are presented in the context of task assignment in IMA systems.展开更多
文摘We present an edge crossing minimization algorithm for hierarchical graphs based on genetic algorithms, and comparing it with some heuristic algorithms. The proposed algorithm is more efficient and has the following advantages: the frame of the algorithms is unified, the method is simple, and its implementation and revision are easy.
基金Project(51178061)supported by the National Natural Science Foundation of ChinaProject(2010FJ6016)supported by Hunan Provincial Science and Technology,China+1 种基金Project(12C0015)supported by Scientific Research Fund of Hunan Provincial Education Department,ChinaProject(13JJ3072)supported by Hunan Provincial Natural Science Foundation of China
文摘Aimed at the uncertain characteristics of discrete logistics network design,an interval hierarchical triangular uncertain OD demand model based on interval demand and network flow is presented.Under consideration of the system profit,the uncertain demand of logistics network is measured by interval variables and interval parameters,and an interval planning model of discrete logistics network is established.The risk coefficient and maximum constrained deviation are defined to realize the certain transformation of the model.By integrating interval algorithm and genetic algorithm,an interval hierarchical optimal genetic algorithm is proposed to solve the model.It is shown by a tested example that in the same scenario condition an interval solution[3275.3,3 603.7]can be obtained by the model and algorithm which is obviously better than the single precise optimal solution by stochastic or fuzzy algorithm,so it can be reflected that the model and algorithm have more stronger operability and the solution result has superiority to scenario decision.
基金the Natural Science Foundation of China (59990470, 59725514, 59985004), andRobotics Laboratory, Chinese Academy of Sciences fo
文摘Using group and subassembly cluster methods, the hierarchical structure of a product is ?generated automatically, which largely reduces the complexity of planning. Based on genetic algorithm, the optimal of assembly sequence of each structure level can be obtained by sequence-by-sequence search. As a result, a better assembly sequence of the product can be generated by combining the assembly sequences of all hierarchical structures, which provides more parallelism and flexibility for assembly operations. An industrial example is solved by this new approach.
基金the Natural Sciences and Engineering Research Council of Canada(Grant No.RGPIN-2019-05361)and the University Research Grants Program.
文摘Maintenance scheduling is essential and crucial for wind turbines (WTs) to avoid breakdowns andreduce maintenance costs. Many maintenance models have been developed for WTs’ maintenance planning, suchas corrective, preventive, and predictive maintenance. Due to communities’ dependence on WTs for electricityneeds, preventive maintenance is the most widely used method for maintenance scheduling. The downside tousing this approach is that preventive maintenance (PM) is often done in fixed intervals, which is inefficient. In thispaper, a more detailed maintenance plan for a 2 MW WT has been developed. The paper’s focus is to minimize aWT’s maintenance cost based on a WT’s reliability model. This study uses a two-layer optimization framework:Fibonacci and genetic algorithm. The first layer in the optimization method (Fibonacci) finds the optimal numberof PM required for the system. In the second layer, the optimal times for preventative maintenance and optimalcomponents to maintain have been determined to minimize maintenance costs. The Monte Carlo simulationestimates WT component failure times using their lifetime distributions from the reliability model. The estimatedfailure times are then used to determine the overall corrective and PM costs during the system’s lifetime. Finally,an optimal PM schedule is proposed for a 2 MW WT using the presented method. The method used in this papercan be expanded to a wind farm or similar engineering systems.
文摘This paper presents four different hybrid genetic algorithms for network design problem in closed loop supply chain. They are compared using a complete factorial experiment with two factors, viz. problem size and algorithm. Based on the significance of the factor “algorithm”, the best algorithm is identified using Duncan’s multiple range test. Then it is compared with a mathematical model in terms of total cost. It is found that the best hybrid genetic algorithm identified gives results on par with the mathematical model in statistical terms. So, the best algorithm out of four algorithm proposed in this paper is proved to be superior to all other algorithms for all sizes of problems and its performance is equal to that of the mathematical model for small size and medium size problems.
文摘A new multicast routing algorithm based on the hybrid genetic algorithm (HGA) is proposed. The coding pattern based on the number of routing paths is used. A fitness function that is computed easily and makes algorithm quickly convergent is proposed. A new approach that defines the HGA's parameters is provided. The simulation shows that the approach can increase largely the convergent ratio, and the fitting values of the parameters of this algorithm are different from that of the original algorithms. The optimal mutation probability of HGA equals 0.50 in HGA in the experiment, but that equals 0.07 in SGA. It has been concluded that the population size has a significant influence on the HGA's convergent ratio when it's mutation probability is bigger. The algorithm with a small population size has a high average convergent rate. The population size has little influence on HGA with the lower mutation probability.
文摘A genetic algorithm-based joint inversion method is presented for evaluating hydrocarbon-bearing geological formations. Conventional inversion procedures routinely used in the oil industry perform the inversion processing of borehole geophysical data locally. As having barely more types of data than unknowns in a depth, a set of marginally over-determined inverse problems has to be solved along a borehole, which is a rather noise sensitive procedure. For the reduction of noise effect, the amount of overdetermination must be increased. To fulfill this requirement, we suggest the use of our interval inversion method, which inverts simultaneously all data from a greater depth interval to estimate petrophysical parameters of reservoirs to the same interval. A series expansion based discretization scheme ensures much more data against unknowns that significantly reduces the estimation error of model parameters. The knowledge of reservoir boundaries is also required for reserve calculation. Well logs contain information about layer-thicknesses, but they cannot be extracted by the local inversion approach. We showed earlier that the depth coordinates of layerboundaries can be determined within the interval inversion procedure. The weakness of method is that the output of inversion is highly influenced by arbitrary assumptions made for layer-thicknesses when creating a starting model (i.e. number of layers, search domain of thicknesses). In this study, we apply an automated procedure for the determination of rock interfaces. We perform multidimensional hierarchical cluster analysis on well-logging data before inversion that separates the measuring points of different layers on a lithological basis. As a result, the vertical distribution of clusters furnishes the coordinates of layer-boundaries, which are then used as initial model parameters for the interval inversion procedure. The improved inversion method gives a fast, automatic and objective estimation to layer-boundaries and petrophysical parameters, which is demonstrated by a hydrocarbon field example.
文摘The implementation of closed loop supply chain system is becoming essential for fashion leather products industry to ensure an economically sustainable business model and eco-friendly industrial practice as demanded by the environmental regulations, consumer awareness and the prevailing social consciousness. In this context, this research work addresses a closed loop supply chain network problem of fashion leather goods industry, with an objective of minimizing the total cost of the entire supply chain and also reducing the total waste from the end of life product returns. The research work commenced with a literature review on the reverse and closed loop supply chain network design problems of fashion and leather goods industry dealt in the past. Then, the identified CLSCND problem is solved using a mathematical model based on Mixed Integer Non-Linear Programme (MINLP) and then a suitable Hybrid Genetic Algorithm (HGA) developed for the CLSCND is implemented for obtaining optimum solution. Both the MINLP model and HGA are customized as per the CLSCND problem chosen and implemented for the industrial case of an Indian Fashion Leather Goods Industry. Finally, the solutions obtained for MINLP model in LINGO 15 and for HGA in VB.NET platform are compared and presented. The optimum solution obtained from the suitable HGA is illustrated as an optimum shipment pattern for the closed loop supply chain network design problem of the fashion leather goods industry case.
基金supported by the National Natural Science Foundation of China (60879024)
文摘Recently the integrated modular avionics (IMA) architecture which introduces the concept of resource partitioning becomes popular as an alternative to the traditional federated architecture. A novel hierarchical approach is proposed to solve the resource allocation problem for IMA systems in distributed environments. Firstly, the worst case response time of tasks with arbitrary deadlines is analyzed for the two-level scheduler. Then, the hierarchical resource allocation approach is presented in two levels. At the platform level, a task assignment algorithm based on genetic simulated annealing (GSA) is proposed to assign a set of pre-defined tasks to different processing nodes in the form of task groups, so that resources can be allocated as partitions and mapped to task groups. While yielding to all the resource con- straints, the algorithm tries to find an optimal task assignment with minimized communication costs and balanced work load. At the node level, partition parameters are optimized, so that the computational resource can be allocated further. An example is shown to illustrate the hierarchal resource allocation approach and manifest the validity. Simulation results comparing the performance of the proposed GSA with that of traditional genetic algorithms are presented in the context of task assignment in IMA systems.