batching orders in warehouses by minimizing travel distance with genetic algorithms chih-ming hsu,...

29
Batching orders in ware houses by minimizing tr avel distance with genetic a lgorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

Post on 21-Dec-2015

219 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

Batching orders in warehouses by minimizing travel

distance with genetic algorithms

Chih-Ming Hsu, Kai-Ying Chen &Mu-Chen Chen

Page 2: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

Introduction (1/4)Introduction (1/4)

訂單撿貨訂單撿貨 (order picking)(order picking) 存貨政策存貨政策 (storage policy)(storage policy)

撿貨路徑撿貨路徑 (picking routing)(picking routing)

批次撿貨批次撿貨 (order batching)(order batching)

Page 3: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

Introduction(2/4)Introduction(2/4)

批次檢貨批次檢貨AS/RSAS/RS

先選擇一種子訂單,再逐步加入其他訂單到該批次先選擇一種子訂單,再逐步加入其他訂單到該批次中,直到無法再加入訂單為止中,直到無法再加入訂單為止

人工檢貨人工檢貨距離矩陣距離矩陣總檢取距離最小總檢取距離最小

Page 4: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

Introduction(3/4)Introduction(3/4)

Page 5: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

Introduction(4/4)Introduction(4/4)

AS/RSAS/RS 作業特性與人工檢貨不同作業特性與人工檢貨不同 AS/RSAS/RS 之批量方法不適合人工檢貨之批量方法不適合人工檢貨

距離矩陣法距離矩陣法 只適用於只適用於 2D2D 的倉儲設施規劃的倉儲設施規劃

總撿取距離最小總撿取距離最小 會隨著設施規劃及批量形式不同而改變, 難求取最佳解會隨著設施規劃及批量形式不同而改變, 難求取最佳解

Page 6: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

定義染色體表示法

產生起始母群體

計算適合度

選擇交配母群體

交配 & 修補

存活機制

新母群體

突變停止 ?

停止

Page 7: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

實驗設計與假設實驗設計與假設 (1/2)(1/2)

實驗假設實驗假設 所有訂單已知所有訂單已知 同張訂單不可拆開到不同批次,且所有單一訂同張訂單不可拆開到不同批次,且所有單一訂

單中的數量不超過存檢設備負載量單中的數量不超過存檢設備負載量 場站位於倉庫右下角場站位於倉庫右下角 撿貨人員能同時撿取左右貨架之貨品撿貨人員能同時撿取左右貨架之貨品 撿貨設備於窄巷中能做雙向的移動撿貨設備於窄巷中能做雙向的移動 撿貨人員使用撿貨人員使用 S-shapeS-shape 的移動策略的移動策略

Page 8: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

實驗設計與假設實驗設計與假設 (2/2)(2/2)

Page 9: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

績效研究與比較績效研究與比較 (2D) (2D)

GABMGABM

Gibson & Sharp (GSBM)Gibson & Sharp (GSBM)

First-Come-First-Serve (FCFS)First-Come-First-Serve (FCFS)

Page 10: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

績效研究與比較績效研究與比較 (2D)(2D)

Page 11: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

績效研究與比較績效研究與比較 (2D)(2D)

批量數批量數

Page 12: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

績效研究與比較績效研究與比較 (2D)(2D)

工作量的平衡工作量的平衡

Page 13: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

績效研究與比較績效研究與比較 (2D)(2D)

總移動距離總移動距離

Page 14: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

績效研究與比較績效研究與比較 (2D)(2D)

計算時間計算時間

Page 15: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

績效研究與比較績效研究與比較 (3D)(3D)

GASMGASM

FCFSFCFS

Page 16: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

績效研究與比較績效研究與比較 (3D)(3D)

Page 17: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

績效研究與比較績效研究與比較 (3D)(3D)

批量數批量數

Page 18: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

績效研究與比較績效研究與比較 (3D)(3D)

工作量的平衡工作量的平衡

Page 19: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

績效研究與比較績效研究與比較 (3D)(3D)

總移動距離總移動距離

Page 20: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

績效研究與比較績效研究與比較 (3D)(3D)

計算時間計算時間

Page 21: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

結論結論 GABMGABM 除了在主要的績效指標,也就是總除了在主要的績效指標,也就是總

移動距離上具有良好的績效外,在其他各移動距離上具有良好的績效外,在其他各種績效指標也有良好的表現種績效指標也有良好的表現

而在計算時間方面,由於實務上訂單分批而在計算時間方面,由於實務上訂單分批的作業通常再撿取前一天完成,故的作業通常再撿取前一天完成,故 GABMGABM還是能利用於現實生活的作業上還是能利用於現實生活的作業上

Page 22: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

ENDEND

Page 23: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

染色體編碼染色體編碼

(1,2,3,2,1,3)(1,2,3,2,1,3)

第一與第五張定單在第一批次第一與第五張定單在第一批次

第二與第四張定單在第二批次第二與第四張定單在第二批次

第三與第六張定單在第三批次第三與第六張定單在第三批次

Page 24: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

適合度函數適合度函數

Fitness(i)=Distance(L) - Distance(i)Fitness(i)=Distance(L) - Distance(i)

Distance(L): Distance(L): 目前所有可行解目前所有可行解 (( 染色體染色體 )) 中,中,

距離最長者的移動距離距離最長者的移動距離

Distance(i): Distance(i): 染色體染色體 (i)(i) 的移動距離的移動距離

Page 25: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

交配法則交配法則

雙點交配法雙點交配法 (( 交配率交配率 0.6)0.6)

Page 26: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

修補修補

Page 27: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

突變突變

配對交換配對交換 (( 突變率突變率 0.05)0.05)

Page 28: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

存活機制存活機制

Pro_base = 0.05Pro_base = 0.05 Rank(i): Rank(i): 目前所有染色體在依適合度由大到目前所有染色體在依適合度由大到 小排序後,第小排序後,第 ii 組染色體的排行組染色體的排行

Page 29: Batching orders in warehouses by minimizing travel distance with genetic algorithms Chih-Ming Hsu, Kai-Ying Chen & Mu-Chen Chen

停止準則停止準則

最大迭代數最大迭代數 =500=500

連續連續 4040 迭代沒有改進迭代沒有改進