• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 추계학술대회 논문집 전력기술부문
• /
• pp.369-371
• /
• 2002

In a competitive electricity market, the transactions of the electric power can be accomplished through the bidding which is submitted by suppliers and consumers. It is essential that the optimal decision for the bidding is required to take a dominant position in the competition. Therefore, in this paper we presents bidding variables from bidding curves of suppliers and consumers and proposes the algorithm of an optimal bidding strategy using optimal power flow. Furthermore, the variation of the optimal bidding is investigated through numerical studies.

• 한국정보처리학회논문지
• /
• 제7권5S호
• /
• pp.1620-1628
• /
• 2000

Existing internet auction systems have adopted the form which gives a win to the auction bidder who proposes the top bid price for the goods posted on the auction board. But they haven't been satisfying the automatical one-step processing for user's convenience because they must require continuous care of user for bidding and checking as well as neglecting the convenience of user interface while participating in the electronic bidding system. The AuctionBot system of Michigan Univ. is known as the representative internet auction system. It has merit allowing the various kids of bidding. But it does not support automatic a process which can replaces what user has to do using an agent. To improve this kind of user interface, we propose an automatic bidding price strategy algorithm which composes the auction system using agent and design for auto-bidding system using agent so that I can replace user's bidding activity. This mechanism gives an auction system the efficient bidding price strategy.

• 대한산업공학회지
• /
• 제23권2호
• /
• pp.343-357
• /
• 1997

This paper proposes a new AGV dispatching algorithm which is suitable for heterarchical manufacturing control structure. It is developed on the basis of bidding concept utilizing the information of work-in-process in incoming and outgoing buffers of workstation, and travel time of AGV. Since the bidding functions are functions of two parameters, sensitivity test is performed to find their appropriate values. The performance of the algorithm is compared with those of well-known existing rules in terms of system throughput through simulation on a hypothetical job shop type manufacturing system.

• Journal of Electrical Engineering and Technology
• /
• 제10권1호
• /
• pp.64-74
• /
• 2015

Because of the burgeoning demand of the energy, the countries are finding sustainable solutions for these emerging challenges. Demand Side Management is playing a significant role in managing the demand with an aim to support the electrical grid during the peak hours. However, advancement in controls and communication technologies, the aggregators are appearing as a third party entity in implementing demand response program. In this paper, a detailed mathematical framework is discussed in which the aggregator acts as an energy service provider between the utility and the consumers, and facilitate the consumers to actively participate in demand side management by introducing the new concept of demand reduction bidding (DRB) under constrained direct load control. Paper also presented an algorithm for the proposed framework and demonstrated the efficacy of the algorithm by considering few case studies and concluded with simulation results and discussions.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 추계학술대회 논문집 전력기술부문
• /
• pp.63-66
• /
• 2001

In the Poolco model, the bidding game is executed periodically. The player participating to the bidding game accumulates the information of others' strategies and payoffs through the repeated process. Thereby, he is able to map out how he gets his maximum profit, and proceed to the optimal strategy region. This paper shows the algorithm for a player to determine his strategy in t period based the information of the game results of t-1, t-2 period. And this algorithm can be formulated by using Dynamic game theory.

• KIEE International Transactions on Power Engineering
• /
• 제5A권2호
• /
• pp.193-198
• /
• 2005

This paper proposes a new method to handle transmission line losses using loss distribution factors (LDF) rather than marginal loss factors (MLF) in electricity market operation. Under a competitive electricity market, the bidding data are adjusted to reflect transmission line losses. To date the most proposed approach is using MLFs. The MLFs are reflected to bidding prices and market clearing price during the trading and settlement of the electricity market. In the proposed algorithm, the LDFs are reflected to bidding quantities and actual generations/ loads. Computer simulations on a 9-bus sample system will verify the effectiveness of the algorithm proposed. Moreover, the proposed approach using LDFs does not make any payments residual while the approach using MLFs induces payments residual.

• 대한전기학회논문지:전력기술부문A
• /
• 제53권6호
• /
• pp.334-339
• /
• 2004

In this study, a new UC (Unit Commitment) algorithm is proposed to consider the uncertainty of a daily load profile. The proposed algorithm calculates the UC results with the lower load level than the one generated by the conventional load forecast and the more hourly reserve allocation. In case of the worse load forecast, the deviation of the conventional UC solution can be overcome with the proposed method. The proposed method is tested with sample systems, which shows that the new UC algorithm yields completely feasible solution even though the worse load forecast is applied. Also, the effects of the uncertain hourly load demand are statistically analyzed especially by the consideration of the average over generation and the average under generation. Finally, it is shown that independent power producers participating in electricity spot-markets can establish bidding strategies by means of the statistical analysis. Therefore, it is expected that the proposed method can be used as the basic guideline for establishing bidding strategies under the deregulation power pool.

• KIEE International Transactions on Power Engineering
• /
• 제5A권1호
• /
• pp.16-21
• /
• 2005

In this study, a new Unit Commitment (UC) algorithm is proposed to consider the uncertainty of a daily load profile. The proposed algorithm calculates the UC results with a lower load level than that generated by the conventional load forecast method and the greater hourly reserve allocation. In case of the worst load forecast, the deviation of the conventional UC solution can be overcome with the proposed method. The proposed method is tested with sample systems, which indicates that the new UC algorithm yields a completely feasible solution even when the worst load forecast is applied. Also, the effects of the uncertain hourly load demand are statistically analyzed, particularly by the consideration of the average over generation and the average under generation. Finally, it is shown that independent power producers participating in electricity spot-markets can establish bidding strategies by means of the statistical analysis. Therefore, it is expected that the proposed method can be used as the basic guideline for establishing bidding strategies under the deregulation power pool.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1997년도 추계학술대회발표논문집; 홍익대학교, 서울; 1 Nov. 1997
• /
• pp.162-165
• /
• 1997

본 연구에서는 off-line 스케쥴링과 on-line 스케쥴링을 함께 고려하는 스케쥴링 메카니즘에 대해 설명하였다. 일반적으로 스케쥴링은 off-line 문제를 주로 다룬다. 그러나, off-line으로 생성된 스케쥴은 실시간으로 발생하는 여러 문제들(기계 고장, 긴급 주문등) 때문에 현실과 맞지 않게 되어 유용성이 떨어지는 경우가 자주 발생한다. 따라서 off-line 스케쥴링의 결과를 수행할때 위와 같은 문제가 발생할 경우, 스케쥴의 변화를 흡수하면서 off-line 스케쥴링의 결과를 최대한 유지할수 있는 on-line 스케쥴링에서 이 같은 스케쥴 실행시의 문제를 해결할 수 있도록 bidding 알고리즘을 사용하는 방법을 제시하였다.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1995년도 춘계공동학술대회논문집; 전남대학교; 28-29 Apr. 1995
• /
• pp.510-510
• /
• 1995