Optimally solving the joint order batching and picker routing problem
نویسندگان
چکیده
منابع مشابه
Optimally solving the joint order batching and picker routing problem
In this work we investigate the problem of order batching and picker routing in storage areas. These are labour and capital intensive problems, often responsible for a substantial share of warehouse operating costs. In particular, we consider the case of online grocery shopping in which orders may be composed of dozens of items. We present a formulation for the problem based on an exponential n...
متن کاملJoint order batching and picker Manhattan routing problem
In picking product items in a warehouse to fulfill customer orders, a practical way is to classify similar orders as the same batch and then to plan the optimal picker routing when picking each batch of items. Different from the previous problems, this work investigates the joint order batching and picker Manhattan routing problem, which simultaneously determines the optimal order batching allo...
متن کاملA Solution Approach for the Joint Order Batching and Picker Routing Problem in a Two-Block Layout
Order Batching and Picker Routing Problems arise in warehouses when articles have to be retrieved from their storage location in order to satisfy a given demand specified by customer orders. The Order Batching Problem includes the grouping of a given set of customer orders into feasible picking orders such that the total length of all picker tours is minimized. The problem of determining the se...
متن کاملA Genetic Algorithm for the Order Batching Problem in Low-Level Picker-to-Part Warehouse Systems
In this work we introduce a Genetic Algorithm (GA) for the Order Batching Problem considering traversal and return routing policies. The proposed GA has been tested on randomly generated instances and compared with the wellknown savings algorithm. According to our extensive computational experiments we can say that the proposed GA yields promising solutions in acceptable computation times.
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2017
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2017.03.069