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.展开更多
The authoros specialize in the field of optunization and automatic programme oftrain working graph. In this peper, at frist, a mixed 0-1 integer progranimingmodel about this problem for duuble-track lines is set up, t...The authoros specialize in the field of optunization and automatic programme oftrain working graph. In this peper, at frist, a mixed 0-1 integer progranimingmodel about this problem for duuble-track lines is set up, then the principle andProcess of selution are stated, with an application exaiiiple put forward.展开更多
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.展开更多
In this paper, the problem of program performance scheduling with accepting strategy is studied. Considering the uncertainty of actual situation, the duration of a program is expressed as a bounded interval. Firstly, ...In this paper, the problem of program performance scheduling with accepting strategy is studied. Considering the uncertainty of actual situation, the duration of a program is expressed as a bounded interval. Firstly, we decide which programs are accepted. Secondly, the risk preference coefficient of the decision maker is introduced. Thirdly, the min-max robust optimization model of the uncertain program show scheduling is built to minimize the performance cost and determine the sequence of these programs. Based on the above model, an effective algorithm for the original problem is proposed. The computational experiment shows that the performance’s cost (revenue) will increase (decrease) with decision maker’s risk aversion.展开更多
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 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.
文摘The authoros specialize in the field of optunization and automatic programme oftrain working graph. In this peper, at frist, a mixed 0-1 integer progranimingmodel about this problem for duuble-track lines is set up, then the principle andProcess of selution are stated, with an application exaiiiple put forward.
文摘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.
文摘In this paper, the problem of program performance scheduling with accepting strategy is studied. Considering the uncertainty of actual situation, the duration of a program is expressed as a bounded interval. Firstly, we decide which programs are accepted. Secondly, the risk preference coefficient of the decision maker is introduced. Thirdly, the min-max robust optimization model of the uncertain program show scheduling is built to minimize the performance cost and determine the sequence of these programs. Based on the above model, an effective algorithm for the original problem is proposed. The computational experiment shows that the performance’s cost (revenue) will increase (decrease) with decision maker’s risk aversion.
基金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.
