Pitchmatching algorithms are widely used in layout environments where no grid constraints are imposed. However, realistic layouts include multiple grid constraints which facilitate the applications of automatic routin...
详细信息
Pitchmatching algorithms are widely used in layout environments where no grid constraints are imposed. However, realistic layouts include multiple grid constraints which facilitate the applications of automatic routing. Hence, pitchmatching algorithms should be extended to those realistic layouts. This paper formulates a pitchmatching problem with multiple grid constraints. An algorithm for solving this problem is constructed as an extension of conventional pitchmatching algorithms. The computational complexity is also discussed in comparison with a conventional naive algorithm. Finally, examples and application results to realistic layouts are presented.
An optimal planning problem of a co-generation plant is studied which is constructed by combining gas turbine generators, waste heat boilers, auxiliary boilers, etc. The planning problem proposed is to determine the o...
详细信息
An optimal planning problem of a co-generation plant is studied which is constructed by combining gas turbine generators, waste heat boilers, auxiliary boilers, etc. The planning problem proposed is to determine the optimal configuration of the plant equipment taking into account the optimal operational policy of the plant for the annual energy demands of electric power and heat given a priori . Based on the annual cost method, the long-term economics of the plant is evaluated by the annual total cost, which is the objective function to be minimized. This optimal planning problem is formulated as a mixed-integer linear programming problem, and the optimal solution is derived by adopting the branch and bound method. As a result, both the configuration of the plant equipment and the operational policy are optimally determined reflecting the difference in economics and efficiency of the scale of each equipment. In addition, both the power to be purchased and the value of maximum contract demand of the purchased power is optimally determined. Using a numerical example, the validity and effectiveness of the optimal planning method proposed here is ascertained.
The demand for electricity varies substantially from hour to hour, from day to day, and from season to season. Because electricity is a highly perishable commodity which can be stored only at great expense, and becaus...
详细信息
The demand for electricity varies substantially from hour to hour, from day to day, and from season to season. Because electricity is a highly perishable commodity which can be stored only at great expense, and because the penalty for failing to meet demand is severe, the fluctuations of demand over time are crucial in determining an optimal investment strategy for generating equipment. Traditionally, demand is represented by a load-duration curve which neglects the time of day when peaks and troughs occur. By incorporating a load-distribution curve into the model in a computationally tractable manner, this paper demonstrates that the results of the traditional models may be sensitive to changes in the assumptions implied by the load-duration curve. [ABSTRACT FROM AUTHOR]
This paper deals with an optimization problem for a system composed of continuous and discrete subsystems. The discrete subsystem is introduced to express a combinatorial constraint in conventional control problems. T...
详细信息
This paper deals with an optimization problem for a system composed of continuous and discrete subsystems. The discrete subsystem is introduced to express a combinatorial constraint in conventional control problems. The objective, the state equation and the constraint are assumed linear. Then, the problem is formulated as a mixed-integerlinear program with staircase structure. A feasible decomposition method is developed for obtaining a suboptimal solution of the problem. In applications to an optimal energy control and planning problem of a large-scale production Plant, the method gives a solution satisfying the condition that the number of switching times for the boiler operation is as small as possible.
暂无评论