loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Amirali Zarrinmehr and Yousef Shafahi

Affiliation: Sharif University of Technology, Iran, Islamic Republic of

ISBN: 978-989-758-075-8

Keyword(s): Transportation Network Design Problem, Parallel Branch-and-Bound Algorithm, Depth-First-Search, Greedy Algorithm, Super-linear Speedup.

Related Ontology Subjects/Areas/Topics: Applications ; Network Optimization ; Operational Research ; OR in Transportation ; Pattern Recognition ; Software Engineering

Abstract: 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. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 34.229.131.116

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Zarrinmehr, A. and Shafahi, Y. (2015). Accelerating the Performance of Parallel Depth-First-Search Branch-and-Bound Algorithm in Transportation Network Design Problem.In Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-075-8, pages 359-366. DOI: 10.5220/0005220103590366

@conference{icores15,
author={Amirali Zarrinmehr. and Yousef Shafahi.},
title={Accelerating the Performance of Parallel Depth-First-Search Branch-and-Bound Algorithm in Transportation Network Design Problem},
booktitle={Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2015},
pages={359-366},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005220103590366},
isbn={978-989-758-075-8},
}

TY - CONF

JO - Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Accelerating the Performance of Parallel Depth-First-Search Branch-and-Bound Algorithm in Transportation Network Design Problem
SN - 978-989-758-075-8
AU - Zarrinmehr, A.
AU - Shafahi, Y.
PY - 2015
SP - 359
EP - 366
DO - 10.5220/0005220103590366

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.