完整後設資料紀錄
DC 欄位語言
dc.contributor.authorHuang, Kuanchengen_US
dc.contributor.authorKuo, Yi-Mingen_US
dc.date.accessioned2014-12-08T15:33:37Z-
dc.date.available2014-12-08T15:33:37Z-
dc.date.issued2013-11-01en_US
dc.identifier.issn0968-090Xen_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.trc.2013.06.017en_US
dc.identifier.urihttp://hdl.handle.net/11536/23283-
dc.description.abstractTransportation 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.en_US
dc.language.isoen_USen_US
dc.subjectTransportation programmingen_US
dc.subjectSet covering problemen_US
dc.subjectLagrangian Relaxationen_US
dc.subjectHeuristicsen_US
dc.titleA transportation programming model considering project interdependency and regional balanceen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.trc.2013.06.017en_US
dc.identifier.journalTRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIESen_US
dc.citation.volume36en_US
dc.citation.issueen_US
dc.citation.spage395en_US
dc.citation.epage405en_US
dc.contributor.department運輸與物流管理系 註:原交通所+運管所zh_TW
dc.contributor.departmentDepartment of Transportation and Logistics Managementen_US
dc.identifier.wosnumberWOS:000327912800030-
dc.citation.woscount0-
顯示於類別:期刊論文


文件中的檔案:

  1. 000327912800030.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。