2005
DOI: 10.1007/11552451_139
|View full text |Cite
|
Sign up to set email alerts
|

A Robust Approach for Improving Computational Efficiency of Order-Picking Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
2
0
1

Year Published

2014
2014
2018
2018

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 3 publications
0
2
0
1
Order By: Relevance
“…Comparisons between heuristics routing method and optimal routing method are given by [5] and [6]. Many researchers have focused on the optimal routing method for examples [7], [8] and [9]. The main considerations of those researches are distance and travel time.…”
Section: Problem Description and Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…Comparisons between heuristics routing method and optimal routing method are given by [5] and [6]. Many researchers have focused on the optimal routing method for examples [7], [8] and [9]. The main considerations of those researches are distance and travel time.…”
Section: Problem Description and Literature Reviewmentioning
confidence: 99%
“…In [9] authors propose branch-and-bound and tabu search algorithm to solve the optimal routing problem. In [10] authors use either travel time or energy consumption as criteria to determine an appropriate route for transporting shipments.…”
Section: Problem Description and Literature Reviewmentioning
confidence: 99%
“…Źródło: opracowanie własne na podstawie [Chiang, Chen, Wu 2005]. pobraniu ostatniego towaru w alejce konieczne jest podjęcie decyzji, czy powrócić do dolnego korytarza głównego, czy przejść do górnego korytarza głównego. Wybierana jest opcja bardziej korzystna.…”
Section: Rys 7 Heurystyka Combinedunclassified