2020
DOI: 10.1016/j.eswa.2020.113566
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid artificial neural network, genetic algorithm and column generation heuristic for minimizing makespan in manual order picking operations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
24
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 38 publications
(24 citation statements)
references
References 48 publications
0
24
0
Order By: Relevance
“…Structurally, and from an operational standpoint, order picking problems are composed of four sub-problems of order batching, batch assignment, batch sequencing, and picker routing [15] , [16] , [17] , among which order batching and picker routing are the subjects of this study. Order batching is primarily revolving around grouping a set of customer orders in such a manner to achieve a set of operational objectives such as total travel time or tardiness minimization [18] , [19] , [20] .…”
Section: Literature Reviewmentioning
confidence: 99%
See 3 more Smart Citations
“…Structurally, and from an operational standpoint, order picking problems are composed of four sub-problems of order batching, batch assignment, batch sequencing, and picker routing [15] , [16] , [17] , among which order batching and picker routing are the subjects of this study. Order batching is primarily revolving around grouping a set of customer orders in such a manner to achieve a set of operational objectives such as total travel time or tardiness minimization [18] , [19] , [20] .…”
Section: Literature Reviewmentioning
confidence: 99%
“…In the picker routing problem, the objective is to form the shortest possible path for picking the batches. Warehouse routing problems are usually modeled as a special case of the traveling salesman problem (TSP), known as Steiner TSP, where each visiting node has a maximum degree of four [17] . Since it was shown that Steiner TSPs encountered in rectangular warehouses with two cross-aisles are solvable in polynomial time [24] , several solvable cases of warehouse TSPs have been introduced, and efficient methodologies are developed for more general warehouse architectures [25] , [26] , [27] .…”
Section: Literature Reviewmentioning
confidence: 99%
See 2 more Smart Citations
“…erefore, this paper uses the method of deleting the individuals with high similarity in the initialized population, and only one similar individual needs to be retained. In the process of offspring genetic evolution, no matter which generation has individuals with high similarity, it is necessary to delete the redundant individuals and keep one [26].…”
Section: Research On the Social Talent Governancementioning
confidence: 99%