A decomposable self-adaptive projection-based prediction-correction algorithm for convex time space network flow problem

Applied Mathematics and Computation

Volumn 231, Issue , 2014, Pages 422-434

  Jiang, Yiping ^a,b   Fu, Xiaoling ^a   Huang, Kai ^b   Zhao, Lindu ^a  

^a SOUTHEAST UNIVERSITY   (China)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

Convex time space network flow; Decomposable; Projection based prediction correction algorithm; Self adaptive

Indexed keywords

COMPUTATIONAL EXPERIMENT; COMPUTATIONAL PERFORMANCE; CONVEX OPTIMIZATION PROBLEMS; DECOMPOSABLE; PREDICTION-CORRECTION; SELF-ADAPTIVE; TIME-SPACE NETWORKS; VARIATIONAL INEQUALITY PROBLEMS;

CONVEX OPTIMIZATION; DECISION MAKING; FORECASTING; VARIATIONAL TECHNIQUES;

ALGORITHMS;

EID: 84893289276     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2014.01.033     Document Type: Article

References (20)

1. R. Ahuja, T. Magnanti, and J. Orlin Network Flows: Theory, Algorithms, and Applications 1993 Prentice-Hall Englewood Cliffs
2. N. Kliewer, T. Mellouli, and L. Suhl A time-space network based exact optimization model for multi-depot bus scheduling Eur. J. Oper. Res. 175 2006 1616 1627
3. C. Chen, S. Yan, and M. Chen Applying lagrangian relaxation-based algorithms for airline coordinated flight scheduling problems Comput. Ind. Eng. 59 2010 398 410
4. I. Steinzen, V. Gintner, L. Suhl, and N. Kliewer A time-space network approach for the integrated vehicle-and crew-scheduling problem with multiple depots Transp. Sci. 44 2010 367 382
5. J. Kennington, and C. Nicholson The uncapacitated time-space fixed-charge network flow problem: An empirical investigation of procedures for arc capacity assignment INFORMS J. Comput. 22 2010 326 337
6. S. Yan, and Y. Shih A time-space network model for work team scheduling after a major disaster J. Chin. Inst. Eng. 30 2007 63 75
7. S. Yan, and Y. Shih Optimal scheduling of emergency roadway repair and subsequent relief distribution Comput. Oper. Res. 36 2009 2049 2065
8. J. Benders Partitioning procedures for solving mixed variables programming problems Numer. Math. 39 1962 238 252
9. M. Fisher An applications oriented guide to lagrangian relaxation Interfaces 15 1985 10 21
10. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein Distributed optimization and statistical learning via the alternating direction method of multipliers Found. Trends Mach. Learn. 3 2010 1 122
11. B. He, L. Liao, D. Han, and H. Yang A new inexact alternating directions method for monotone variational inequalities Math. Program. 92 2002 103 118
12. A. Bnouhachem, M. Xu, M. Khalfaoui, and Z. Sheng A new alternating direction method for solving variational inequalities Comput. Math. Appl. 62 2011 626 634
13. N. Parikh, and S. Boyd Proximal algorithms Found. Trends Optim. 1 2013 123 231
14. X. Fu, X. Wang, and H. Wang An inexact relaxed proximal point algorithm for multi-task sparse learning problem ICIC Express Lett. Part B Appl. 3 2012 1489 1498
15. E. Khobotov Modification of the extra-gradient method for solving variational inequalities and certain optimization problems USSR Comput. Math. Math. Phys. 27 1987 120 127
16. B. He, X. Yuan, and J. Zhang Comparison of two kinds of prediction-correction methods for monotone variational inequalities Comput. Optim. Appl. 27 2004 247 267
17. M. Xu, X. Yuan, and Q. Huang An improved general extra-gradient method with refined step size for nonlinear monotone variational inequalities J. Global Optim. 39 2007 155 169
18. X. Fu, and B. He Self-adaptive projection-based prediction-correction method for constrained variational inequalities Front. Math. China 5 2010 3 21
19. E. Zarantonello Projections on Convex Sets in Hilbert Space and Spectral Theory: Contributions to Nonlinear Functional Analysis 1971 Academic Press New York
20. K. Huang, Y. Jiang, Y. Yuan, L. Zhao, Modeling the objectives of humanitarian logistics in response to large-scale disasters, Transport. Res. E-Log., 2014, submitted for publication.