• 한국시뮬레이션학회논문지
• /
• 제28권1호
• /
• pp.1-9
• /
• 2019

최근 물류창고의 중요성이 높아지고 있는 가운데 소량 다빈도 및 빠른 납품에 대응하기 위해 피킹 프로세스 개선에 많은 노력을 기울이고 있다. 본 연구는 개별오더 피킹 정책이 사용되는 상황에서 오더를 피커에게 할당하는 알고리즘을 제시한다. 이 알고리즘에서는 피킹과 관련된 피킹 처리시간, 오더 접수후 경과 시간, 검수/패킹 작업대 상황, 피커 오류, 고객 중요도의 다섯 개의 속성을 동시에 고려한다. 각 속성에 대한 측정값의 단위가 동일하도록 긴급도라는 척도를 도입한다. 긴급도의 값이 클수록 할당 우선순위를 높게 설정한다. 제안한 알고리즘에서는 각 속성의 가중치를 변경함으로써 피킹시스템의 운영목표에 따라 할당 정책을 유연하게 조정할 수 있도록 하였다. 가상의 축소된 물류창고를 대상으로 시뮬레이션 실험을 수행한 결과 시스템 쓰루풋과 흐름시간 측면에서 우수한 성능을 보였다.

• 한국산업융합학회 논문집
• /
• 제26권2_2호
• /
• pp.249-254
• /
• 2023

The use of robots in automated factories requires accurate bin-picking to ensure that objects are correctly identified and selected. In the case of atypical objects with multiple reflections from their surfaces, this is a challenging task. In this paper, we developed a random 3D bin picking system by integrating the low-cost vision system with the robotics system. The vision system identifies the position and posture of candidate parts, then the robot system validates if one of the candidate parts is pickable; if a part is identified as pickable, then the robot will pick up this part and place it accurately in the right location.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2001년도 춘계학술발표논문집 (상)
• /
• pp.349-352
• /
• 2001

웹 기반 협동설계시스템은 인터넷망과 웹브라우저를 이용하여 공유된 가상 공간에서 협동작업이 이루어지도록 한다. 이때 공유 오브젝트는 3D 도형이 되며, 사용자가 임의의 오브젝트를 선택하여 조작하기 위하여 picking이 효과적으로 이루어져야 한다. 본 논문에서는 오브젝트의 picking이 마우스 포인터에서의 ray와 오브젝트간에 intersection을 계산하는 방법 외에 Java 3D API를 이용하여 scene graph의 노드에 picking 속성을 주는 방법, bounds를 설정하는 방법, picking test의 범위를 한정하는 방법을 사용하여 computation의 부담을 줄이고 효과적인 picking이 이루어지도록 한다.

• 산업경영시스템학회지
• /
• 제47권2호
• /
• pp.190-197
• /
• 2024

By the recent fast growth of e-commerce markets, it has been stimulated to study order picking systems to improve their efficiency in distribution centers. Many companies and researchers have been developed various types of order picking systems and pursued the corresponding optimal operation policies. However, the performances of the systems with the optimal policies often depend on the structures of the centers and the operation environments. Based on a simulation model that mimics a unique zone picking system operated by a real company in the Republic of Korea, this study compares several operation policies and finds the most appropriate order selection rule and worker assignment policy for the system. Under all scenarios considered in this study, simulation results show that it is recommendable to assign more efficient workers to the zones with heavier workload. It also shows that selecting the order with the maximum number of non-repeatedly visited zones from the order list provides the most consistent and stable performances with respect to flow time, makespan, and utilization of the system even under the scenario with the breakdown zones. On the other hand, selecting the order with the minimum ratio of penalty to the number of zones performs the worst in all scenarios considered.

• Journal of Biosystems Engineering
• /
• 제28권5호
• /
• pp.439-448
• /
• 2003

An image processing algorithm was developed for a robot system which was used in gene study. The robot system achieved a job of colony picking. The colony included DNA of an organism. The robot picked up the colony in petri-dish, which included the cultivated colony in medium, by a picking pin, and moved the colony to wellplates. The vision system consisted of an image acquisition system which acquired the image information of colony, an illumination device which irradiated the object once when it got the image of it, a computer and so on. The image processing algorithm distinguished the colony and detected colony positions. Performance test of the developed algorithm showed that the distinguishing success rate of colony and detecting success rate of colony positions were over 96%.

• 한국항해항만학회지
• /
• 제33권7호
• /
• pp.477-482
• /
• 2009

