نوع مقاله : یادداشت فنی
نویسندگان
1 دانشکده مهندسی عمران، دانشگاه صنعتی شریف
2 مؤسسه عالی آموزش و پژوهش مدیریت و برنامه ریزی
چکیده
کلیدواژهها
موضوعات
عنوان مقاله [English]
نویسندگان [English]
The traditional network design problem tries to increase surplus benefits of users over long-term period or increase the reliability of the system in short-term period. An implied assumption of most these studies is that all projects are selected and implemented in a short period of time and budget limitations are only considered within that short time. This assumption is not a valid assumption for some real transportation projects. It is more appropriate to consider the fluctuations in demand over long-term period. Demand for transportation infrastructures does not only change with time, but is also influenced by variations in supply. Transportation projects usually consist of several components that are continually implemented and operated during the projects' life cycle. The benefits and costs of operation of different parts of the projects at different times should be considered in project evaluation. This paper deals with formulating and solving the Multi-Period Network Design Problem (MPNDP). MPNDP is a variation of the Network Design Problem (NDP) which inserts timing into the problem. The model's outputs are the optimum set of projects and the optimal scheduling of the projects simultaneously.MPNDPs are complex problems, not only due to their large sizes, but also due to interdependency of costs and benefits among projects. In terms of difficulty of solving, they fall within the category of NP-hard problems. In this paper, two heuristic methods, which are based on steepest descent and Tabu search, are offered to solve the problem.In the solution procedures of both methods, three interdependent matrices track the annual projects progress, the annual projects' budget assignments, and the available projects.The results of our study show that while the steepest descent method provides more robust solutions than the Tabu based search method for smaller-sized problems, it fails to find solutions to large-sized problems. The Tabu search's relative performance increases as the size of the problem increases; Therefore, it is recommended for solving large networks. The performance of the model and the solution techniques are tested on the Sioux Falls City network which is a mid-sized network.
کلیدواژهها [English]
)