Optimization of Automated Warehouse Storage Location Assignment Problem Based on Improved Genetic Algorithm

LISS2019 ◽  
2020 ◽  
pp. 297-311
Author(s):  
Wenyi Zhang ◽  
Jie Zhu ◽  
Ruiping Yuan
Keyword(s):  
Genetic Algorithm ◽  
Assignment Problem ◽  
Improved Genetic Algorithm ◽  
Storage Location ◽  
Warehouse Storage ◽  
Location Assignment

Solving Stereo Warehouse Storage Location Assignment Problem Based on Genetic Algorithm

2013 ◽  
Vol 307 ◽  
pp. 459-463 ◽  
Author(s):  
Meng Jin ◽  
Xi Hui Mu ◽  
Liang Chun Li ◽  
Feng Po Du
Keyword(s):  
Genetic Algorithm ◽  
Programming Model ◽  
Data Sets ◽  
Improved Genetic Algorithm ◽  
Storage Location ◽  
Genetic Algorithm Method ◽  
Warehouse Storage ◽  
Storage Area ◽  
Location Assignment ◽  
Number Of Classes

Class-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 model for storage assignment. Computational experience on randomly generated data sets and an industrial case shows that improved genetic algorithm gives superior results than the genetic algorithm without improving for storage location assignment with ordering restriction.

scholarly journals Particle Swarm Optimization Using Neighborhood-Based Mutation Operator and Intermediate Disturbance Strategy for Outbound Container Storage Location Assignment Problem

2019 ◽  
Vol 2019 ◽  
pp. 1-13 ◽  
Author(s):  
Yuyan He ◽  
Aihu Wang ◽  
Hailiang Su ◽  
Mengyao Wang
Keyword(s):  
Particle Swarm Optimization ◽  
Assignment Problem ◽  
Particle Swarm ◽  
Local Solution ◽  
Mutation Operator ◽  
Swarm Optimization ◽  
Intermediate Disturbance ◽  
Storage Location ◽  
Location Assignment ◽  
Container Storage Location Assignment

Outbound container storage location assignment problem (OCSLAP) could be defined as how a series of outbound containers should be stacked in the yard according to certain assignment rules so that the outbound process could be facilitated. Considering the NP-hard nature of OCSLAP, a novel particle swarm optimization (PSO) method is proposed. The contributions of this paper could be outlined as follows: First, a neighborhood-based mutation operator is introduced to enrich the diversity of the population to strengthen the exploitation ability of the proposed algorithm. Second, a mechanism to transform the infeasible solutions into feasible ones through the lowest stack principle is proposed. Then, in the case of trapping into the local solution in the search process, an intermediate disturbance strategy is implemented to quickly jump out of the local solution, thereby enhancing the global search capability. Finally, numerical experiments have been done and the results indicate that the proposed algorithm achieves a better performance in solving OCSLAP.

A Genetic Algorithm for Minimizing Relocations at Container Yard in Container Terminal

2014 ◽  
Vol 931-932 ◽  
pp. 1683-1688
Author(s):  
Phatchara Sriphrabu ◽  
Kanchana Sethanan ◽  
Somnuk Theerakulpisut
Keyword(s):  
Genetic Algorithm ◽  
Current Practice ◽  
Container Terminal ◽  
Experimental Result ◽  
Container Ship ◽  
Storage Assignment ◽  
Storage Location ◽  
Location Assignment

This paper focuses on storage location assignment and exported container relocation in container yard of container terminal with the objective of minimizing the number of container lifting. On the lifting steps, the truck with yard crane should be chosen in order to deliver a container from container yard to container ship, and this action can reduce container ship's docking time and increase effectiveness in container terminal service. In this paper, a genetic algorithm (GA) in container storage assignment and a heuristic for the container relocation determination are adopted. Also, the current practice including first-in-first-stored (FIFS) and simple relocation (SR) is used to compare the effectiveness of the GA and the proposed heuristic (RH). The experimental result presented that the proposed method is able to construct the effective solutions of storage location assignment of exported containers, and it reduces the number of relocations of exported container effectively.

scholarly journals The storage location assignment problem: A literature review

2019 ◽  
pp. 199-224 ◽  
Author(s):  
Juan José Rojas Reyes ◽  
Elyn Lizeth Solano-Charris ◽  
Jairo Rafael Montoya-Torres
Keyword(s):  
Literature Review ◽  
Assignment Problem ◽  
Storage Location ◽  
Location Assignment

A study of the sensitivity of sequence stacking strategies for the storage location assignment problem for out-bound containers in a maritime terminal

2018 ◽  
Vol 9 (5) ◽  
pp. 1057-1062
Author(s):  
Roberto Guerra-Olivares ◽  
Neale R. Smith ◽  
Rosa G. González-Ramírez ◽  
Leopoldo Eduardo Cárdenas-Barrón
Keyword(s):  
Assignment Problem ◽  
Storage Location ◽  
Location Assignment
Sign in / Sign up

Export Citation Format

Share Document