EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
1594. MODELING PRODUCT ALLOCATION PROBLEM FOR SPLIT ORDERS AND SOLVING VIA CLUSTERING ALGORITHMS
Invited abstract in session TB-55: Freight transportation and logistic I, stream Transportation.
Tuesday, 10:30-12:00Room: S02 (building: 101)
Authors (first author is the speaker)
1. | Nihal Erginel
|
Industrial Engineering Department, Eskisehir Technical University |
Abstract
Product allocation problem is a warehouse management that concerns allocate the products to the storage positions in a warehouse or to the warehouses in multi-warehouse problem. If the orders split to the several warehouses, the cost of picking them up is a non-added value facility. So, the aim of product allocation problem is to determine which product should be located to the which warehouse to minimize the cost of handling and transportation activities of the split orders.
In multi-warehouse problem, trucks can visit more than one warehouse to pick up customer orders if an order split to others warehouse. In this study, we aim that is to minimize the number of visited warehouses for total orders under capacity of warehouse and demand of orders. The assumption is the one product can only storage to the one warehouse. The mathematical problem is constructed and solved with GAMS 38.3.0. Also, product allocation problem is a clustering problem in which products can be clustered with respect to the number of warehouses. In this study, k-means algorithm is used for clustering the products to the four warehouses. It is shown that the similar results are obtained from mathematical problem and clustering algorithm.
Keywords
- Logistics
- Machine Learning
- Engineering Optimization
Status: accepted
Back to the list of papers