• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.367-370
• /
• 2006

인터넷 경매란 전자상거래 방식의 일종으로, 웹사이트를 통해 사이버거래 장소에서 구매자와 판매자간에 다양한 경매방식을 적용하여 물품의 경쟁매매가 이루어질 수 있도록 하는 서비스이다. 현재 국내외 인터넷 경매 사이트는 경매의 성격 보다 쇼핑몰에 경매를 부과한 형태의 복합적인 특징을 가지고 운용되고 있다. 이로 인해 가격을 기준으로 입찰 참여 및 경매 완료를 진행하기에는, 다소 현실성이 떨어진다는 문제를 내포하고 있다. 따라서, 본 논문은 구매하고자 하는 상품에 대하여 현재 진행 중인 경매의 상황을 예측 및 판단하여 구매자에게 경매 정보를 제공함으로써 합리적으로 물품의 구매를 도울 수 있는 알고리즘을 제시하고, 예측 알고리즘을 구현한 경매 예측 에이전트와 사용자의 패턴을 기록하고 상품구매, 입찰 등을 대리하는 에이전트들로 구성되는 에이전트 기반 경매 시스템을 소개한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.131-133
• /
• 2000

인터넷 경매는 경매인과 입찰자의 상호의사표현을 통한 구매 거래를 인터넷으로 하는 것을 말한다. 인터넷 경매는 상품을 게시하고 그 상품에 대해 경매 입찰자가 입찰에 참여하여 입찰마감시간에 가장 높은 입찰을 제시하는 경매 입찰자에게 상품이 낙찰되는 방법이 사용되고 있다. 국내에서도 인터넷 경매가 활성화됨에 따라 인터넷 경매 사용자를 위한 소프트웨어 에이전트 시스템의 연구가 진행이 되고 있다. 그러나 현 에이전트 시스템은 경매 정보에 대한 검색기능만이 제공되고 있다. 일반 경매에서 경매 분석가를 통해 경매 정보와 입찰 참여에 대한 자문을 구할 수 있으나 인터넷 경매에서 이러한 경매분석 시스템이 도입되어 있지 않다. 따라서, 단순한 게시판 형식의 인터넷 경매 시스템의 인공지능 에이전트를 도입하여 해당 경매상품에 대해 판매자에게 적정한 경매 시기와 초기값을 계산 및 예측하여 최대한의 마진을 남길 수 있도록 해주는 에이전트 시스템의 연구가 본 논문의 목적이다. 상품을 인터넷 경매에 올리는 판매자에게 해당 상품에 대해 판매자가 어느 시기에 얼마의 초기 가격으로 경매를 시작하면 최대한의 마진을 남길 수 있는지에 대해 정보를 메일로 푸쉬해 주는 시스템을 설계하며 마진 알고리즘을 이용하여 마진 결정 에이전트에 의해 마진을 생성하며 생성된 마진은 푸쉬에이전트에 의해 경매자에게 메일로 결과값을 전송해 주는 시스템을 제안한다.

• Proceedings of the KIEE Conference
• /
• summer
• /
• pp.292-294
• /
• 2004

In this paper, we design the GA-fuzzy precompensator of a Power System Stabilizer for Thyristor Controlled Series Capacitor(TCSC-PSS) for enhancement of power system stability. Here a fuzzy precompensator is designed as a fuzzy logic-based precompensation approach for TCSC-PSS. This scheme is easily implemented simply by adding a fuzzy precompensator to an existing TCSC-PSS. And we optimize the fuzzy precompensator with a genetic algorithm for complements the demerit such as the difficulty of the component selection of fuzzy controller, namely, scaling factor, membership Auction and control rules. Simulation results show that the proposed control technique is superior to a conventional PSS in dynamic responses over the wide range of operating conditions and is convinced robustness and reliableness in view of structure.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.904-913
• /
• 2005

This paper deals with an integrated problem of inventory control and dynamic pricing strategies for a commodity with price and sales-period dependent demand pattern, where a seller and customers have complete information of each other. The problem consists of two parts; one is each buyer's benefit problem which makes the best decision on price and time for buyer to purchase items, and the other one is a seller's profit problem which decides an optimal sales strategy concerned with inventory control and discount schedule. The seller's profit function consists of sales revenue and inventory holding cost functions. The two parts are closely related into each other with some related variables, so that any existing general solution methods can not be applied. Therefore, a simplified model with single seller and two customers in considered first, where demand for multiple units is allowed to each customer within a time limit. Therewith, the model is generalized for a n-customer-classes problem. To solve the proposed n-customer-set problem, a dynamic programming algorithm is derived. In the proposed dynamic programming algorithm, an intermediate profit function is used, which is computed in case of a fixed initial inventory level and then adjusted in searching for an optimal inventory level. This leads to an optimal sales strategy for a seller, which can derive an optimal decision on both an initial inventory level and a discount schedule, in $O(n^2)$ time. This result can be used for some extended problems with a small customer set and a short selling period, including sales strategy for department stores, Dutch auction for items with heavy holding cost, open tender of materials, quantity-limited sales, and cooperative buying in the on/off markets.

• The Journal of Society for e-Business Studies
• /
• v.19 no.1
• /
• pp.43-61
• /
• 2014

This research is an application of game theory to developing the supplier selection and demand allocation mechanism, which are the essential and major research areas of supply chain planning and operation. In this research, the most popular and widely accepted mechanism, the progressive reverse auction is analyzed and compared with the other game theoretic approach, Kalai-Smorodinsky Bargaining Solution in the viewpoint of holistic efficiency of supply chain operation. To logically and exquisitely compare the efficiencies, a heuristic algorithm based on Genetic Algorithm is devised to find the other optimal demand allocation plan. A well known metric, profit-cost ratio, as well as profit functions for both suppliers and buyer has been designed for evaluating the overall profitability of supply chain. The experimental results with synthesis data and supply chain model which were made to mimic practical supply chain are illustrated and analyzed to show how the proposed approach can enhance the profitability of supply chain planning. Based on the result, it can be said that the proposed mechanism using bargainging solution mayguarantee the better profitability for the whole supply chin including both suppliers and buyer, even though quite small portion of buyer's profitability should be sacrified.

• The KIPS Transactions:PartA
• /
• v.11A no.4
• /
• pp.267-276
• /
• 2004

The modeling methods of routing region used in the automatic placement/routing system are a grid and non-grid. Because the gird method is curbed by its size and a board if the electrical and physical elements on PCB are of small quantity, it has many memories. Therefore, it has demerit which decreases the speed of automatic placement/routing. The Shape-based type, non-grid method, makes the shapes exist as an in dividual element in a memory by using a region-processing method. Each individual element needs very small memory since it has its unique data size. Therefore, this paper aimed to develope the automatic placement/routing system which can automatically place and route the PCB without dissipation of memory at a high speed. To this aim, the auction algorithm method was applied which can make the memories be most rapidly reached from the original point to various destinations. Also, this system was developed by the Visual C++ in the Widows environment of IBM Pentium computer in order to use it in an individual PC system.