• Journal of Information Technology Applications and Management
• /
• v.18 no.1
• /
• pp.125-141
• /
• 2011

As the sales volume of online shops increases, the job burden in the back-offices of the online shops also increases. Order picking is the most labor-intensive operation among the jobs in a back-office and mid-size pure click online shops are experiencing the time delay and complexity in order picking nowadays while fulfilling their customers' orders. Those warehouses of the mid-size shops are based on manual systems, and as order pickings are repeated, the warehouses get a mess and lots of products in those warehouses are getting missing, which results in severe delay in order picking. To overcome this kind of problem in online clothing shops, we research a methodology to locate warehousing products. When products arrive at a warehouse, they are packed into a box and located on a rack in the warehouse. At this point, the operator should determine the box to be put in and the location on the rack for the box to be put on. This problem could be formulated as an Integer Programming model, but the branch-and bound algorithm to solve the IP model requires enormous computation, and sometimes it is even impossible to get a solution in a proper time. So, we relaxed the problem, developed a set of heuristics as a methodology to get a semi-optimum in an acceptable time, and proved by an experiment that the solutions by our methodology are satisfactory and acceptable by field managers.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2007.11a
• /
• pp.556-563
• /
• 2007

국제 물동량의 증가로 인한 해상운송의 활성화는 시장 참여자들의 경쟁 심화로 이어지고 있다. 따라서 해상운송의 효율성 향상을 통한 경쟁력 강화의 필요성이 높아지고 있다. 특히 한국의 경우에는 자동차 수출입 물동량의 증가로 인한 자동차 운반선사(Car Carriers)의 효율적인 운송계획의 중요성이 강조되고 있다. 이에 본 연구에서는 자동차 운반선의 현황분석을 통한 운송계획의 문제점을 분석하고, 이를 해결할 수 있는 자동차 운반선 해상운송계획 지원 시스템을 개발한다. 이는 자동차 운반선에 관한 해상운송계획 과정을 체계화함으로써 계획의 수립 속도 및 질적 수준을 향상시키고, 계획의 체계적인 관리(수정, 변경 등)를 가능케 함으로써 사용자가 보다 나은 의사결정을 내릴 수 있도록 하기 위함이다. 한편 자동차 운반선의 해상운송계획 과정에서 해상운송과 자동차 화물의 특성에 의해 발생되는 다양한 예외상황들을 고려할 수 있도록 하기 위해 IP(Integer Programming) 모형을 사용하여 이익을 최대로 하는 또는 비용을 최소로 하는 최적의 안을 생성하고, 계획 수립 이후에 발생하는 변경사항들을 실무자가 효율적으로 수정할 수 있도록 해상운송계획 지원 시스템을 개발한다.

• Journal of Korea Game Society
• /
• v.16 no.3
• /
• pp.97-108
• /
• 2016

Multi-client online games usually employ multi-serve architectures. For group play, if the user response time deviation between the clients in a group is large, the fairness and attractions of the game will be degraded. In this paper, given new clients, we propose a method for assigning the clients to servers to minimize the deviation of client-server distance which plays a major role in the user response time. This method also supports client matching for group play and server load balancing. We formulate the client-server assignment problem as an IP one, and present a GA(Genetic Algorithm)-based algorithm to solve it. We experimented our method under various settings and analyzed its features. To our survey, little research has been previously performed on client-server assignment under consideration of client matching, distance deviation minimization and server load balancing.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.635-640
• /
• 2003

Due to the development of information technology and widespread use of telecommunications networks, the design of mesh-survivable net works has received considerable attention in recent years. This paper deals with spare capacity planning scheme in mesh-based fiber-optic networks. In this study, a new spare capacity planning scheme is proposed utilizing path restoration with maximal sharing of share capacity that is traced by the spare capacity incremental factor (after this, we called "SCIF"). We compare it with three other spare capacity planning scheme : link capacity of IP (Integer Programming), SLPA(Spare Link Placement Algorithm) and GA(Genetic Algorithm). The approach shows better performance with heuristics algorithm for determining the spare capacity assignment and the computational time is easily controlled allowing the approach to scale to large networks. The major advantages of the new approach are reduction of spare capacity and a polynomial time complexity.omplexity.

• Asia pacific journal of information systems
• /
• v.12 no.4
• /
• pp.193-213
• /
• 2002

The sales activity of most of small manufacturing companies is based on orders of buyers. The process of promotion, negotiation, receipt and selection of orders of the manufacturers is closely coupled with the load status of the production lines. The decision on whether to accept an order or not, or the selection of optimal order set among excessive orders is entirely dependent on the schedule of production lines. However, in the real world, since the production scheduling activity is mainly performed by human experts, most of small manufacturers are suffer from being unable to meet due dates, lack of rapid decision on the acceptance of new order. Recently, Internet based Electronic Commerce is recognized as one of the alternatives for strengthening sales power of small and medium companies. However, small and medium manufacturers can't adjust properly to the new environment because they are in short of money, personnel, and technology. To cope with this problem, this paper deals with development of part sales agent coupled with virtual manufacturing in Internet environment that consist of selection agent, advertisement agent, selection agent, negotiation agent, and virtual manufacturing system. This paper develops a time-bounded negotiation mechanism for small and medium manufacturers in agent-based automated negotiation between customers and negotiation agents. Furthermore, to select optimal order set maximized profit, we first formulate the order selection problem with mixed integer programming, but the computation time of IP is not acceptable for real world scale problem. To overcome this problem and dynamic nature of virtual manufacturing, we suggest a genetic algorithm approach, which shows a reasonable computation time for real world case and good incremental problem solving capability.