• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.3
• /
• pp.322-328
• /
• 2007

Highly standardized products are suitable for automated purchasing using electronic commerce technology, where the price becomes the most important factor. Suppliers can change the prices dynamically based on the inventory level and market situation in order to maximize the sales and profit. In the virtual marketplace where multiple customers purchase multiple standardized products from multiple suppliers repetitively, customers can purchase the required amount of each item as a dynamic bidding by allocating purchase orders to the suppliers based on the current price. Customers need a method to quickly determine the optimal allocation of orders to the suppliers using the dynamically changing data to minimize the total cost. We present a LP model which minimizes the sum of the total price plus transportation cost for this problem. Simulation results using random data show meaningful reduction of the total cost.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.12
• /
• pp.1648-1656
• /
• 2018

The configuration of redundant inertial sensors are very important when considering navigation performance and fault detection and isolation (FDI) performance. By constructing a redundant sensor system using multiple inertial sensors, it is possible to improve the navigation performance and fault detection and isolation performance, which are highly related to the sensor configuration and allocation. In order to deploy multiple MEMS inertial measurement units effectively, a configuration and allocation methods considering navigation performance, fault detection and isolation performance, and lever arm effect in one plane are presented, and the performance is analyzed through simulation in this research. From the results, it is confirmed that the proposed configuration and allocation method can improve navigation, FDI, and lever arm effect rejection performances more effectively by more than 70%.

• Proceedings of the KSME Conference
• /
• 2005.11a
• /
• pp.224.1-224.1
• /
• 2005

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.10a
• /
• pp.71-74
• /
• 2000

Due to the complexity of parts flow and limited resources, FMS(Flexible Manufacturing System) develops blocking, starvation and deadlock problems, which reduce its performance. In order to minimize such problems buffers are imposed between workstations of the manufacturing lines. In this paper, we are concerned with finding the optimal buffer allocation with regard to maximizing system throughput in limited total buffer capacity situation of FMS. A grouping heuristic to solve the buffer allocation problem is proposed. Computer simulation using Arena will be experimented to show the validation of the proposed algotithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.1
• /
• pp.24-30
• /
• 1988

We study the optimal allocation of machines and pallets in a class of manufacturing systems. The FMS is modeled as a closed queueing network with balanced loading of the stations. An Algorithm is developed, which exploits the properties of the throughput function and solves the allocation problem for increasing concave profit and convex cost. We also study the more general case of allocating machines and pallets among a set of FMSs. A dynamic programming approach is developed, which solves the problem with O(M$^{3}$N$^{2}$) operations.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.11a
• /
• pp.215-218
• /
• 2003

본 논문에서는 다수의 셀로 구성된 CDMA 시스템의 순방향 링크를 대상으로 지연 및 PRER 제약과 전송출력 제약 하에서 데이터 전송률과 사용자간 형평성을 반영한 총효용을 최대화하기 위한 각 기지국의 총평균전송출력과 각 사용자의 데이터 전송률 할당 체계를 제시한다. 실험을 통해 모든 셀을 동시에 고려하는 OPARS(Optimal Power and Rate Allocation Scheme)가 각 셀을 개별적으로 고려하는 SPRAS(Separate Power and Rate Allocation Scheme)에 비해 더 좋은 해를 제공한다는 것을 알 수 있었다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.6 no.1
• /
• pp.75-82
• /
• 1981

This paper considers urban emergency service systems that dispatch vehicles (facilities) from fixed bases with the objective of finding an optimum allocation of emergency facilities. A case study of fire station problem of Seoul city is conducted to analyze the deployment of fire-fighting resources and develop a class of improved deployment strategies with Parameteric Allocation Model (P.A.M.). The study shows a long term plan leading to balanced fire protection for most fire hazardous districts as well as low alarm districts.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.149.3-149
• /
• 2001

Task allocation is a key problem in multiagent systems. The importance of automated negotiation protocols for solving the task allocation problem is increasing as a consequence of increased multi-agent applications. In this paper, we introduce the multiagent Traveling Salesman Problem(TSP) as an example of task reallocation problem, and suggest Vickery auction as an inter-agent coordination mechanism for solving this problem. In order to apply this market-based coordination mechanism into multiagent TSPs, we define the profit of each agent, the ultimate goal of negotiation, cities to be traded out through auctions, the bidding strategy, and the order of auctions. The primary advantage of such approach is that it can find an optimal task allocation ...

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5759-5779
• /
• 2017

As the main means to cope with the stubborn problem of drunk driving, the inspection of drunk driving has already been paid more attention and thus reinforced. In this paper, we model this scenario as a Stackelberg game, where the police department (called defender) allocates resources dynamically in terms of the traffic situation on the traffic network to arrest drink drivers and drivers who drink (called attacker), whether choosing drunk driving or designated driving service, expect to minimize their cost for given travel routes. However, with the number of resources are limited, our goal is to calculate the optimal resource allocation strategy for the defender. Therefore, first, we provide an effective approach (named OISDD) to fulfill our goal, i.e., generate the optimal strategy to inspect drunk driving. Second, we apply OISDD to directed graphs (which are abstracted from Dalian traffic network) to analyze and test its correctness and rationality. The experimental results show that OISDD is feasible and efficient.

• Water for future
• /
• v.27 no.1
• /
• pp.111-121
• /
• 1994

The purpose of this paper is to construct a network model for the optimal allocation of limited water resources to the nodal system with given priorities. The solution technique for the model is based on the out-of-kilter algorithm(OKA). For the verification and application of the theoretical methodology and computer programs, the Geum river system is selected. Using release of Daecheong dam and water demand in Geum river basin, optimal allocation of water resources is accomplished for 4 cases(case 1 - case 4) which consider priority numbers in the demand nodes. The results of the application show that the model can reasonably represent the physical system, and water shortage at the demand nodes with high priority numbers is reduced. Its system solution was verified with that by the revised simplex algorithm.