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

By Ashkan Fakhri, & Mehdi Ghatee

Published: Annals of Operations Research volume 210, pages295–307(2013).


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.

Leave a comment

Your email address will not be published. Required fields are marked *