2008
DOI: 10.1016/j.cie.2007.12.018
|View full text |Cite
|
Sign up to set email alerts
|

Order-batching methods for an order-picking warehouse with two cross aisles

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
54
0
3

Year Published

2010
2010
2021
2021

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 93 publications
(57 citation statements)
references
References 35 publications
0
54
0
3
Order By: Relevance
“…Examples of criteria according to which this "distance" can be determined are the number of additional aisles to be visited, the difference between the centers of gravity of the order and the seed, or the sum of the travel distance between every item of the order to the closest item in the seed. An overview of the various seed selection and order congruency rules is given by de Koster, van der Poort, and Wolters (1999), Ho and Tseng (2006) and Ho, Su, and Shi (2008). Savings algorithms are based on the Clarke-andWright Algorithm for the Vehicle Routing Problem (Clarke and Wright 1964) and have been adapted in several ways for the Order Batching Problem.…”
Section: Review Of Solution Approachesmentioning
confidence: 99%
“…Examples of criteria according to which this "distance" can be determined are the number of additional aisles to be visited, the difference between the centers of gravity of the order and the seed, or the sum of the travel distance between every item of the order to the closest item in the seed. An overview of the various seed selection and order congruency rules is given by de Koster, van der Poort, and Wolters (1999), Ho and Tseng (2006) and Ho, Su, and Shi (2008). Savings algorithms are based on the Clarke-andWright Algorithm for the Vehicle Routing Problem (Clarke and Wright 1964) and have been adapted in several ways for the Order Batching Problem.…”
Section: Review Of Solution Approachesmentioning
confidence: 99%
“…Sipariş gruplama toplayıcıların yolculuk uzaklığını minimize etmek için depolarda kullanılan metotlardan biridir. Çalışmada, iki koridorlu ve köşelerin birinde I/O noktası olan bir sipariş toplama deposu için sipariş gruplama metotları üzerinde odaklanılmıştır [19].…”
Section: Sipariş Toplama Politikalarına İlişkin Literatür Araştırmasıunclassified
“…An initial order (seed) is chosen for a batch in selection phase, afterwards unsigned customer orders are added to the seed according to an order-congruency rule in matching phase. The methods related to selection of seed order and order-congruency rule is considered by To & Tseng et al [2,3]. Saving algorithm is based on the algorithm introduced by Clarke and Wright [4] in 1964 which has been applied in several ways for order batching problem.…”
Section: A Classical Algorithmsmentioning
confidence: 99%