In this paper the order picking problem in warehouses is considered, a topic which has received considerable attention from the international academic body in recent years. The order picking problem deals with the retrieval of order items from prespecified locations in the warehouse, and its objective is usually the minimization of travel time or travel distance. Hence, a well-thought order picking policy in combination with an appropriate storage policy will enhance warehouse efficiency and reduce operational costs. This paper starts with a literature overview summarizing approaches to routing order pickers, assigning stock-keeping units to pick locations and designing warehouse layouts. Since the layout design might affect both storage and routing policies, the three factors are interdependent with respect to order picking performance. To test these interdependencies, a simulation experiment was set up, involving two types of warehouse layout, four types of storage policy, five well-known heuristics and five sizes of order picking list. Our results illustrate that from the point of view of order picking distance minimization it is recommended to equip the warehouse with a third cross aisle, although this comes at the cost of a certain space loss. Additionally, we propose a set of most appropriate matches between order picking heuristics and storage policies. Finally, we give some directions for further research and recommend an integrated approach involving all factors that affect warehouse efficiency.

• Journal of information and communication convergence engineering
• /
• 제1권2호
• /
• pp.82-87
• /
• 2003

We are able to work on the shared virtual space in Web-based Collaborative Design System using only Internet and Web browser. Then the users will share 3D objects and must be able to pick the objects effectively which they want to manipulate. In this paper, picking is implemented not only by computing intersection of mouse pointer with the objects of the virtual world, but also by using capabilities and attributes of scene graph node, by setting bounds intersection testing instead of geometric intersection testing, by limiting the scope of the pick testing, using Java 3D. These methods can reduce the computation of picking and can pick 3D objects effectively and easily using the system of hierarchy.

• 지구물리와물리탐사
• /
• 제10권2호
• /
• pp.131-137
• /
• 2007

초동발췌 방법과 이와 관련된 오차문제를 고찰하고 자료처리 전산화 측면에서 초동발췌 및 오차계산의 실용적 알고리즘을 제안하였다. 제안한 초동발췌 방법은 2단계로 구성된다. 1) 초동신호 중 트레이스 간 연속성이 양호한 최초의 피크(peak) 또는 트라프(trough)를 발췌한다. 2) 발췌시점 전방 일정구간의 기록을 직선으로 근사화 하고 이 직선의 시간 절편을 초동주시로 한다. 근사화 구간의 길이는 대략 초동 웨이브렛 폭의 1/4보다 다소 작게 설정한다. 초동발췌에 내재된 오차의 정량적인 척도는 기록의 특정시점에 초동의 도착 여부를 판단하는 데 필요한 기록의 길이로 정의한다. 기록의 길이를 나타내는 공식은 신호의 주파수대역과 신호대잡음비의 함수로 표시된다. 3개의 공대공 탄성파기록의 초동을 수동 및 제안한 방법으로 발췌하였고 각 트레이스의 오차한계를 계산하였다. 실험결과 제안한 근사직선 시간절편법의 우수한 성능과 발췌된 초동평가에 있어서 발췌오차의 유용성을 확인하였다.

• 산업공학
• /
• 제17권4호
• /
• pp.450-458
• /
• 2004

S-Distribution Center supplies parts to three plants of K-automobile manufacturing company. Since the three plants employ the JIT production system, it is important for S-Distribution Center to deliver small quantities of parts frequently and quickly on time. This paper presents a case study on the improvement of order-picking operation in S-Distribution Center. The study is focused on the reductions of move time and waiting time by redesigning the parts storage location, picking-order terminal location, retrieval policy, and equipment operation policy. The proposed operation system for S-Distribution Center is evaluated through a simple computation analysis and computer simulation. Furthermore, the reducible numbers of equipment and order pickers are investigated by performing a sensitivity analysis.

• Industrial Engineering and Management Systems
• /
• 제14권3호
• /
• pp.289-298
• /
• 2015

This paper analyses the best batch formations for order picking throughput in narrow-aisle order picking systems. Our analytical comparison finds that a high pick density variation leads to a heavy picker blocking. Simulation experiments show that a distance-based batching algorithm reduces picker blocking by decreasing the number of aisles visited and stabilizing the variation in number of picks per aisle by packing orders tightly, and that the solution quality and mechanism for determining the batch size dictated by the sorting strategy causes varying amounts of blocking. We conclude that combining a distance-based batching method with an appropriate batch sizing strategy will reduce picker blocking and shorten travel in narrow-aisle picking systems.