In this paper a hybrid parallel multi-objective genetic algorithm is proposed for solving 0/1 knapsack problem. Multi-objective problems with non-convex and discrete Pareto front can take enormous computation time to ...In this paper a hybrid parallel multi-objective genetic algorithm is proposed for solving 0/1 knapsack problem. Multi-objective problems with non-convex and discrete Pareto front can take enormous computation time to converge to the true Pareto front. Hence, the classical multi-objective genetic algorithms (MOGAs) (i.e., non- Parallel MOGAs) may fail to solve such intractable problem in a reasonable amount of time. The proposed hybrid model will combine the best attribute of island and Jakobovic master slave models. We conduct an extensive experimental study in a multi-core system by varying the different size of processors and the result is compared with basic parallel model i.e., master-slave model which is used to parallelize NSGA-II. The experimental results confirm that the hybrid model is showing a clear edge over master-slave model in terms of processing time and approximation to the true Pareto front.展开更多
In order to optimize the knapsack problem further, this paper proposes an innovative model based on dynamic expectation efficiency, and establishes a new optimization algorithm of 0-1 knapsack problem after analysis a...In order to optimize the knapsack problem further, this paper proposes an innovative model based on dynamic expectation efficiency, and establishes a new optimization algorithm of 0-1 knapsack problem after analysis and research. Through analyzing the study of 30 groups of 0-1 knapsack problem from discrete coefficient of the data, we can find that dynamic expectation model can solve the following two types of knapsack problem. Compared to artificial glowworm swam algorithm, the convergence speed of this algorithm is ten times as fast as that of artificial glowworm swam algorithm, and the storage space of this algorithm is one quarter that of artificial glowworm swam algorithm. To sum up, it can be widely used in practical problems.展开更多
A 0-1 integer programming model for weekly fleet assignment was put forward based on linear network and weekly flight scheduling in China. In this model, the objective function is to maximize the total profit of fleet...A 0-1 integer programming model for weekly fleet assignment was put forward based on linear network and weekly flight scheduling in China. In this model, the objective function is to maximize the total profit of fleet assignment, subject to the constraints of coverage, aircraft flow balance, fleet size, aircraft availability, aircraft usage, flight restriction, aircraft seat capacity, and stopover. Then the branch-and-bound algorithm based on special ordered set was applied to solve the model. At last, a real- wofld case study on an airline with 5 fleets, 48 aircrafts and 1 786 flight legs indicated that the profit increase was ￥ 1 591276 one week and the running time was no more than 4 rain, which shows that the model and algorithm are fairly good for domestic airline.展开更多
In this paper, we construct two models for the searching task for a lost plane. Model 1 determines the searching area. We predict the trajectory of floats generated after the disintegration of the plane by using RBF n...In this paper, we construct two models for the searching task for a lost plane. Model 1 determines the searching area. We predict the trajectory of floats generated after the disintegration of the plane by using RBF neural network model, and then determine the searching area according to the trajectory. With the pass of time, the searching area will also be constantly moving along the trajectory. Model 2 develops a maritime search plan to achieve the purpose of completing the search in the shortest time. We optimize the searching time and transform the problem into the 0-1 knapsack problem. Solving this problem by improved genetic algorithm, we can get the shortest searching time and the best choice for the search power.展开更多
Increasing complexity of distributed hydrological model （DHM） has lowered the efficiency of convergence.In this study,global sensitivity analysis （SA） was introduced by combining multiobjective （MO） optimization...Increasing complexity of distributed hydrological model （DHM） has lowered the efficiency of convergence.In this study,global sensitivity analysis （SA） was introduced by combining multiobjective （MO） optimization for DHM calibration.Latin Hypercube-once at a time （LH-OAT） was adopted in global parameter SA to obtain relative sensitivity of model parameter,which can be categorized into different sensitivity levels.Two comparative study cases were conducted to present the efficiency and feasibility by combining SA with MO（SA-MO）.WetSpa model with non-dominated sorting genetic algorithm-Ⅱ （NSGA-Ⅱ） algorithm and EasyDHM model with multi-objective sequential complex evolutionary metropolis-uncertainty analysis （MOSCEM-UA）algorithm were adopted to demonstrate the general feasibility of combining SA in optimization.Results showed that the LH-OAT was globally effective in selecting high sensitivity parameters.It proves that using parameter from high sensitivity groups results in higher convergence efficiency.Study case Ⅰ showed a better Pareto front distribution and convergence compared with model calibration without SA.Study case Ⅱ indicated a more efficient convergence of parameters in sequential evolution of MOSCEM-UA under the same iteration.It indicates that SA-MO is feasible and efficient for high dimensional DHM calibration.展开更多
This paper proposed the optimized three-stage strategy of orderly management of file stream in network printing workflow. In first stage the customer preflight was added to the conventional prepress preflight, which s...This paper proposed the optimized three-stage strategy of orderly management of file stream in network printing workflow. In first stage the customer preflight was added to the conventional prepress preflight, which set quick-type, general-type, stable-type and comprehensive-type preflight scheme for customers by investigating the possibility of occurrence of errors of various preflight entries and customer relevancy. Based on four types of preflight schemes, four customer preflight applications were created by using Pitstop Pro and Connector You. Customers can select one of the appropriate applications for quick preflight before delivering to reduce the probability of returning the files back for correction when errors occur in preflight. Second stage is printing enterprise prepress preflight,which proposed the concept of the prepress preflight tolerance. In addition, according to the different requirements of printing technology and quality, this paper established the prepress preflight scheme based on the printing enterprises’ tolerance for preflight error. Third stage is to manage the optimized sorting of prepress file stream. To achieve it, the SPT rule and the 0-1 programming model were adopted, time spend of preflight, printing process and post-press finishing was also taken into account.Moreover, Enfocus Switch software was applied to establish automated network printing workflow and complete the file stream sorting. Finally, the result of simulation analysis of the optimized strategy shows that the optimized three-stage strategy can effectively shorten the file processing time.展开更多
文摘In this paper a hybrid parallel multi-objective genetic algorithm is proposed for solving 0/1 knapsack problem. Multi-objective problems with non-convex and discrete Pareto front can take enormous computation time to converge to the true Pareto front. Hence, the classical multi-objective genetic algorithms (MOGAs) (i.e., non- Parallel MOGAs) may fail to solve such intractable problem in a reasonable amount of time. The proposed hybrid model will combine the best attribute of island and Jakobovic master slave models. We conduct an extensive experimental study in a multi-core system by varying the different size of processors and the result is compared with basic parallel model i.e., master-slave model which is used to parallelize NSGA-II. The experimental results confirm that the hybrid model is showing a clear edge over master-slave model in terms of processing time and approximation to the true Pareto front.
文摘In order to optimize the knapsack problem further, this paper proposes an innovative model based on dynamic expectation efficiency, and establishes a new optimization algorithm of 0-1 knapsack problem after analysis and research. Through analyzing the study of 30 groups of 0-1 knapsack problem from discrete coefficient of the data, we can find that dynamic expectation model can solve the following two types of knapsack problem. Compared to artificial glowworm swam algorithm, the convergence speed of this algorithm is ten times as fast as that of artificial glowworm swam algorithm, and the storage space of this algorithm is one quarter that of artificial glowworm swam algorithm. To sum up, it can be widely used in practical problems.
基金The National Natural Science Foundationof China (70473037)
文摘A 0-1 integer programming model for weekly fleet assignment was put forward based on linear network and weekly flight scheduling in China. In this model, the objective function is to maximize the total profit of fleet assignment, subject to the constraints of coverage, aircraft flow balance, fleet size, aircraft availability, aircraft usage, flight restriction, aircraft seat capacity, and stopover. Then the branch-and-bound algorithm based on special ordered set was applied to solve the model. At last, a real- wofld case study on an airline with 5 fleets, 48 aircrafts and 1 786 flight legs indicated that the profit increase was ￥ 1 591276 one week and the running time was no more than 4 rain, which shows that the model and algorithm are fairly good for domestic airline.
文摘In this paper, we construct two models for the searching task for a lost plane. Model 1 determines the searching area. We predict the trajectory of floats generated after the disintegration of the plane by using RBF neural network model, and then determine the searching area according to the trajectory. With the pass of time, the searching area will also be constantly moving along the trajectory. Model 2 develops a maritime search plan to achieve the purpose of completing the search in the shortest time. We optimize the searching time and transform the problem into the 0-1 knapsack problem. Solving this problem by improved genetic algorithm, we can get the shortest searching time and the best choice for the search power.
基金National Basic Research Program(973)of China(No.2010CB951102)Innovative Research Groups of the National Natural Science Foundation,China(No.51021006)National Natural Science Foundation of China(No.51079028)
文摘Increasing complexity of distributed hydrological model （DHM） has lowered the efficiency of convergence.In this study,global sensitivity analysis （SA） was introduced by combining multiobjective （MO） optimization for DHM calibration.Latin Hypercube-once at a time （LH-OAT） was adopted in global parameter SA to obtain relative sensitivity of model parameter,which can be categorized into different sensitivity levels.Two comparative study cases were conducted to present the efficiency and feasibility by combining SA with MO（SA-MO）.WetSpa model with non-dominated sorting genetic algorithm-Ⅱ （NSGA-Ⅱ） algorithm and EasyDHM model with multi-objective sequential complex evolutionary metropolis-uncertainty analysis （MOSCEM-UA）algorithm were adopted to demonstrate the general feasibility of combining SA in optimization.Results showed that the LH-OAT was globally effective in selecting high sensitivity parameters.It proves that using parameter from high sensitivity groups results in higher convergence efficiency.Study case Ⅰ showed a better Pareto front distribution and convergence compared with model calibration without SA.Study case Ⅱ indicated a more efficient convergence of parameters in sequential evolution of MOSCEM-UA under the same iteration.It indicates that SA-MO is feasible and efficient for high dimensional DHM calibration.
基金Supported by Science and Technology Industry Trade and Information Bureau of Zhuhai City(2011B050102013and 2012D050199033)by Education Bureau of Zhuhai City(Premier-Discipline Enhancement Scheme of Packaging Engineering and Premier-Key Laboratory of Products Packaging and Logistics)
文摘This paper proposed the optimized three-stage strategy of orderly management of file stream in network printing workflow. In first stage the customer preflight was added to the conventional prepress preflight, which set quick-type, general-type, stable-type and comprehensive-type preflight scheme for customers by investigating the possibility of occurrence of errors of various preflight entries and customer relevancy. Based on four types of preflight schemes, four customer preflight applications were created by using Pitstop Pro and Connector You. Customers can select one of the appropriate applications for quick preflight before delivering to reduce the probability of returning the files back for correction when errors occur in preflight. Second stage is printing enterprise prepress preflight,which proposed the concept of the prepress preflight tolerance. In addition, according to the different requirements of printing technology and quality, this paper established the prepress preflight scheme based on the printing enterprises’ tolerance for preflight error. Third stage is to manage the optimized sorting of prepress file stream. To achieve it, the SPT rule and the 0-1 programming model were adopted, time spend of preflight, printing process and post-press finishing was also taken into account.Moreover, Enfocus Switch software was applied to establish automated network printing workflow and complete the file stream sorting. Finally, the result of simulation analysis of the optimized strategy shows that the optimized three-stage strategy can effectively shorten the file processing time.
