Browsing by Author "Kuo, Yi-Ming"

Now showing 1 - 3 of 3

A transportation programming model considering project interdependency and regional balance
(2013-11-01)
Huang, Kuancheng
;
Kuo, Yi-Ming
;
運輸與物流管理系註：原交通所+運管所
;
Department of Transportation and Logistics Management
Transportation Programming (TP) plays an important role in the development of the infrastructure of a country. Given the limited budget, it is a challenging decision to select the projects to be funded and implemented from the numerous options. The problem is complicated by the fact that some of the potential projects are interdependent. The benefit (and/or the cost) of the joint project combining multiple projects can be different from the sum of the benefits (and/or the costs) if the associated projects are implemented separately. Besides, some projects cannot be selected at the same time as they are incompatible or exclusive to each other by nature. The typical examples are the projects utilizing the same resource, such as a piece of land. In addition, much more attention nowadays is paid to the fairness of budget allocation and the balance of regional development as the society becomes more democratic and diversified. Thus, in order to address the equity issue and the political feasibility, a new integer programming (IP) model based on the set covering problem (SCP) has been proposed to ensure that the regional balance issue is addressed. This SCP-based model, with the constraints taking into account the budget limitation and the projects' mutual exclusivity, is transformed into a linear programming (LP) model by Lagrangian Relaxation (LR). The key theme of this study is then to design the solution algorithm that can efficiently adjust the LP multipliers and find the feasible solutions so as to achieve a high-quality approximate solution within an acceptable computation time. Finally, a numerical experiment that can reflect the practical situations is performed to validate the applicability of the developed model and solution algorithm. (C) 2013 Elsevier Ltd. All rights reserved.
A transportation programming model considering project interdependency and regional balance
(2013-01-01)
Huang, Kuancheng
;
Kuo, Yi-Ming
;
運輸與物流管理系註：原交通所+運管所
;
Department of Transportation and Logistics Management
Transportation Programming (TP) plays an important role in the development of the infrastructure of a country. Given the limited budget, it is a challenging decision to select the projects to be funded and implemented from the numerous options. The problem is complicated by the fact that some of the potential projects are interdependent. The benefit (and/or the cost) of the joint project combining multiple projects can be different from the sum of the benefits (and/or the costs) if the associated projects are implemented separately. Besides, some projects cannot be selected at the same time as they are incompatible or exclusive to each other by nature. The typical examples are the projects utilizing the same resource, such as a piece of land. In addition, much more attention nowadays is paid to the fairness of budget allocation and the balance of regional development as the society becomes more democratic and diversified. Thus, in order to address the equity issue and the political feasibility, a new integer programming (IP) model based on the set covering problem (SCP) has been proposed to ensure that the regional balance issue is addressed. This SCP-based model, with the constraints taking into account the budget limitation and the projects' mutual exclusivity, is transformed into a linear programming (LP) model by Lagrangian Relaxation (LR). The key theme of this study is then to design the solution algorithm that can efficiently adjust the LP multipliers and find the feasible solutions so as to achieve a high-quality approximate solution within an acceptable computation time. Finally, a numerical experiment that can reflect the practical situations is performed to validate the applicability of the developed model and solution algorithm. (C) 2013 The Authors. Published by Elsevier Ltd.
High Recharge Areas in the Choushui River Alluvial Fan (Taiwan) Assessed from Recharge Potential Analysis and Average Storage Variation Indexes
(2015-04-01)
Tsai, Jui-Pin
;
Chen, Yu-Wen
;
Chang, Liang-Cheng
;
Kuo, Yi-Ming
;
Tu, Yu-Hsuan
High recharge areas significantly influence the groundwater quality and quantity in regional groundwater systems. Many studies have applied recharge potential analysis (RPA) to estimate groundwater recharge potential (GRP) and have delineated high recharge areas based on the estimated GRP. However, most of these studies define the RPA parameters with supposition, and this represents a major source of uncertainty for applying RPA. To objectively define the RPA parameter values without supposition, this study proposes a systematic method based on the theory of parameter identification. A surrogate variable, namely the average storage variation (ASV) index, is developed to calibrate the RPA parameters, because of the lack of direct GRP observations. The study results show that the correlations between the ASV indexes and computed GRP values improved from 0.67 before calibration to 0.85 after calibration, thus indicating that the calibrated RPA parameters represent the recharge characteristics of the study area well; these data also highlight how defining the RPA parameters with ASV indexes can help to improve the accuracy. The calibrated RPA parameters were used to estimate the GRP distribution of the study area, and the GRP values were graded into five levels. High and excellent level areas are defined as high recharge areas, which composed 7.92% of the study area. Overall, this study demonstrates that the developed approach can objectively define the RPA parameters and high recharge areas of the Choushui River alluvial fan, and the results should serve as valuable references for the Taiwanese government in their efforts to conserve the groundwater quality and quantity of the study area.