A dynamic discrete network design problem for maintenance planning in traffic networks

Pirmin Fontaine () and Stefan Minner
Additional contact information
Pirmin Fontaine: Technical University of Munich

Annals of Operations Research, 2017, vol. 253, issue 2, No 4, 757-772

Abstract: Abstract We propose a dynamic model for network maintenance planning by extending the Discrete Network Design Problem. The leader decides which road in the network is maintained in which period and the follower, as in the Discrete Network Design Problem, optimizes its own path through the network. The non-linear bilevel problem is first linearized and then transformed into a single-level mixed-integer program by using the Karush–Kuhn–Tucker conditions. This model is solved with Benders Decomposition. The numerical study shows that this method finds better solutions faster compared to solving the mixed-integer formulation directly and using a genetic algorithm. Furthermore, we show the benefit of this approach compared to simple greedy heuristics.

Keywords: Dynamic discrete network design problem; Bilevel programming; Benders decomposition (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-016-2171-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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: https://EconPapers.repec.org/RePEc:spr:annopr:v:253:y:2017:i:2:d:10.1007_s10479-016-2171-y

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-016-2171-y

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().