A robust optimal design method of energy supply systems under uncertain energy demands has been proposed using a mixed-integer linear model for constituent equipment. However, this method takes a long computation time, and thus it can be applied only to small-scale problems. In this paper, a hierarchical optimization method is applied to two types of optimization problems for evaluating robustness to solve them efficiently. In a case study, the proposed method is applied to a cogeneration system with a complex configuration, and the validity and effectiveness of the method are ascertained.
A robust optimal design method of energy supply systems under uncertain energy demands has been proposed using a mixed- integer linear model for constituent equipment. A robust optimal design problem has been formulated as a three-level min-max- min optimization one by expressing uncertain energy demands by intervals, evaluating the robustness in a performance criterion based on the minimax regret criterion, and considering hierarchical relationships among design variables, uncertain energy demands, and operation variables. Since this problem must be solved by a special algorithm and is too difficult to solve even using a commercial solver, a hierarchical optimization approach has been applied to solve the problem but its application is limited only to small scale toy problems. In this paper, some strategies are introduced into the hierarchical optimization approach to enhance the computation efficiency for the purpose of applying the approach to large scale practical problems. In a case study, the proposed approach is applied to the robust optimal design of a cogeneration system with a complex configuration, and the validity and effectiveness of the method are ascertained.
Ahierarchical mixed-integer linear programmingmethod has been proposed to solve optimal design problems of energy supply systems efficiently. In this paper, a method of reducing model by clustering periods is proposed to search design solution candidates efficiently in the relaxed optimal design problem at the upper level. This method is realized only by clustering periods and averaging energy demands for clustered periods, while it guarantees to derive the optimal solution.
Through acase study on the optimaldesign of a cogeneration system, ti is clarified how the model reduction si effective ot enhance the computation efficiency.
A robust optimal design method of energy supply systems under uncertain energy demands has been proposed using a mixed- integer linear model for constituent equipment. A robust optimal design problem has been formulated as a three-level min-max- min optimization one by expressing uncertain energy demands by intervals, evaluating the robustness in a performance criterion based on the minimax regret criterion, and considering hierarchical relationships among design variables, uncertain energy demands, and operation variables. However, this method takes a long computation time, and thus it can be applied only to small-scale problems. In this paper, mixed-integer linear programming method in consideration of the hierarchical relationship between design and operation variables is applied to parts of the robust optimal design method which take long computation times to solve problems efficiently. In a case study, this revised method is applied to the robust optimal design of a cogeneration system with a simple configuration, and the validity and effectiveness of the method are ascertained.
For the purpose of attaining the highest performance of energy supply systems, it is important to design the systems optimally in consideration of their operational strategies for seasonal and hourly variations in energy demands. An ap- proach to efficiently solve such an optimal design problem with a large number of periods for variations in energy de- mands is to derive an approximate optimal design solution by aggregating periods with a clustering method. However, such an approach does not provide any information on the accuracy for the optimal value of the objective function. The purpose of this paper is to propose a time aggregation approach for deriving suitable aprroximate optimal design solutions and evaluting their values of the objective function accurately. This time aggregation approach is realized by combining a robust optimal design method under uncertain energy demands and a hierarchical approach for solving large scale optimal design problems. A case study is conducted for a cogeneration system with a practical configuration, and it turns out that the proposed approach enables one to evaluate effective upper and lower bounds for the optimal value of the objective function as compared with those obtained by a conventional approach.
For the purpose of attaining the highest performance of energy supply systems, it is important to design the systems optimally in consideration of their operational strategies for seasonal and hourly variations in energy demands. An ap- proach to solve such an optimal design problem with a large number of periods efficiently is to derive an approximate optimal design solution by aggregating periods with a clustering method. However, such an approach does not provide any information on the accuracy for the optimal value of the objective function. The purpose of this paper is to provide a time aggregation method for deriving aprroximate optimal design solutions and evaluting their values of the objective function. Especially, a method of evaluating design solutions is presented here using both methods of evaluating the robustness under uncertain energy demands and solving optimal design problems by a hierarchical approach. A case study is conducted for a cogeneration system with a practical configuration, and it turns out that the proposed approach enables one to evaluate effective lower bounds for the optimal value of the objective function as compared with those obtained by a conventional approach.
A mixed-integer linear programming methodutilizing the hierarchical relationship between design and operation variables proposed ot solve the optimal design problem of energy supply systems efficiently is extended ot search K-best solutions: At the upper level, the optimal values ofdesign variables are searched with operation variables relaxed to continuous ones; At the lower level, the values of operation variables are optimized with the values of design variables given tentatively; The obtained solution is used to renew K-best incumbent solutions, and the upper bound for the value of the objective function for K-best solutions is replaced correspondingly. A practical case study is conducted, and the validity and effectiveness of the proposed method are clarified.
A hierarchical mixed-integer linear programming method to solve optimal design problems of energy supply systems efficiently has been proposed. The original problem is solved by dividing it into a relaxed optimal design problem at the upper level and optimal operation problems which are independent of each other at the lower level. In this paper, a method of reducing model by time aggregation is proposed to search design solution candidates efficiently in the relaxed optimal design problem at the upper level. This method is realized only by clustering periods and averaging energy demands for clustered periods, while it guarantees to derive the optimal solution. On one hand, the method may decrease the number of design variables and costraints at the upper level, and thus the computation time at the upper level. On the other hand, it may increase the numbers of generated design solution candidates and solved optimal operation problems, and thus the computation time at both the levels. Though a case study on the optimal design of a cogeneration system, it is clarified how the model reduction is effective to enhance the computation efficiency.
A mixed-integer linear programming (MILP) method utilizing the hierarchical relationship between design and op- eration variables is proposed to solve the optimal design problem of energy supply systems efficiently: At the upper level, the optimal values of design variables are searched by the branch and bound method; At the lower level, the values of operation variables are optimized by the branch and bound method under the values of design variables given tentatively during the search at the upper level; Lower bounds for the optimal value of the objective function are evaluated, and are utilized for the bounding operations at both the levels. This method is implemented into open and commercial MILP solvers. Illustrative and practical case studies on the optimal design of cogeneration systems are conducted, and the validity and effectiveness of the proposed method are clarified.
A mixed-integer linear programming method utilizing the hierarchical relationship between design and operation variables proposed to solve the optimal design problem of energy supply systems efficiently is extended to search K-best solutions in multiobjective optimization: At the upper level, the optimal values of design variables are searched by the branch and bound method with operation variables relaxed to continuous ones; At the lower level, the values of operation variables are optimized independently at the respective periods set for variations in energy demands by the branch and bound method with the values of design variables given tentatively during the search at the upper level. A weighting method is employed for multiobjective optimization, and a weighted sum of the annual total cost and primary energy consumption is adopted as the objective function to be minimized. A practical case study on the optimal design of a cogeneration system is conducted. The validity and effectiveness of the proposed method are clarified, and the trade-off relationship between the annual total cost and primary energy consumption is confirmed.
To attain the highest performance of energy supply systems, it is necessary to determine design specifications optimally in consideration of operational strategies corresponding to seasonal and hourly variations in energy demands. A hierarchical mixed-integer linear programming method has been proposed to solve such an optimal design problem efficiently. In this paper, a method of reducing model by clustering periods with the k-medoids method is applied to the relaxed optimal design problem at the upper level. Through a case study, it is clarified how the proposed method is effective to enhance the computation efficiency in a large scale optimal design problem.
Mixed-integer linear programming (MILP) methods have been applied widely to optimal design of energy supply systems. A hierarchical MILP method has been proposed to solve such optimal design problems efficiently. In addition, some strategies have been proposed to enhance the computation efficiency furthermore. As one of the strategies, a method of reducing model by time aggregation has been proposed to search design candidates efficiently in the relaxed optimal design problem at the upper level. In this paper, three clustering methods are applied to time aggregation and compared with one another in terms of the computation efficiency. Especially, the k-medoids method is applied newly in addition to the time-series and operation-based methods applied previously. A case study is conducted on the optimal design of a gas turbine cogeneration system for district energy supply. Through the study, it turns out the k-medoids method is effective to shorten the computation time as compared with the time-series method, although it is necessary to set the number of clusters artifically in both the methods. It also turns out that the operation-based method is more effective than the k-medoids method in terms of the computation efficiency even with the number of clusters set automatically.
Mixed-integer linear programming (MILP) methods have been applied widely to optimal design of energy supply systems. A hierarchical MILP method has been proposed to solve such optimal design problems efficiently. In addition, some strategies have been proposed to enhance the computation efficiency furthermore. As one of the strategies, a method of reducing model by time aggregation has been proposed to search design candidates efficiently in the relaxed optimal design problem at the upper level. In this paper, the hierarchical MILP method with the strategies has been extendedly applied to the optimal design of energy supply systems with storage units. Especially, the method of re- ducing model is extended by aggregating representative days and sampling times differently in consideration of the characteristics of storage units. A case study is conducted on the optimal design of a gas turbine cogeneration system with a thermal storage unit for district energy supply. Through the study, it turns out the hierarchical MILP method is effective to derive the optimal solution as compared with a conventional method. It also turns out that the model reduction with the special time aggregation is effective to shorten the computation time as compared with that without time aggregation in case that the number of candidates for equipment capacities is relatively small.
To attain the highest performance of energy supply systems, it is necessary to determine design specifications optimally in consideration of operational strategies corresponding to seasonal and hourly variations in energy demands. Mixed-integer linear programming (MILP) methods have been applied widely to such optimal design problems. A hierarchical MILP method has been proposed to solve the problems very efficiently. In addition, by utilizing features of the hierarchical MILP method, a method of reducing model by clustering periods based on the optimal operational strategies of equipment has been proposed to search design solution candidates efficiently in the relaxed optimal design problem at the upper level. In this paper, these methods are applied to the multiobjective optimal design of a cogeneration system by considering the annual total cost and primary energy consumption as the objective functions to be minimized. Through a case study, it turns out that the model reduction by the operation-based time-period clustering is effective in terms of the computation efficiency when importance is given to the first objective function, while it is not when importance is given to the second objective function.
To attain the highest performance of energy supply systems, it is necessary to determine design specifications optimally in consideration of operational strategies corresponding to seasonal and hourly variations in energy demands. Mixed-integer linear programming (MILP) methods have been applied widely to such multi-period optimal design problems. A hierarchical MILP method has been proposed to solve the problems very efficiently. In addition, by utilizing features of the hierarchical MILP method, a method of reducing model by clustering periods has also been proposed to search design solution candidates efficiently in the relaxed optimal design problem at the upper level. In this paper, by utilizing features of the hierarchical MILP method, a method of clustering periods is proposed based on the optimal operational strategies of energy supply systems obtained by solving the relaxed optimal design problem. As a case study, the method is applied to the optimal design of a gas turbine cogeneration system, and it is clarified that the method is effective to enhance the computation efficiency in comparison with a conventional method of clustering periods regularly.
For the purpose of making a decision in the optimal design of an energy supply system, it is important to investigate not only the optimal solution but also suboptimal ones which follow the optimal one without any omissions, what are called K-best solutions. In this paper, a mixed-integer linear programming method utilizing the hierarchical relationship between design and operation variables proposed previ- ously is extended to search the K-best solutions very efficiently. In addition, methods for updating the incumbents are incorporated into the extended method for three options for the criterion set newly in deriving the K-best solutions. This extended method is implemented into open and commercial MILP solvers, and is applied to illustrative and practical case studies, respectively, on the optimal design of cogeneration systems. Through the studies, it turns out that the proposed method is much superior in terms of solution optimality and computation efficiency to a conventional method, and that the computation efficiency to derive one of the K-best solutions by the proposed method increases with the number of K-best solutions. In addition, features of the K-best solutions in the value of objective function are clarified.
To attain the highest performance of energy supply systems, it is necessary to
rationally determine types, capacities, and numbers of equipment in consideration of
their operational strategies corresponding to seasonal and hourly variations in energy
demands. In the combinatorial optimization method based on the mixed-integer linear
programming (MILP), integer variables are used to express the selection, numbers, and
on/off status of operation of equipment, and the number of these variables increases
with those of equipment and periods for variations in energy demands, and affects the computation efficiency significantly. In this paper, a MILP method utilizing the
hierarchical relationship between design and operation variables is proposed to solve the optimal design problem of energy supply systems efficiently: At the upper level, the
optimal values of design variables are searched by the branch and bound method; At
the lower level, the values of operation variables are optimized independently at each period by the branch and bound method under the values of design variables given
tentatively during the search at the upper level; Lower bounds for the optimal value of the objective function are evaluated, and are utilized for the bounding operations at both the levels. This method is implemented into open and commercial MILP solvers. Illustrative and practical case studies on the optimal design of cogeneration systems are conducted, and the validity and effectiveness of the proposed method are clarified.
To attain the highest performance of energy supply systems, it is necessary to rationally determine types, capacities, and numbers of equipment in consideration of their operational strategies corresponding to seasonal and hourly variations in energy demands. In the combinatorial optimization method based on the mixed-integer linear programming (MILP), integer variables are used to express the selection, numbers, and on/off status of operation of equipment, and the number of these variables increases with those of equipment and periods for variations in energy demands, and affects the computation efficiency significantly. In this paper, a MILP method utilizing the hierarchical relationship between design and operation variables is proposed to solve the optimal design problem of energy supply systems efficiently: At the upper level, the optimal values of design variables are searched by the branch and bound method; At the lower level, the values of operation variables are optimized independently at each period by the branch and bound method under the values of design variables given tentatively during the search at the upper level; Lower bounds for the optimal value of the objective function to be minimized are evaluated, and are utilized for the bounding operations at both the levels. This method is implemented into open and commercial MILP solvers. Illustrative and practical case studies on the optimal design of cogeneration systems are conducted, and the validity and effectiveness of the proposed method are clarified.
To attain the highest performance of energy supply systems, it is necessary to rationally determine types, capacities, and numbers of equipment in consideration of their operational strategies corresponding to seasonal and hourly variations in energy demands. Mixed-integer linear programming (MILP) approaches have been applied widely to such optimal design problems. The authors have proposed a MILP method utilizing the hierarchical relationship between design and operation variables to solve the optimal design problems of energy supply systems efficiently. In addition, some strategies to enhance the computation efficiency have been adopted: bounding procedures at both the levels and ordering of the optimal operation problems at the lower level. In this paper, as an additional strategy to enhance the computation efficiency, parallel computing is adopted to solve multiple optimal operation problems in parallel at the lower level. In addition, the effectiveness of each and combinations of the strategies adopted previously and newly is investigated. This hierarchical optimization method is applied to an optimal design of a gas turbine cogeneration plant, and its validity and effectiveness are clarified through some case studies.
Mixed-integer linear programming (MILP) methods have been applied widely to optimal design of energy supply systems. A hierarchical MILP method has been proposed to solve such optimal design problems efficiently. In addition, some strategies have been proposed to enhance the computation efficiency furthermore. As one of the strategies, a method of reducing model by time aggregation has been proposed to search design candidates efficiently in the relaxed optimal design problem at the upper level. In this paper, a method of clustering periods has been proposed based on the optimal operational strategies of the systems to avoid a large decrease in the lower bound for the optimal value of the objective function by model reduction. This method has been realized only by solving the relaxed optimal design problem at the upper level in advance. The method can decrease the number of operation variables and constraints at the upper level, and thus can decrease the computation time at the upper level. Through a case study on the optimal design of a gas turbine cogeneration system, it is clarified how the proposed clustering method is effective to enhance the computation efficiency in comparison with the conventional one which clusters periods regularly in time series.