910 resultados para disjunctive logic programming
Resumo:
In this paper, a hybrid heuristic methodology that employs fuzzy logic for solving the AC transmission network expansion planning (AC-TEP) problem is presented. An enhanced constructive heuristic algorithm aimed at obtaining a significant quality solution for such complicated problems considering contingency is proposed. In order to indicate the severity of the contingency, 2 performance indices, namely the line flow performance index and voltage performance index, are calculated. An interior point method is applied as a nonlinear programming solver to handle such nonconvex optimization problems, while the objective function includes the costs of the new transmission lines as well as the real power losses. The performance of the proposed method is examined by applying it to the well-known Garver system for different cases. The simulation studies and result analysis demonstrate that the proposed method provides a promising way to find an optimal plan. Obtaining the best quality solution shows the capability and the viability of the proposed algorithm in AC-TEP. © Tübi̇tak..
Resumo:
In this study, a novel approach for the optimal location and contract pricing of distributed generation (DG) is presented. Such an approach is designed for a market environment in which the distribution company (DisCo) can buy energy either from the wholesale energy market or from the DG units within its network. The location and contract pricing of DG is determined by the interaction between the DisCo and the owner of the distributed generators. The DisCo intends to minimise the payments incurred in meeting the expected demand, whereas the owner of the DG intends to maximise the profits obtained from the energy sold to the DisCo. This two-agent relationship is modelled in a bilevel scheme. The upper-level optimisation is for determining the allocation and contract prices of the DG units, whereas the lower-level optimisation is for modelling the reaction of the DisCo. The bilevel programming problem is turned into an equivalent single-level mixed-integer linear optimisation problem using duality properties, which is then solved using commercially available software. Results show the robustness and efficiency of the proposed model compared with other existing models. As regards to contract pricing, the proposed approach allowed to find better solutions than those reported in previous works. © The Institution of Engineering and Technology 2013.
Resumo:
The semiotics of C S. Peirce presents fundamental concepts to discover aspects of the indexing process, including representation and classes of signs. However, we still know little of its theoretical potential for subject indexing. We believe that the main difficulty in the proposals to understand the process of subject indexing based on Peircean semiotics stems from an incomplete interpretation of his semiotic system. This paper attempts to describe the contributions of Peircean semiotics to subject indexing. First, we analyze some of the concepts of the branches of semiotics, after which, we discuss strategies for conceptual approximation. Secondly, and aiming to raise the level of interlocution between the areas, we intend to argue that subject indexing is an inferential process, as explained by the second branch of semiotics. Thus, we seek to go beyond the level of speculative grammar, the first branch of semiotics, to forge a closer link with pure or critical logic, the second branch. We conclude that the indexer's work does not produce a mere reflection of what already exists in documents, but involves an instigating action to discover, through the inferential matrix, the meaning of a text in order to find the subject and the most appropriate subject added entry to the information system.
