Results 191 to 200 of about 527 (217)
Some of the next articles are maybe not open access.
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
Evolving Self-Adaptive Tabu Search Algorithm for Storage Location Assignment Problems
Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation, 2015This study proposes a novel grammar guided Genetic Programming method to solve a real world problem, the Storage Location Assignment Problem (SLAP) with Grouping Constraints. Self-adaptive Tabu Search algorithms are evolved by this approach and it can be used as solvers for SLAPs.
Jing Xie 0007, Yi Mei 0001, Andy Song
openaire +1 more source
Scaling Up Solutions to Storage Location Assignment Problems by Genetic Programming
2014The Storage Location Assignment Problem SLAP is to find an optimal stock arrangement in a warehouse. This study presents a scalable method for solving large-scale SLAPs utilizing Genetic Programming GP and two sampling strategies. Given a large scale problem, a sub-problem is sampled from the original problem for our GP method to learn an allocation ...
Jing Xie 0007 +4 more
openaire +1 more source
Pareto and Niche Genetic Algorithm for Storage Location Assignment Optimization Problem
2008 3rd International Conference on Innovative Computing Information and Control, 2008Class-based storage and storage location assignment implementation decisions have significant impact on the required storage space and product picking efficiency in an automated warehouse. A multiobjective mathematical model was proposed for storage location assignment to capture the above.
Meijuan Li, Xuebo Chen, Chenqi Liu
openaire +1 more source
Solving Stereo Warehouse Storage Location Assignment Problem Based on Genetic Algorithm
Applied Mechanics and Materials, 2013Class-based stereo warehouse storage policy distributes products among a number of classes and for each class it reserves a region within the storage area. In this paper, a genetic algorithm method of using the intersectant operation of chromosome repair and mutation operation of two-way movement detection is developed to solve an integer programming ...
Meng Jin +3 more
openaire +1 more source
Storage location assignment: Using the product structure to reduce order picking times
International Journal of Production Economics, 1996 The stock location assignment problem is concerned and a strategy for prestructuring components and information for the picking work in storehouses is described. This classification is derived from the product structures transformed to support a holistic
Brynzér, Henrik +3 more
exaly +1 more source
Storage location assignment problem in a warehouse system
2014In a warehouse management system, there are a large number of items that needs to be handled efficiently with an emphasis on timely execution andoptimum utilization of storage space. A mathematical model is presented that involves the use of randomized storage and class based storage policy solving the storae assignment problem by reducing the transit ...
openaire +1 more source