oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 41 )

2018 ( 173 )

2017 ( 169 )

2016 ( 200 )

Custom range...

Search Results: 1 - 10 of 4246 matches for " order picking "
All listed articles are free for downloading (OA Articles)
Page 1 /4246
Display every page Item
Improving Order Picking Efficiency with the Use of Cross Aisles and Storage Policies  [PDF]
Charles G. Petersen, Gerald R. Aase
Open Journal of Business and Management (OJBM) , 2017, DOI: 10.4236/ojbm.2017.51009
Abstract: Order picking operations need to efficiently process orders in today’s competitive environment. Previous research generally assumed on even placement of the cross aisles. This research examines the placement of cross aisles in order picking operations and its effect on various storage policies. While previous research has primarily examined cross aisles and storage policies separately, this research looks at them simultaneously. The results showed no difference between even and uneven placement of cross aisles and that within-aisle storage is better than across-aisle and random storage. The results also showed that within-aisle storage provides greater travel distance savings than the use of cross aisles.
Using Simulation to Object-Oriented Order Picking System
Ming- Feng Yang
Information Technology Journal , 2008,
Abstract: Simulation is one of the most frequently used techniques for production system study and design. Simulation created by an object-oriented program has the advantages of hierarchical structures, inheritance, polymorphism and object re-use. This study uses eM-plant, the standard object-oriented software to model the order picking system. Order picking is an essential operation and the major cost constituent of the distribution center. This study attempts to provide the warehouse manager with order picking and operation; examines several storage assignment policies and several sensitivity analyses. The simulation experiment results can offer reference bases for warehouse administrator decision-making.
Research on AGV Path Planning under “Parts-to-Picker” Mode  [PDF]
Jun-E Liu, Shujun Zhang, Hongling Liu
Open Journal of Social Sciences (JSS) , 2019, DOI: 10.4236/jss.2019.76001
Abstract: This paper aims to optimize the “Parts to Picker” picking system with order sorting and AGV path planning as its priorities according to AGV-based “Parts to Picker” sorting mode and the order picking procedures. And this paper builds an intelligent order batching model with the minimum number of AGV handling shelves as the objective function. In addition, this paper also introduces the concept of order proximity coefficient, realizes reasonable and effective batching of orders. Based on the results of the order batching, this paper presents a goods-picking list in the target shelves after collecting various order batches, and proposes a TSP-based and “S-type” shelves handling strategy. In addition, this paper builds a path planning model with the shortest AGV total handling distance. The path planning under multiple AGVs parallel situation is realized. Finally, this paper proves the efficiency of AGV path planning strategy based on the results of orders batching by listing practical examples from enterprise.
订单分拣二级优先轮询控制机理研究
Study on Secondary Priority Polling Mechanism of Order-Picking
 [PDF]

冉文学, 施心陵, 杨国敏
Management Science and Engineering (MSE) , 2013, DOI: 10.12677/MSE.2013.22008
Abstract:
本文研究根据订单分拣的系统特性要求将订单VC 队列划分为两级,其中包括一个优先队列,即订单优先(Priority Order)部分,和多个普通队列,即普通订单(Common Order)部分。研究中,针对单元物料自动化订单分拣控制的快捷性、实时性和公平性要求,对两种不同的订单队列采用不同的控制策略——对优先订单队列采用完全轮询服务策略,实现其服务的优先级控制;对普通订单队列采用限定轮询服务策略,实现其服务的公平性控制,并对两种策略采用并行调度。采用嵌入式Markov 链和概率母函数方法,对该轮询系统模型的控制机制及一阶、二阶特性参数进行精确求解;并结合订单分拣的实际生产优先级参数,进行仿真分析。
According to the characteristics of order-picking system, the VC queues are classified into priority queues (priority order) and multiple common queues (common order). In this paper, according to the requirements of rapidity, real-time and fairness of the unit material automation order-picking control, exhaustive service strategy is explored to apply in priority order to achieve the priority control, while the limited service strategy is explored to apply in common order to achieve the fairness control, both two service strategies are adopted to parallel scheduling. In this paper, embedded Markov chain and probability generating function are adopted to solve the control mechanism. Combined with the real-world priority parameters of order-picking, this paper studies the actual value of order-picking polling system by way of simulation.
DYNAMIC ABC STORAGE POLICY IN ERRATIC DEMAND ENVIRONMENTS
Benjamin Pierre,Bart Vannieuwenhuyse,Denis Dominanta,Hendrik Van Dessel
Jurnal Teknik Industri , 2003,
Abstract: The paper describes a dynamic variant of the traditional ABC storage policy. The variant is to be used in manual order picking warehouses where SKUs experience a rather unstable demand. Its objective is to reduce the order picking time. It mainly consists in shifting items between the storage areas A, B and C according to the way their daily number of order lines changes. A few case studies based on computer simulations have shown that this variant can yield interesting time savings if its parameters are chosen with care. One of those case studies is presented in this paper. Because of the pioneering nature of this variant, some ideas for further research are also sketched.
Metaheuristics for the Order Batching Problem in Manual Order Picking Systems
Sebastian Henn,S?ren Koch,Karl F. Doerner,Christine Strauss
BuR : Business Research , 2010,
Abstract: In manual order picking systems, order pickers walk or drive through a distribution warehouse in order to collect items which are requested by (internal or external) customers. In order to perform these operations efficiently, it is usually required that customer orders are combined into (more substantial) picking orders of limited size. The Order Batching Problem considered in this paper deals with the question of how a given set of customer orders should be combined such that the total length of all tours is minimized which are necessary to collect all items. The authors introduce two metaheuristic approaches for the solution of this problem: the first one is based on Iterated Local Search; the second on Ant Colony Optimization. In a series of extensive numerical experiments, the newly developed approaches are benchmarked against classic solution methods. It is demonstrated that the proposed methods are not only superior to existing methods but provide solutions which may allow distribution warehouses to be operated significantly more efficiently.
Optimal dispensers'' combination for complex cigarette sorting system
复合式卷烟分拣系统分拣机组合优化

