Loading...

Accelerating the performance of parallel depth-first-search branch-and-bound algorithm in transportation network design problem

Zarrinmehr, A ; Sharif University of Technology | 2015

1161 Viewed
  1. Type of Document: Article
  2. Publisher: SciTePress , 2015
  3. Abstract:
  4. Transportation Network Design Problem (TNDP) aims at selection of a subset of proposed urban projects in budget constraint to minimize the network users' total travel time. This is a well-known resource-intensive problem in transportation planning literature. Application of parallel computing, as a result, can be useful to address the exact solution of TNDP. This paper is going to investigate how the performance of a parallel Branch-and-Bound (B&B) algorithm with Depth-First-Search (DFS) strategy can be accelerated. The paper suggests assigning greedy solutions to idle processors at the start of the algorithm. A greedy solution, considered in this paper, is a budget-wise feasible selection of projects to which no further project can be added while holding the budget constraint. The paper evaluates the performance of parallel algorithms through the theoretical speedup and efficiency which are based on the number of parallel B&B iterations. It is observed, in four cases of TNDP in Sioux-Falls transportation network, that achieving high-quality solutions by idle processors can notably improve the performance of parallel DFS B&B algorithm. In all four cases, super-linear speedups are reported
  5. Keywords:
  6. Parallel Branch-and-Bound Algorithm ; Super-linear Speedup ; Transportation Network Design Problem ; Algorithms ; Branch and bound method ; Budget control ; Integrated circuit design ; Operations research ; Parallel processing systems ; Transportation ; Travel time ; Depth first search ; Greedy algorithms ; Linear speed-up ; Parallel branch and bounds ; Transportation network ; Urban transportation
  7. Source: ICORES 2015 - 4th International Conference on Operations Research and Enterprise Systems, Proceedings, 10 January 2015 through 12 January 2015 ; January , 2015 , Pages 359-366 ; 9789897580758 (ISBN)
  8. URL: https://www.semanticscholar.org/paper/Accelerating-the-Performance-of-Parallel-Depth-Zarrinmehr-Shafahi/4912e99f168832253d9959d70c876312cc05c1c7