01556558

Component

This paper deals with the problem of selecting the optimal set of transportation projects out of a given set of projects, also known as the Network Design Problem (NDP). Typical transportation projects are interdependent in their nature, which turns the problem into a very complex one. When a certain objective is sought, an exact solution of the problem is possible only by enumerating each possible project combination. Therefore, when a large set of possible combinations is involved an alternative approach must be taken. Meta-heuristic methods, which are usually used for this purpose, do not make use of the special properties of the given problem. In this paper, an alternative heuristic is proposed which considers the properties of the problem, and as a result simplifies significantly the solution process. The proposed heuristic is demonstrated for simple networks and applied for a real-size network.

This paper was sponsored by TRB committee ADB30 Transportation Network Modeling.

01550057

15-1562

English

18p

2015

Transportation Research Board 94th Annual Meeting

Digital/other

Figures; References; Tables

Heuristic methods; Optimization; Programming (Planning); Traffic assignment

Network design problem

Planning and Forecasting; Transportation (General); I72: Traffic and Transport Planning

Transportation Research Board Annual Meeting 2015 Paper #15-1562

TRIS, TRB, ATRI

Dec 30 2014 12:35PM