XIAO Ji-wei,WU Yao-hua,LOU Shan-zuo,SUN Guo-hua,
肖际伟
,吴耀华,娄山佐,孙国华

系统工程理论与实践 , 2010,
Abstract: This paper studies the effects of horizontal dispensers and A-frame dispensers' combination on sorting cost and time consume in complex sorting system,which typically used in cigarette distribution center.An optimization model is developed to minimize unit sorting cost,and it's simplified based on the characters of dispensers.The results show that the fixed cost increases,mini-variable cost and mini-sorting time decreases,unit sorting cost decreases first and then increases as the horizontal dispensers' qua...
Augmented Reality for Realistic Simulation Using Improved Snake and Picking Algorithm by Proportional Relational Expression  [PDF]
JeongHee CHA, GyeYoung KIM, HyungIl CHOI
Int'l J. of Communications, Network and System Sciences (IJCNS) , 2009, DOI: 10.4236/ijcns.2009.27079
Abstract: In realistic simulation of mobile Augmented Reality, essential point is how to best depict occluded area in such a way that the user can correctly infer the depth relationships between real and virtual objects. However, if the constructed 3D map of real world is not accurate or the density is not sufficient to estimate the object boundary, it is very difficult to determine the occluded area. In order to solve this problem, this paper proposes a new method for calculating the occlusion area using the improved snake algorithm and picking algo-rithm by the proportional relational expression. First, we generated the wireframe by the DEM in the experimental region and mapped to CCD real image using visual clues. And then, we calculated the 3D information at the point where occlusion problem for a moving virtual target by the proposed method. Experimental results show the validity of the proposed approach under the environment in which partial occlusions occur.
Research on the Order Picking Optimization Problem of the Automated Warehouse
自动化立体仓库拣选作业路径优化问题研究

CHANG Fa-liang,LIU Zeng-xiao,XIN Zheng,LIU Dong-dong,
常发亮
,刘增晓,辛征,刘冬冬

系统工程理论与实践 , 2007,
Abstract: Optimizing the order picking is effective on advancing the working efficiency of automatic warehouse.According to the characters of picking working in automated warehouse,a new mathematic model was proposed with capacity constrains and multiple objective.A genetic algorithm was presented to solve the problem with the initial population based on unfeasible degree and work times.Simulation and practice shows that this model and method is useful and effective.
Mother Picks Her Child’s Skin: A Case Report
Verda TüZER,Hatice Alkan AKDA?
N?ropsikiyatri Ar?ivi , 2010,
Abstract: Psychogenic skin picking is reported to be found in 5.4% of the general publicand might accompany other psychiatric disorders. The exact place ofpsychogenic skin picking on the spectrum between impulse control disorderand obsessive compulsive disorder is under discussion and it has also beenregarded as a psychosomatic symptom, which helps to neutralize aggressiveimpulses, or as a self-harm behaviour. In this paper, we present a case of apatient with lifelong skin picking behaviour, which started at childhood andcontinued with picking the skins of her two children and with a childhoodsexual and physical abuse history. (N ropsikiyatri Arflivi 2010; 47: 263-6)
Page 1 /4246
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.