交流道平面近似線形最佳化模式
碩士 === 國立成功大學 === 土木工程學系 === 89 === The process of highway geometric design is complicated, requires enormous computing work, and is labor, time, and cost consuming. This is especially true for the ramps of an interchange. In additional to code requirements on individual alignments, man...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2001
|
Online Access: | http://ndltd.ncl.edu.tw/handle/51187917928872239662 |
id |
ndltd-TW-089NCKU0015080 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-089NCKU00150802016-07-06T04:11:05Z http://ndltd.ncl.edu.tw/handle/51187917928872239662 交流道平面近似線形最佳化模式 孫沁芬 碩士 國立成功大學 土木工程學系 89 The process of highway geometric design is complicated, requires enormous computing work, and is labor, time, and cost consuming. This is especially true for the ramps of an interchange. In additional to code requirements on individual alignments, many complicated restrictions apply as multiple ramps share a common 3-dimensional space. In this research we analyze the geometric relationships and constraints between the ramps for various interchange types. Mathematical methods are then used to develop a model to describe the horizontal alignment of an interchange. Line segments are used as a surrogate for curves. The goal is to minimize any weighted combination of the land used, amount of construction, and total length of ramps. Constraints considered include code requirements, appearance, and the connection or overpassing between ramps. A code written in C language that utilizes the Threshold Accepting Heuristic is developed to solve the model. Five numerical examples are provided in the thesis to demonstrate the model under different parameters as well as different considerations. Testing results indicate that the model can correctively solve for an approximate alignment for interchanges, and the output can be used as a first draft for highway engineers. 李宇欣 2001 學位論文 ; thesis 114 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立成功大學 === 土木工程學系 === 89 === The process of highway geometric design is complicated, requires enormous computing work, and is labor, time, and cost consuming. This is especially true for the ramps of an interchange. In additional to code requirements on individual alignments, many complicated restrictions apply as multiple ramps share a common 3-dimensional space.
In this research we analyze the geometric relationships and constraints between the ramps for various interchange types. Mathematical methods are then used to develop a model to describe the horizontal alignment of an interchange. Line segments are used as a surrogate for curves. The goal is to minimize any weighted combination of the land used, amount of construction, and total length of ramps. Constraints considered include code requirements, appearance, and the connection or overpassing between ramps. A code written in C language that utilizes the Threshold Accepting Heuristic is developed to solve the model. Five numerical examples are provided in the thesis to demonstrate the model under different parameters as well as different considerations.
Testing results indicate that the model can correctively solve for an approximate alignment for interchanges, and the output can be used as a first draft for highway engineers.
|
author2 |
李宇欣 |
author_facet |
李宇欣 孫沁芬 |
author |
孫沁芬 |
spellingShingle |
孫沁芬 交流道平面近似線形最佳化模式 |
author_sort |
孫沁芬 |
title |
交流道平面近似線形最佳化模式 |
title_short |
交流道平面近似線形最佳化模式 |
title_full |
交流道平面近似線形最佳化模式 |
title_fullStr |
交流道平面近似線形最佳化模式 |
title_full_unstemmed |
交流道平面近似線形最佳化模式 |
title_sort |
交流道平面近似線形最佳化模式 |
publishDate |
2001 |
url |
http://ndltd.ncl.edu.tw/handle/51187917928872239662 |
work_keys_str_mv |
AT sūnqìnfēn jiāoliúdàopíngmiànjìnshìxiànxíngzuìjiāhuàmóshì |
_version_ |
1718339138200010752 |