Economics at your fingertips  

A Branch and Bound Algorithm for Bi-level Discrete Network Design Problem

Hamid Farvaresh and Mohammad Sepehri ()

Networks and Spatial Economics, 2013, vol. 13, issue 1, 67-106

Abstract: Discrete network design problem (DNDP) is generally formulated as a bi-level programming. Because of non-convexity of bi-level formulation of DNDP which stems from the equilibrium conditions, finding global optimal solutions are very demanding. In this paper, a new branch and bound algorithm being able to find exact solution of the problem is presented. A lower bound for the upper-level objective and its computation method are developed. Numerical experiments show that our algorithm is superior to previous algorithms in terms of both computation time and solution quality. The conducted experiments indicate that in most cases the first incumbent solution which is obtained within a few seconds is superior to the final solution of some of previous algorithms. Copyright Springer Science+Business Media, LLC 2013

Keywords: Network design problem; Bi-level programming; Branch and bound; Outer approximation (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (14) Track citations by RSS feed

Downloads: (external link) (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link:

Ordering information: This journal article can be ordered from
http://www.springer. ... ce/journal/11067/PS2

Access Statistics for this article

Networks and Spatial Economics is currently edited by Terry L. Friesz

More articles in Networks and Spatial Economics from Springer
Bibliographic data for series maintained by Sonal Shukla ().

Page updated 2019-05-15
Handle: RePEc:kap:netspa:v:13:y:2013:i:1:p:67-106