An efficient hybrid heuristic method for prioritising large transportation projects with interdependent activities

Abstract

Transportation projects are generally large, with limited resources and highly interdependent activities. The complexities and interdependencies apparent in large transportation projects have prohibited effective application of management science and economics methods to these problems. We propose a heuristic method with several hybrid components. We formulate the problem as a Travelling Salesman Problem (TSP). A Neural Network (NN) is used to cope with the interdependency concerns. An algorithm with an iterative process is confined to search for the longest path (most benefit or most reduction in the user-time) in the NN as a solution to the TSP. The solution from each iteration step is uti..