Skip to main content
SpringerLink
Log in

A New Solution Method for a Mean-Risk Mixed Integer Nonlinear Program in Transportation Network Protection

  • Conference paper
  • First Online:
Advanced Computational Methods for Knowledge Engineering (ICCSAMA 2019)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1121))

  • 634 Accesses

Abstract

The paper deals with a transportation network protection problem. The aim is to limit losses due to disasters by choosing an optimal retrofiting plan. The mathematical model given by Lu, Gupte, Huang [11] is a mixed integer non linear optimization problem. Existing solution methods are complicated and their computing time is long. Hence, it is necessary to develop efficient solution methods for the considered model. Our approach is based on DC (difference of two convex functions) programming and DC algorithm (DCA). The original model is first reformulated as a DC program by using exact penalty techniques. We then apply DCA to solve the resulting problem. Numerical results on a small network are reported to see the behavior of DCA. It shows that DCA is fast and the proposed approach is promissing.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Atamturk, A., Zhang, M.: Two-stage robust network flow and design under demand uncertainty. Oper. Res. 55, 662–673 (2007)

    Article  MathSciNet  Google Scholar 

  2. Burer, S., Letchford, A.N.: Non-convex mixed-integer nonlinear programming: a survey. Surv. Oper. Res. Manage. Sci. 17, 97–106 (2012)

    MathSciNet  Google Scholar 

  3. Floudas, C.A.: Generalized benders decomposition. In: Nonlinear and Mixed-Integer Optimization, pp. 114–143. Oxford University Press, Oxford (1995)

    Google Scholar 

  4. Le Thi, H.A., Pham Dinh, T., Le, D.M.: Exact penalty in D.C. programming. Vietnam J. Math. 27(2), 169–178 (1999)

    Google Scholar 

  5. Le Thi, H.A., Pham Dinh, T.: The DC (difference of convex functions) programming and DCA revisited with DC models of real wourd nonconvex optimization problems. Ann. Oper. Res. 133, 23–46 (2005)

    Article  MathSciNet  Google Scholar 

  6. Le Thi, H.A., Pham, D.T., Huynh, V.N.: Exact Penalty Techniques in DC Programming. Technical Report, LMI, INSA-Rouen, France, July 2007

    Google Scholar 

  7. Le Thi, H.A., Nguyen, Q.T.: A robust approach for nonlinear UAV task assignment problem under uncertainty. In: Transactions on Computational Collective Intelligence II, pp. 147–159 (2010)

    Google Scholar 

  8. Le Thi, H.A., Nguyen, Q.T., Phan, K.T., Pham Dinh, T.: DC programming and DCA based cross-layer optimization in multi-hop TDMA networks. In: Selamat, A., Nguyen, N.T., Haron, H. (eds.) Intelligent Information and Database Systems. ACIIDS. LNCS, vol. 7803. Springer, Heidelberg (2013)

    Google Scholar 

  9. Le Thi, H.A., Pham Dinh, T., Quynh, T.D.: A DC programming approach for a class of bilevel programming problems and its application in portfolio selection. NACO Numer. Algebra Control Optim. 2(1), 167–185 (2012)

    Article  MathSciNet  Google Scholar 

  10. Liu, C., Fan, Y., Ordonez, F.: A two-stage stochastic programming model for transportation network protection. Comput. Oper. Res. 36, 1582–1590 (2009)

    Article  MathSciNet  Google Scholar 

  11. Lu, J., Gupte, A., Huang, Y.: A mean-risk mixed integer nonlinear program for transportation network protection. Eur. J. Oper. Res. 265(1), 277–289 (2018)

    Article  MathSciNet  Google Scholar 

  12. Nguyen, Q.T., Le Thi, H.A.: Solving an inventory routing problem in supply chain by DC programming and DCA. In: Nguyen, N.T., Kim, C.G., Janiak, A. (eds.) Intelligent Information and Database Systems. ACIIDS. LNCS, vol. 6592. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  13. Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to DC programming: theory, algorithms and applications. Acta Math. Vietnamica 22(1), 289–357 (1997). Dedicated to Professor Hoang Tuy on the occassion of his 70th birthday

    Google Scholar 

  14. Pham, D.T., Le Thi, H.A.: DC optimization algorithms for solving the trust region subproblem. SIAM J. Optim. 8, 476–505 (1998)

    Article  MathSciNet  Google Scholar 

  15. Traffic assignment manual for application with a large, high speed computer. Washington, U.S. Dept. of Commerce, Bureau of Public Roads, Office of Planning, Urban Planning Division (1964)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hanoi University of Science and Technology, Hanoi, Vietnam

    Luong Vuong Le

  2. Industrial University of Ho Chi Minh City, Ho Chi Minh City, Vietnam

    Luong Vuong Le

  3. Vietnam National University Hanoi - International School, Hanoi, Vietnam

    Quang Thuan Nguyen & Duc Quynh Tran

Authors
  1. Luong Vuong Le
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Quang Thuan Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Duc Quynh Tran
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Duc Quynh Tran .

Editor information

Editors and Affiliations

  1. Computer Science and Applications Department LGIPM, University of Lorraine, Metz Cedex 03, France

    Hoai An Le Thi

  2. Computer Science and Applications Department LGIPM, University of Lorraine, Metz Cedex 03, France

    Hoai Minh Le

  3. Laboratory of Mathematics, National Institute for Applied Sciences, Saint-Étienne-du-Rouvray Cedex, France

    Tao Pham Dinh

  4. Department of Information Systems, Wroclaw University of Science and Technology, Wrocław, Poland

    Ngoc Thanh Nguyen

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Le, L.V., Nguyen, Q.T., Tran, D.Q. (2020). A New Solution Method for a Mean-Risk Mixed Integer Nonlinear Program in Transportation Network Protection. In: Le Thi, H., Le, H., Pham Dinh, T., Nguyen, N. (eds) Advanced Computational Methods for Knowledge Engineering. ICCSAMA 2019. Advances in Intelligent Systems and Computing, vol 1121. Springer, Cham. https://doi.org/10.1007/978-3-030-38364-0_2

Download citation

Publish with us

Policies and ethics

Search

Navigation