http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Seungyong Cho(조승용),Hoyoung Chang(장호영),Kyungil Choe(최경일) 한국SCM학회 2011 한국SCM학회지 Vol.11 No.2
For aisle-based order picking systems the travelling times of pickers are crucial to the productivity of the whole system. We consider two aisle routing policies: the graph optimization algorithm (GOA) and the ant colony optimization (ACO) heuristic. The GOA gives an optimal tour but needs to be changed depending on the layout of aisles. On the other hand, the ACO heuristic may not yield optimal tours but turns out to be effective and flexible. Comparing two methods by real data, our ACO heuristic can generate fairly good solutions within a few seconds.