Solution of preemptive multi-objective network design problems applying Benders decomposition method

Ashkan Fakhri () and Mehdi Ghatee

Annals of Operations Research, 2013, vol. 210, issue 1, 295-307

Abstract: This paper deals with preemptive priority based multi-objective network design problems in which construction times together with travel costs are taken into account. These cost and time objective functions are ordered lexicographically with respect to manager’s strategies in order to decrease total cost and total construction time of the network. To solve this preemptive problem, instead of the standard sequential approach, a modified Benders decomposition algorithm is developed. It is proved that this algorithm decreases the (expected) number of computations and so this algorithm is efficient for large-scale network design problems. Copyright Springer Science+Business Media New York 2013

Keywords: Benders decomposition; Mixed-integer programming; Multi-objective; Network design; Preemptive (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-013-1353-0 (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: https://EconPapers.repec.org/RePEc:spr:annopr:v:210:y:2013:i:1:p:295-307:10.1007/s10479-013-1353-0

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

DOI: 10.1007/s10479-013-1353-0

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 ().