網路規劃應用於多塔吊計劃之最佳化

碩士 === 國立中興大學 === 土木工程學系 === 90 === In high-rise building construction, the operation of tower crane has been the critical activity, and quite often causes schedule delay. The tower crane planning involves a large solution space among which it is difficult to search for an optimal soluti...

Full description

Bibliographic Details
Main Authors: Yueh Feng Ho, 何岳峰
Other Authors: Machine Hsie
Format: Others
Language:zh-TW
Published: 2002
Online Access:http://ndltd.ncl.edu.tw/handle/52638871908137589324
id ndltd-TW-090NCHU0015087
record_format oai_dc
spelling ndltd-TW-090NCHU00150872016-06-27T16:09:32Z http://ndltd.ncl.edu.tw/handle/52638871908137589324 網路規劃應用於多塔吊計劃之最佳化 Yueh Feng Ho 何岳峰 碩士 國立中興大學 土木工程學系 90 In high-rise building construction, the operation of tower crane has been the critical activity, and quite often causes schedule delay. The tower crane planning involves a large solution space among which it is difficult to search for an optimal solution. This study thoroughly reviewed the previous researches which could be categorized into three groups including 1) exhausted search, 2) graphical judgment, and 3) genetic algorithm. However the previous researches have drawbacks. This research proposes a new approach called Tower-crane Optimization Model (TOM) to assist the planning of tower crane. The TOM decides the optimal location to install tower crane(s), and calculates the amount of materials the demand spots should be fed by the supply spots. The TOM searches the feasible minimal time of operation, which is usually called fitness value, to achieve the optimal design of tower crane planning. The Network Programming Algorithm is adopted. The upper bond capacities of supply spots and the lower bond minimal requirements of demand spots are the constrain functions. To sum up, the TOM outperforms the previous researches in 4 respects, which are 1) analytical solution, 2) high efficiency in term of computing time, 3) extension to multiple sets of tower cranes, and 4) providing detailed delivery plan between demand spots and supply spots. Machine Hsie 謝孟勳 2002 學位論文 ; thesis 0 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立中興大學 === 土木工程學系 === 90 === In high-rise building construction, the operation of tower crane has been the critical activity, and quite often causes schedule delay. The tower crane planning involves a large solution space among which it is difficult to search for an optimal solution. This study thoroughly reviewed the previous researches which could be categorized into three groups including 1) exhausted search, 2) graphical judgment, and 3) genetic algorithm. However the previous researches have drawbacks. This research proposes a new approach called Tower-crane Optimization Model (TOM) to assist the planning of tower crane. The TOM decides the optimal location to install tower crane(s), and calculates the amount of materials the demand spots should be fed by the supply spots. The TOM searches the feasible minimal time of operation, which is usually called fitness value, to achieve the optimal design of tower crane planning. The Network Programming Algorithm is adopted. The upper bond capacities of supply spots and the lower bond minimal requirements of demand spots are the constrain functions. To sum up, the TOM outperforms the previous researches in 4 respects, which are 1) analytical solution, 2) high efficiency in term of computing time, 3) extension to multiple sets of tower cranes, and 4) providing detailed delivery plan between demand spots and supply spots.
author2 Machine Hsie
author_facet Machine Hsie
Yueh Feng Ho
何岳峰
author Yueh Feng Ho
何岳峰
spellingShingle Yueh Feng Ho
何岳峰
網路規劃應用於多塔吊計劃之最佳化
author_sort Yueh Feng Ho
title 網路規劃應用於多塔吊計劃之最佳化
title_short 網路規劃應用於多塔吊計劃之最佳化
title_full 網路規劃應用於多塔吊計劃之最佳化
title_fullStr 網路規劃應用於多塔吊計劃之最佳化
title_full_unstemmed 網路規劃應用於多塔吊計劃之最佳化
title_sort 網路規劃應用於多塔吊計劃之最佳化
publishDate 2002
url http://ndltd.ncl.edu.tw/handle/52638871908137589324
work_keys_str_mv AT yuehfengho wǎnglùguīhuàyīngyòngyúduōtǎdiàojìhuàzhīzuìjiāhuà
AT héyuèfēng wǎnglùguīhuàyīngyòngyúduōtǎdiàojìhuàzhīzuìjiāhuà
_version_ 1718325306915291136