![](images/graphics/blank.gif)
Optimal dynamic routing for 2 forklifts in narrow-aisle racking warehouse
18
lượt xem 3
download
lượt xem 3
download
![](https://tailieu.vn/static/b2013az/templates/version1/default/images/down16x21.png)
This paper contribute by constructing an algorithm base on dynamic routing strategy to solve the problem. Storage location is determine by the Closest Open Location algorithm - COL and collision is solved through the time windows concept.
Chủ đề:
Bình luận(0) Đăng nhập để gửi bình luận!
![](images/graphics/blank.gif)
CÓ THỂ BẠN MUỐN DOWNLOAD