Abstract
In this paper, we consider one of the most challenging problems in transportation, namely the Continuous Equilibrium Network Design Problem (CENDP). This problem is to determine capacity expansions of existing links in order to minimize the total travel cost plus the investment cost for link capacity improvements, when the link flows are constrained to be in equilibrium. We used the model of mathematical programming with complementarity constraints (MPCC) for the CENDP and recast it as a DC (Difference of Convex functions) program with DC constraints via the use of a penalty technique. A DCA (DC Algorithm) was developed to solve the resulting problem. Numerical results indicate the efficiency of our method vis-à-vis some existing algorithms.
References
Abdulaal, M., LeBlanc, L.J.: Continuous equilibrium network design models. Transp. Res. Part B 13, 19–32 (1979)
Chiou, S.W.: Bilevel programming for the continuous transport network design problem. Transp. Res. Part B 39, 361–383 (2005)
Friesz, T.L., Cho, H.J., Mehta, N.J., Tobin, R.L., Anandalingam, G.: A simulated annealing approach to the network design problem with variational inequality constraints. Transp. Sci. 26(1), 18–26 (1992)
Friesz, T.L., Tobin, R.L., Cho, H.J., Mehta, N.J.: Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints. Math. Program. 48, 265–284 (1990)
Hoang, N.T.: Linear convergence of a type of iterative sequences in nonconvex quadratic programming. J. Math. Anal. Appl. 423(2), 1311–1319 (2015)
Le Thi, H.A.: DC programming and DCA. http://www.lita.univ-lorraine.fr/~lethi
Le Thi, H.A., Huynh, V.N., Pham Dinh, T.: DC programming and DCA for general DC programs. In: Advances in Intelligent Systems and Computing, pp. 15–35. Springer (2014)
Le Thi, H.A., Pham Dinh, T.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133, 23–46 (2005)
Luenberger, D.G., Ye, Y.: Linear and Nonlinear Programming. Springer (2008)
Meng, Q., Yang, H., Bell, M.G.H.: An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem. Transp. Res. Part B 35, 83–105 (2001)
Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to D.C. programming: theory, algorithms and applications. Acta Math. Vietnam 22(1), 289–355 (1997)
Pham Dinh, T., Le Thi, H.A.: Recent advances in DC programming and DCA. Trans. Comput. Collect. Intell. 8342, 1–37 (2014)
Suwansirikul, C., Friesz, T.L., Tobin, R.L.: Equilibrium decomposed optimization: a heuristic for continuous equilibrium network design problem. Transp. Sci. 21(4), 254–263 (1987)
Wang, D., Lo, H.K.: Global optimum of the linearized network design problem with equilibrium flows. Transp. Res. Part B 44(4), 482–492 (2010)
Wu, C., Li, C., Long, Q.: A DC programming approach for sensor network localization with uncertainties in anchor positions. J. Ind. Manag. Optim. 10(3), 817–826 (2014)
Yin, P., Lou, Y., He, Q., Xin, J.: Minimization of \({l }_{1-2}\) for compressed sensing. SIAM J. Sci. Comput. 37(1), A536–A563 (2015)
Acknowledgments
This research is funded by Foundation for Science and Technology Development of Ton Duc Thang University (FOSTECT), website: http://fostect.tdt.edu.vn, under Grant FOSTECT.2015.BR.15.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Nguyen, T.M.T., Le Thi, H.A. (2016). A DC Programming Approach to the Continuous Equilibrium Network Design Problem. In: Nguyen, T.B., van Do, T., An Le Thi, H., Nguyen, N.T. (eds) Advanced Computational Methods for Knowledge Engineering. Advances in Intelligent Systems and Computing, vol 453. Springer, Cham. https://doi.org/10.1007/978-3-319-38884-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-38884-7_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-38883-0
Online ISBN: 978-3-319-38884-7
eBook Packages: EngineeringEngineering (R0)