A Study on the Order Picking Policies in Automated Storage/Retrieval System by Genetic Algorithm
碩士 === 元智大學 === 工業工程研究所 === 86 === Order picking policies play an important role in automated storage/retrieval system (AS/RS), and the exact planning can also reduce operational costs of AS/RS. This study integrates the order batching and route planning problems in...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Online Access: | http://ndltd.ncl.edu.tw/handle/58765533806045361690 |
id |
ndltd-TW-086YZU00030021 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-086YZU000300212015-10-13T17:34:50Z http://ndltd.ncl.edu.tw/handle/58765533806045361690 A Study on the Order Picking Policies in Automated Storage/Retrieval System by Genetic Algorithm 遺傳演算法應用於自動倉儲系統撿取作業之規劃 Jiunn-Ching Liang 梁俊卿 碩士 元智大學 工業工程研究所 86 Order picking policies play an important role in automated storage/retrieval system (AS/RS), and the exact planning can also reduce operational costs of AS/RS. This study integrates the order batching and route planning problems in a man-on-board(MOB) warehousing system. To obtain a better order picking policy, this study searches for a goal solution (or near optimum) by genetic algorithm rather than traditional local searches. An experimental design was made to analyze some design parameters of the genetic algorithm for the order batching and routing planning problem. This results show that the factors of the population size and generations are significant in both solution quality and efficiency in this study. Michael H. Hu 胡黃德 學位論文 ; thesis 65 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 元智大學 === 工業工程研究所 === 86 === Order picking policies play an important role in automated
storage/retrieval system (AS/RS), and the exact planning can
also reduce operational costs of AS/RS. This study integrates
the order batching and route planning problems in a man-on-board(MOB) warehousing system. To obtain a better order
picking policy, this study searches for a goal solution
(or near optimum) by genetic algorithm rather than traditional
local searches. An experimental design was made to analyze some
design parameters of the genetic algorithm for the order
batching and routing planning problem. This results show that
the factors of the population size and generations are
significant in both solution quality and efficiency in this
study.
|
author2 |
Michael H. Hu |
author_facet |
Michael H. Hu Jiunn-Ching Liang 梁俊卿 |
author |
Jiunn-Ching Liang 梁俊卿 |
spellingShingle |
Jiunn-Ching Liang 梁俊卿 A Study on the Order Picking Policies in Automated Storage/Retrieval System by Genetic Algorithm |
author_sort |
Jiunn-Ching Liang |
title |
A Study on the Order Picking Policies in Automated Storage/Retrieval System by Genetic Algorithm |
title_short |
A Study on the Order Picking Policies in Automated Storage/Retrieval System by Genetic Algorithm |
title_full |
A Study on the Order Picking Policies in Automated Storage/Retrieval System by Genetic Algorithm |
title_fullStr |
A Study on the Order Picking Policies in Automated Storage/Retrieval System by Genetic Algorithm |
title_full_unstemmed |
A Study on the Order Picking Policies in Automated Storage/Retrieval System by Genetic Algorithm |
title_sort |
study on the order picking policies in automated storage/retrieval system by genetic algorithm |
url |
http://ndltd.ncl.edu.tw/handle/58765533806045361690 |
work_keys_str_mv |
AT jiunnchingliang astudyontheorderpickingpoliciesinautomatedstorageretrievalsystembygeneticalgorithm AT liángjùnqīng astudyontheorderpickingpoliciesinautomatedstorageretrievalsystembygeneticalgorithm AT jiunnchingliang yíchuányǎnsuànfǎyīngyòngyúzìdòngcāngchǔxìtǒngjiǎnqǔzuòyèzhīguīhuà AT liángjùnqīng yíchuányǎnsuànfǎyīngyòngyúzìdòngcāngchǔxìtǒngjiǎnqǔzuòyèzhīguīhuà AT jiunnchingliang studyontheorderpickingpoliciesinautomatedstorageretrievalsystembygeneticalgorithm AT liángjùnqīng studyontheorderpickingpoliciesinautomatedstorageretrievalsystembygeneticalgorithm |
_version_ |
1717781666803482624 |