Results 201 to 210 of about 8,560 (237)
Some of the next articles are maybe not open access.
Mathematical modeling and solving procedure of the planar storage location assignment problem
Computers and Industrial Engineering, 2009This paper focuses on the planar storage location assignment problem (PSLAP) that needs to be clearly defined and newly formulated. In addition, the solving procedure should be developed. The PSLAP can be defined as the assignment of the inbound and outbound objects to the storage yard with aim of minimizing the number of obstructive object moves.
Changkyu Park, Junyong Seo
exaly +2 more sources
Comparing heuristic algorithms of the planar storage location assignment problem
Transportation Research, Part E: Logistics and Transportation Review, 2010Abstract This paper discusses the newly defined planar storage location assignment problem (PSLAP). We develop a mathematical programming model and GA-based and dynamic PSLAP heuristic algorithms for the solving procedure. Using the testing set, we compare the performance of GA-based and dynamic PSLAP heuristic algorithms.
Changkyu Park, Junyong Seo
exaly +2 more sources
New model of the storage location assignment problem considering demand correlation pattern
Computers and Industrial Engineering, 2019Abstract Order-picking is the most time- and labor-consuming operation in a warehouse and significantly influences supply chain efficiency. One of the basic methods for improving order-picking efficiency involves assigning storage locations to appropriate items, i.e., the storage location assignment problem (SLAP).
Ren-Qian Zhang, Xing Pan
exaly +2 more sources
A Structured Approach to Address the Storage Location Assignment Problem: A VIKOR-Based Solution
Lecture Notes in Networks and SystemsThe allocation of Stock Keeping Units (SKUs) within warehouses is a crucial factor influencing a company’s logistical efficiency. Identifying the best location for each SKU is a tricky task for warehouse managers, as it directly affects key operational factors such as picking speed, travel distances, and internal flow.
Giada La Scalia +2 more
exaly +4 more sources
Solving the Storage Location Assignment Problem Using Reinforcement Learning
Proceedings of the 2023 8th International Conference on Mathematics and Artificial Intelligence, 2023Abstract: In this work, we deal with the Storage Location Assignment Problem, often referred to as the SLAP, in an E-commerce Distribution Center (EDC). With E-commerce steadily increasing in popularity over the past decades, it has become a key part of the logistics industry.
Arne Troch +2 more
openaire +2 more sources
Gravity Clustering: A Correlated Storage Location Assignment Problem Approach
2020 Winter Simulation Conference (WSC), 2020Warehouses and warehouse-related operations have long been a field of interest for researchers. One of the areas that researchers focus on is the Storage Location Assigning Problem (SLAP or Slotting). The goal in this field is to find the best location in a warehouse to store the products.
Mohammadnaser Ansari, Jeffrey S. Smith
openaire +1 more source
A restricted neighbourhood Tabu Search for Storage Location Assignment Problem
2015 IEEE Congress on Evolutionary Computation (CEC), 2015The Storage Location Assignment Problem (SLAP) is a significant optimisation problem in warehouse management. Given a number of products, each with a set of items with different popularities (probabilities of being ordered), SLAP is to find the best locations for the items of the products in the warehouse to minimise the warehouse operational cost ...
Jing Xie 0007 +4 more
openaire +1 more source
International Journal of Production Research, 2008
Storage location assignment and interleaving policy are two closely related problems in warehousing management. This paper addresses the location assignment and interleaving problem at the same time in an automated storage/retrieval system with duration-of-stay based shared storage policy.
Lu Chen, André Langevin, Diane Riopel
openaire +2 more sources
Storage location assignment and interleaving policy are two closely related problems in warehousing management. This paper addresses the location assignment and interleaving problem at the same time in an automated storage/retrieval system with duration-of-stay based shared storage policy.
Lu Chen, André Langevin, Diane Riopel
openaire +2 more sources
Heuristic algorithms for a storage location assignment problem in a chaotic warehouse
Engineering Optimization, 2014The extensive application of emerging technologies is revolutionizing warehouse management. These technologies facilitate working with complex and powerful warehouse management models in which products do not have assigned fixed locations (random storage). Random storage allows the utilization of the available space to be optimized.
Sacramento Quintanilla +3 more
openaire +1 more source
Differential Evolution Algorithm for Storage Location Assignment Problem
2015This study addresses warehouse storage location assignment problems (SLAP) where the traveling distance in an order-picking process is considered with three-axis traveling distance; two-horizontal and one-vertical distance. A mathematical model of the problem is first presented, then LINGO is used to find optimal solutions for a set of generated ...
Warisa Wisittipanich, Pongsakorn Meesuk
openaire +1 more source