Skip to main content
SpringerLink
Log in

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

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Algorithm 1
Algorithm 2
Fig. 1
Fig. 2

Similar content being viewed by others

References

  • Aggarwal, A., & Floudas, C. A. (1990). A decomposition approach for global optimum search in QP, NLP and MINLP problems. Annals of Operations Research, 25(1), 119–145.

    Article  Google Scholar 

  • Alves, M. J., & Climaco, J. (2007). A review of interactive methods for multiobjective integer and mixed-integer programming. European Journal of Operational Research, 180, 99–115.

    Article  Google Scholar 

  • Bazaraa, M. S., Jarvis, J. J., & Sherali, H. D. (1990). Linear programming and network flows (2nd ed.). New York: Wiley.

    Google Scholar 

  • Bektas, T. (2012). Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing. European Journal of Operational Research, 216, 83–93.

    Article  Google Scholar 

  • Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4, 238–252.

    Article  Google Scholar 

  • Costa, A. M. (2005). A survey on Benders decomposition applied to fixed-charge network design problems. Computers & Operations Research, 32, 1429–1450.

    Article  Google Scholar 

  • Fortz, B., & Poss, M. (2009). An improved Benders decomposition applied to a multi-layer network design problem. Operations Research Letters, 37, 359–364.

    Article  Google Scholar 

  • Geoffrion, A. M. (1972). Generalized Benders decomposition. Journal of Optimization Theory and Applications, 10(4), 237–260.

    Article  Google Scholar 

  • Mahey, P., Benchakroun, A., & Boyer, F. (2001). Capacity and flow assignment of data networks by generalized Benders decomposition. Journal of Global Optimization, 20(2), 169–189.

    Article  Google Scholar 

  • Marín, Á. G., & Jaramillo, P. (2009). Urban rapid transit network design: accelerated Benders decomposition. Annals of Operations Research, 169, 35–53.

    Article  Google Scholar 

  • Muñoz, E., & Stolpe, M. (2011). Generalized Benders’ decomposition for topology optimization problems. Journal of Global Optimization, 51(1), 149–183.

    Article  Google Scholar 

  • Poojari, C. A., & Beasley, J. E. (2009). Improving Benders decomposition using a genetic algorithm. European Journal of Operational Research, 199, 89–97.

    Article  Google Scholar 

  • Rodriguez-Martin, I., & Salazar-Gonzalez, J. J. (2008). Solving a capacitated hub location problem. European Journal of Operational Research, 184, 468–479.

    Article  Google Scholar 

  • Saharidis, G. K. D., & Ierapetritou, M. G. (2010). Improving Benders decomposition using maximum feasible subsystem (MFS) cut generation strategy. Computers & Chemical Engineering, 34, 1237–1245.

    Article  Google Scholar 

  • Saharidis, G. K. D., Boile, M., & Theofanis, S. (2011). Initialization of the Benders master problem using valid inequalities applied to fixed-charge network problems. Expert Systems with Applications, 38, 6627–6636.

    Article  Google Scholar 

  • Sankaran, J. K. (1998). On a variant of lexicographic multi-objective programming. European Journal of Operational Research, 107, 669–674.

    Article  Google Scholar 

  • Shen, S., & Smith, J. C. (2011). A decomposition approach for solving a broadcast domination network design problem. Annals of Operations Research. doi:10.1007/s10479-011-0962-8.

    Google Scholar 

  • Sherali, H. D. (1982). Equivalent weights for lexicographic multi-objective programs: characterizations and computations. European Journal of Operational Research, 11(4), 367–379.

    Article  Google Scholar 

  • Sridhar, V., & Park, J. S. (2000). Benders-and-cut algorithm for fixed-charge capacitated network design problem. European Journal of Operational Research, 125, 622–632.

    Article  Google Scholar 

  • Wu, P., Hartman, J. C., & Wilson, G. R. (2003). A demand-shifting feasibility algorithm for Benders decomposition. European Journal of Operational Research, 148, 570–583.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Amirkabir University of Technology, No. 424, Hafez Avenue, Tehran, 15875-4413, Iran

    Ashkan Fakhri & Mehdi Ghatee

  2. Intelligent Transportation Systems Research Institute, Amirkabir University of Technology, Tehran, Iran

    Ashkan Fakhri & Mehdi Ghatee

Authors
  1. Ashkan Fakhri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mehdi Ghatee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mehdi Ghatee.

Additional information

This paper was partially supported by Intelligent Transportation Systems Research Institute, Amirkabir University of Technology, Tehran, Iran.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fakhri, A., Ghatee, M. Solution of preemptive multi-objective network design problems applying Benders decomposition method. Ann Oper Res 210, 295–307 (2013). https://doi.org/10.1007/s10479-013-1353-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-013-1353-0

Keywords

Search

Navigation