TY - JOUR
ID - 6302
TI - Enumeration of Dominant Solutions: An Application in Transport Network Design
JO - International Journal of Transportation Engineering
JA - IJTE
LA - en
SN - 2322-259X
AU - Zarrinmehr, Amirali
AU - Shafahi, Yousef
AD - MSc. Graduate, Department of Civil Engineering, Sharif University of Technology, Tehran, Iran
AD - Professor, Department of Civil Engineering, Sharif University of Technology, Tehran, Iran
Y1 - 2014
PY - 2014
VL - 1
IS - 4
SP - 335
EP - 348
KW - Enumeration
KW - Dominant Solution
KW - Branch-and-Bound Algorithm
KW - Network Design Problem
DO - 10.22119/ijte.2014.6302
N2 - A One-Dimensional Binary Integer Programming Problem (1DB-IPP) is concerned with selecting a subset from a set of k items in budget constraint to optimize an objective function. In this problem a dominant solution is defined as a feasible selection to which no further item could be added in budget constraint. This paper presents a simple algorithm for Enumeration of Dominant Solutions (EDS) and investigates its functionality. The algorithm is then applied on the formulation of the Network Design Problem (NDP) with fixed travel-time links. The problem is a case study of 1DB-IPPs in the transportation planning literature which arises in the networks where the link travel-times are not sensitive to the amount of flow. The results are reported in detail for three illustrative examples and compared with the results of the Branch-and-Bound (B&B) algorithm. These examples suggest that in lower budget levels up to 40.2, 40.3 and 27.1 percentages the EDS algorithm outperforms the B&B algorithm. However, the overall performance of the B&B algorithm is notably faster in higher budget levels.
UR - http://www.ijte.ir/article_6302.html
L1 - http://www.ijte.ir/article_6302_a76cea000fa40ae90ea0dd72afc5185a.pdf
ER -