A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems....A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems.The performances of CLSPSO are compared with those of other five hybrid algorithms combining PSO with chaotic search methods.Experimental results indicate that in terms of robustness and final convergence speed,CLSPSO is better than other five algorithms in solving many of these problems.Furthermore,CLSPSO exhibits good performance in solving two high-dimensional problems,and it finds better solutions than the known ones.A performance index(PI) is introduced to fairly compare the above six algorithms,and the obtained values of(PI) in three cases demonstrate that CLSPSO is superior to all the other five algorithms under the same conditions.展开更多
Steady-state non-dominated sorting genetic algorithm (SNSGA), a new form of multi-objective genetic algorithm, is implemented by combining the steady-state idea in steady-state genetic algorithms (SSGA) and the fitnes...Steady-state non-dominated sorting genetic algorithm (SNSGA), a new form of multi-objective genetic algorithm, is implemented by combining the steady-state idea in steady-state genetic algorithms (SSGA) and the fitness assignment strategy of non-dominated sorting genetic algorithm (NSGA). The fitness assignment strategy is improved and a new self-adjustment scheme of is proposed. This algorithm is proved to be very efficient both computationally and in terms of the quality of the Pareto fronts produced with five test problems including GA difficult problem and GA deceptive one. Finally, SNSGA is introduced to solve multi-objective mixed integer linear programming (MILP) and mixed integer non-linear programming (MINLP) problems in process synthesis.展开更多
Cracking furnace is the core device for ethylene production. In practice, multiple ethylene furnaces are usually run in parallel. The scheduling of the entire cracking furnace system has great significance when multip...Cracking furnace is the core device for ethylene production. In practice, multiple ethylene furnaces are usually run in parallel. The scheduling of the entire cracking furnace system has great significance when multiple feeds are simultaneously processed in multiple cracking furnaces with the changing of operating cost and yield of product. In this paper, given the requirements of both profit and energy saving in actual production process, a multi-objective optimization model contains two objectives, maximizing the average benefits and minimizing the average coking amount was proposed. The model can be abstracted as a multi-objective mixed integer non- linear programming problem. Considering the mixed integer decision variables of this multi-objective problem, an improved hybrid encoding non-dominated sorting genetic algorithm with mixed discrete variables (MDNSGA-II) is used to solve the Pareto optimal front of this model, the algorithm adopted crossover and muta- tion strategy with multi-operators, which overcomes the deficiency that normal genetic algorithm cannot handle the optimization problem with mixed variables. Finally, using an ethylene plant with multiple cracking furnaces as an example to illustrate the effectiveness of the scheduling results by comparing the optimization results of multi-objective and single objective model.展开更多
Decision-making of investors at the stock exchange can be based on the fundamental indicators of stocks, on the technical indicators, or can exist as a combination of these two methods. The paper gives emphasis to the...Decision-making of investors at the stock exchange can be based on the fundamental indicators of stocks, on the technical indicators, or can exist as a combination of these two methods. The paper gives emphasis to the domain of technical analysis. In the broader sense the technical analysis enables the dynamics of the expected future values of the shares estimation. This can be performed on the basis of the data on historical trends of the revenues, profits and other indicators from the balance sheet, but also on the basis of historical data on changes in the values of the shares. Companies generally belong to the different sectors that have different presumptions of development resulting from the global market trends, technology and other characteristic. Processing of historical data values of the outstanding shares of the Zagreb Stock Exchange (ZSE) is origination of this research. Investors are interested to know the estimation of future returns for the stocks as well as the size of the risk associated with the expected returns. Research task in this paper is finding the optimal portfolio at the ZSE based on the concept of dominant portfolio by Markowitz approach. The portfolio is created by solving non-linear programming problem using the common software tools. The results of obtained optimal portfolios contain relevant conclusions about the specifics of the shares as well as the characteristics of the industrial sectors but also provide a further knowledge about diverse sectors treatment at the stock exchange in a multi-year period.展开更多
The article presents the legal and economic issues connected with the formation and operation of Polish agricultural cooperatives. Additionally, it shows a brief history of cooperative development on Polish lands and ...The article presents the legal and economic issues connected with the formation and operation of Polish agricultural cooperatives. Additionally, it shows a brief history of cooperative development on Polish lands and statistical data on agriculture and cooperatives. Most attention is given to dairy cooperatives, cooperative groups of agricultural producers and agricultural production cooperatives. These types of cooperatives are the most popular in Polish agriculture. The fundamental law regulating the issue of cooperatives in Poland is the Cooperative Law Act of September 16, 1982. Other laws, however, also have a big influence on the business activity of agricultural cooperatives, especially the EU legal regulations. Poland membership in the European Union has created new possibilities of development for the cooperative movement.展开更多
With diversified requirements and varying manufacturing environments, the optimal production planning for a steel mill becomes more flexible and complicated. The flexibility provides operators with auxiliary requireme...With diversified requirements and varying manufacturing environments, the optimal production planning for a steel mill becomes more flexible and complicated. The flexibility provides operators with auxiliary requirements through an implementable integrated production planning. In this paper, a mixed-integer nonlinear programming(MINLP) model is proposed for the optimal planning that incorporates various manufacturing constraints and flexibility in a steel plate mill. Furthermore, two solution strategies are developed to overcome the weakness in solving the MINLP problem directly. The first one is to transform the original MINLP formulation to an approximate mixed integer linear programming using a classic linearization method. The second one is to decompose the original model using a branch-and-bound based iterative method. Computational experiments on various instances are presented in terms of the effectiveness and applicability. The result shows that the second method performs better in computational efforts and solution accuracy.展开更多
This paper proposes a solution for the problem of cooperative salvo attack of multiple cruise missiles against targets in a group. Synchronization of the arrival time of missiles to hit their common target, minimizing...This paper proposes a solution for the problem of cooperative salvo attack of multiple cruise missiles against targets in a group. Synchronization of the arrival time of missiles to hit their common target, minimizing the time consumption of attack and maximizing the expected damage to group targets are taken into consideration simultaneously. These operational objectives result in a hierarchical mixed-variable optimization problem which includes two types of subproblems, namely the multi-objective missile-target assignment(MOMTA) problem at the upper level and the time-optimal coordinated path planning(TOCPP) problems at the lower level. In order to solve the challenging problem, a recently proposed coordinated path planning method is employed to solve the TOCPP problems to achieve the soonest salvo attack against each target. With the aim of finding a more competent solver for MOMTA, three state-of-the-art multi-objective optimization methods(MOMs),namely NSGA-II, MOEA/D and DMOEA-εC, are adopted. Finally, a typical example is used to demonstrate the advantage of the proposed method. A simple rule-based method is also employed for comparison. Comparative results show that DMOEA-εC is the best choice among the three MOMs for solving the MOMTA problem. The combination of DMOEA-εC for MOMTA and the coordinated path planning method for TOCPP can generate obviously better salvo attack schemes than the rule-based method.展开更多
By handling the travel cost function artfully, the authors formulate the transportation mixed network design problem (MNDP) as a mixed-integer, nonlinear bilevel programming problem, in which the lower-level problem...By handling the travel cost function artfully, the authors formulate the transportation mixed network design problem (MNDP) as a mixed-integer, nonlinear bilevel programming problem, in which the lower-level problem, comparing with that of conventional bilevel DNDP models, is not a side constrained user equilibrium assignment problem, but a standard user equilibrium assignment problem. Then, the bilevel programming model for MNDP is reformulated as a continuous version of bilevel programming problem by the continuation method. By virtue of the optimal-value function, the lower-level assignment problem can be expressed as a nonlinear equality constraint. Therefore, the bilevel programming model for MNDP can be transformed into an equivalent single-level optimization problem. By exploring the inherent nature of the MNDP, the optimal-value function for the lower- level equilibrium assignment problem is proved to be continuously differentiable and its functional value and gradient can be obtained efficiently. Thus, a continuously differentiable but still nonconvex optimization formulation of the MNDP is created, and then a locally convergent algorithm is proposed by applying penalty function method. The inner loop of solving the subproblem is mainly to implement an Ml-or-nothing assignment. Finally, a small-scale transportation network and a large-scale network are presented to verify the proposed model and algorithm.展开更多
基金Projects(50275150,61173052) supported by the National Natural Science Foundation of ChinaProject(14FJ3112) supported by the Planned Science and Technology of Hunan Province,ChinaProject(14B033) supported by Scientific Research Fund Education Department of Hunan Province,China
文摘A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems.The performances of CLSPSO are compared with those of other five hybrid algorithms combining PSO with chaotic search methods.Experimental results indicate that in terms of robustness and final convergence speed,CLSPSO is better than other five algorithms in solving many of these problems.Furthermore,CLSPSO exhibits good performance in solving two high-dimensional problems,and it finds better solutions than the known ones.A performance index(PI) is introduced to fairly compare the above six algorithms,and the obtained values of(PI) in three cases demonstrate that CLSPSO is superior to all the other five algorithms under the same conditions.
文摘Steady-state non-dominated sorting genetic algorithm (SNSGA), a new form of multi-objective genetic algorithm, is implemented by combining the steady-state idea in steady-state genetic algorithms (SSGA) and the fitness assignment strategy of non-dominated sorting genetic algorithm (NSGA). The fitness assignment strategy is improved and a new self-adjustment scheme of is proposed. This algorithm is proved to be very efficient both computationally and in terms of the quality of the Pareto fronts produced with five test problems including GA difficult problem and GA deceptive one. Finally, SNSGA is introduced to solve multi-objective mixed integer linear programming (MILP) and mixed integer non-linear programming (MINLP) problems in process synthesis.
基金Supported by the National Natural Science Foundation of China(21276078)"Shu Guang"project of Shanghai Municipal Education Commission,973 Program of China(2012CB720500)the Shanghai Science and Technology Program(13QH1401200)
文摘Cracking furnace is the core device for ethylene production. In practice, multiple ethylene furnaces are usually run in parallel. The scheduling of the entire cracking furnace system has great significance when multiple feeds are simultaneously processed in multiple cracking furnaces with the changing of operating cost and yield of product. In this paper, given the requirements of both profit and energy saving in actual production process, a multi-objective optimization model contains two objectives, maximizing the average benefits and minimizing the average coking amount was proposed. The model can be abstracted as a multi-objective mixed integer non- linear programming problem. Considering the mixed integer decision variables of this multi-objective problem, an improved hybrid encoding non-dominated sorting genetic algorithm with mixed discrete variables (MDNSGA-II) is used to solve the Pareto optimal front of this model, the algorithm adopted crossover and muta- tion strategy with multi-operators, which overcomes the deficiency that normal genetic algorithm cannot handle the optimization problem with mixed variables. Finally, using an ethylene plant with multiple cracking furnaces as an example to illustrate the effectiveness of the scheduling results by comparing the optimization results of multi-objective and single objective model.
文摘Decision-making of investors at the stock exchange can be based on the fundamental indicators of stocks, on the technical indicators, or can exist as a combination of these two methods. The paper gives emphasis to the domain of technical analysis. In the broader sense the technical analysis enables the dynamics of the expected future values of the shares estimation. This can be performed on the basis of the data on historical trends of the revenues, profits and other indicators from the balance sheet, but also on the basis of historical data on changes in the values of the shares. Companies generally belong to the different sectors that have different presumptions of development resulting from the global market trends, technology and other characteristic. Processing of historical data values of the outstanding shares of the Zagreb Stock Exchange (ZSE) is origination of this research. Investors are interested to know the estimation of future returns for the stocks as well as the size of the risk associated with the expected returns. Research task in this paper is finding the optimal portfolio at the ZSE based on the concept of dominant portfolio by Markowitz approach. The portfolio is created by solving non-linear programming problem using the common software tools. The results of obtained optimal portfolios contain relevant conclusions about the specifics of the shares as well as the characteristics of the industrial sectors but also provide a further knowledge about diverse sectors treatment at the stock exchange in a multi-year period.
文摘The article presents the legal and economic issues connected with the formation and operation of Polish agricultural cooperatives. Additionally, it shows a brief history of cooperative development on Polish lands and statistical data on agriculture and cooperatives. Most attention is given to dairy cooperatives, cooperative groups of agricultural producers and agricultural production cooperatives. These types of cooperatives are the most popular in Polish agriculture. The fundamental law regulating the issue of cooperatives in Poland is the Cooperative Law Act of September 16, 1982. Other laws, however, also have a big influence on the business activity of agricultural cooperatives, especially the EU legal regulations. Poland membership in the European Union has created new possibilities of development for the cooperative movement.
基金Supported in part by the National High Technology Research and Development Program of China(2012AA041701)the National Natural Science Foundation of China(61320106009) the 111 Project of China(B07031)
文摘With diversified requirements and varying manufacturing environments, the optimal production planning for a steel mill becomes more flexible and complicated. The flexibility provides operators with auxiliary requirements through an implementable integrated production planning. In this paper, a mixed-integer nonlinear programming(MINLP) model is proposed for the optimal planning that incorporates various manufacturing constraints and flexibility in a steel plate mill. Furthermore, two solution strategies are developed to overcome the weakness in solving the MINLP problem directly. The first one is to transform the original MINLP formulation to an approximate mixed integer linear programming using a classic linearization method. The second one is to decompose the original model using a branch-and-bound based iterative method. Computational experiments on various instances are presented in terms of the effectiveness and applicability. The result shows that the second method performs better in computational efforts and solution accuracy.
基金supported by the National Natural Science Foundation of China under Grant No.61673058the NSFC-Zhejiang Joint Fund for the Integration of Industrialization and Informatization under Grant No.U1609214
文摘This paper proposes a solution for the problem of cooperative salvo attack of multiple cruise missiles against targets in a group. Synchronization of the arrival time of missiles to hit their common target, minimizing the time consumption of attack and maximizing the expected damage to group targets are taken into consideration simultaneously. These operational objectives result in a hierarchical mixed-variable optimization problem which includes two types of subproblems, namely the multi-objective missile-target assignment(MOMTA) problem at the upper level and the time-optimal coordinated path planning(TOCPP) problems at the lower level. In order to solve the challenging problem, a recently proposed coordinated path planning method is employed to solve the TOCPP problems to achieve the soonest salvo attack against each target. With the aim of finding a more competent solver for MOMTA, three state-of-the-art multi-objective optimization methods(MOMs),namely NSGA-II, MOEA/D and DMOEA-εC, are adopted. Finally, a typical example is used to demonstrate the advantage of the proposed method. A simple rule-based method is also employed for comparison. Comparative results show that DMOEA-εC is the best choice among the three MOMs for solving the MOMTA problem. The combination of DMOEA-εC for MOMTA and the coordinated path planning method for TOCPP can generate obviously better salvo attack schemes than the rule-based method.
基金supported by the National Basic Research Program of China under Grant No. 2006CB705500the National Natural Science Foundation of China under Grant No. 0631001+1 种基金the Program for Changjiang Scholars and Innovative Research Team in University Volvo Research and Educational Foundations
文摘By handling the travel cost function artfully, the authors formulate the transportation mixed network design problem (MNDP) as a mixed-integer, nonlinear bilevel programming problem, in which the lower-level problem, comparing with that of conventional bilevel DNDP models, is not a side constrained user equilibrium assignment problem, but a standard user equilibrium assignment problem. Then, the bilevel programming model for MNDP is reformulated as a continuous version of bilevel programming problem by the continuation method. By virtue of the optimal-value function, the lower-level assignment problem can be expressed as a nonlinear equality constraint. Therefore, the bilevel programming model for MNDP can be transformed into an equivalent single-level optimization problem. By exploring the inherent nature of the MNDP, the optimal-value function for the lower- level equilibrium assignment problem is proved to be continuously differentiable and its functional value and gradient can be obtained efficiently. Thus, a continuously differentiable but still nonconvex optimization formulation of the MNDP is created, and then a locally convergent algorithm is proposed by applying penalty function method. The inner loop of solving the subproblem is mainly to implement an Ml-or-nothing assignment. Finally, a small-scale transportation network and a large-scale network are presented to verify the proposed model and algorithm.