2019
DOI: 10.1155/2019/9132315
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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 stren… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 55 publications
0
3
0
Order By: Relevance
“…The intelligent algorithms commonly used to solve the optimization problem of storage assignment include particle swarm optimization [15][16][17], genetic algorithm [17,18], ant colony optimization [19] and other neighborhood search heuristic algorithms [20][21][22]. There have been many studies on the improvement of these algorithms.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The intelligent algorithms commonly used to solve the optimization problem of storage assignment include particle swarm optimization [15][16][17], genetic algorithm [17,18], ant colony optimization [19] and other neighborhood search heuristic algorithms [20][21][22]. There have been many studies on the improvement of these algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…Lee et al [13] proposed a dual-objective storage allocation optimization model that takes picking efficiency and traffic balance into account and uses a multi-objective evolutionary algorithm to solve it. Different improved particle swarm optimization algorithms and improved genetic algorithms are used to solve the problem of outbound storage assignment and job scheduling [14][15][16][17][18][19]. Ning et al [20] put forward a method for optimizing the rack location based on item correlation and rack relevance in the fishbone layout.…”
Section: Introductionmentioning
confidence: 99%
“…Hu [23] designed a mutation operator similar to PSO iteration to provide individuals a direction in the evolutionary process, which can produce potential good individuals. He et al [24] proposed a neighbourhoodbased mutation operator strategy which is introduced into PSO to achieve the purpose of enhancing population diversity.…”
Section: Introductionmentioning
confidence: 99%