2010
DOI: 10.3233/his-2010-0120
|View full text |Cite
|
Sign up to set email alerts
|

GA-based solutions comparison for warehouse storage optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 39 publications
0
2
0
Order By: Relevance
“…Multiple forklifts can carry out dangerous goods in and out of the warehouse at the same time and an alternative one is prepared too. Te distances of closed-loop routes between inbound and outbound point are recorded as 15, where the rows in L corresponds to the inbound point, and the column corresponds to the outbound point. Te matrix L is obtained by actual measurement.…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…Multiple forklifts can carry out dangerous goods in and out of the warehouse at the same time and an alternative one is prepared too. Te distances of closed-loop routes between inbound and outbound point are recorded as 15, where the rows in L corresponds to the inbound point, and the column corresponds to the outbound point. Te matrix L is obtained by actual measurement.…”
Section: Preliminariesmentioning
confidence: 99%
“…Although the aforementioned methods can achieve the objective of fnding the approximate solution in an optimization problem, these methods have academic blanks of path planning problem, particularly in the felds of route planning in warehouse operation. Noting the existing defects, Colla et al [15] proposed a simple path planning model for the navigation of mobile robots and introduced a genetic-search algorithm which improves the efciency of iteration. Bottani et al [16] explored the use of a genetic algorithm (GA) to optimize item allocation in a warehouse with the ultimate purpose of reducing the travel time of pickers, thus streamlining order picking operations.…”
Section: Introductionmentioning
confidence: 99%