Discrete Network Design Using Parallel Branch-and-Bound Algorithms<br/>

Please enable javascript in your browser.

Discrete Network Design Using Parallel Branch-and-Bound Algorithms

854 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 42660 (09)
University: Sharif University of Technology
Department: Civil Engineering
Advisor(s): hafahi, Yusof
Abstract:
Discrete Network Design (DND) is a classical combinatorial problem in transportation planning. According to its exponential nature, the problem has a costly exact solution. In recent decades, however, the advent of parallel computing facilities motivated researchers to apply exact solutions on many combinatorial problems. As a result, parallel Branch-and-Bound (B&B) algorithms emerged as robust methods to address combinatorial problems. This dissertation will investigate the parallel behavior of B&B algorithms in DND through some case studies. Parallelization results suggest that parallel B&B algorithms can achieve linear speed-ups in DND for a large number of processors
Keywords:
Combinatorial Problem ; Parallel Processing ; Discrete Network Design problem ; Parallel Branch-and-Bound Algorithm

No TOC