%0 Journal Article
%T Enumeration of Dominant Solutions: An Application in Transport Network Design
%J International Journal of Transportation Engineering
%I Tarrahan Parseh Transportation Research Institute
%Z 2322-259X
%A Zarrinmehr, Amirali
%A Shafahi, Yousef
%D 2014
%\ 04/01/2014
%V 1
%N 4
%P 335-348
%! Enumeration of Dominant Solutions: An Application in Transport Network Design
%K Enumeration
%K Dominant Solution
%K Branch-and-Bound Algorithm
%K Network Design Problem
%R 10.22119/ijte.2014.6302
%X 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.
%U http://www.ijte.ir/article_6302_a76cea000fa40ae90ea0dd72afc5185a.pdf