21 January 2018 in Journal of Advanced Transportation
Route planning for military ground vehicles in the uncertain battlefield is a special kind of route planning problem, as the military vehicles face a great of uncertain and unpredicted attacks. This paper models these uncertainties in the road network by a set of discrete scenarios. A th shortest-path method is introduced to find intact routes from the origin to the destination for each vehicle. A binary integer programming is presented to formulate the problem. As the combination of the uncertainties results in a huge number of scenarios, we employed the sample average approximation method to obtain a robust solution for the problem. The solution approach is illustrated and tested through three road networks with different scales. The computational results show that, for networks of small scale, our method can provide a good solution with a sample of small size, while, for the large network, with sample of small size, this method usually leads to a suboptimal solution, but a good solution can still be obtained as the sample size grows bigger. In addition, variation trend of the deviation with different sample size indicates that a sample of larger size can bring more stability to the results.
1 November 2014 in Applied Mathematical Modelling
4 February 2019 in IEEE Access
Online semi-supervised learning (OS2L) has received much attention recently because of its well practical usefulness. Most of existing studies of online semi-supervised learning related to manifold regularization. In this study, we propose a novel online semi-supervised learning framework with multiple regularization terms based on the notion of ascending the dual function in constrained optimization. Using Fenchel conjugate, different semi-supervised regularization terms can be integrated in the dual function easily and directly. This approach is derived by updating limited dual coefficient variables on each learning round. To be practical, we also employ buffering strategies and sparse approximation approaches in this work. Experimental studies show that our methods achieve accuracy comparable to offline algorithms while consuming less time and memory. Specially, our online semi-supervised learning algorithms can handle the settings where the target hyperplane of classification continually drifts with the sequence of arriving instances. This paper paves a way to the design and analysis of online semi-supervised learning algorithms with multiple regularization terms.
25 February 2015 in International Journal of Modern Physics C
1 June 2014 in Military Operations Research