Not checkedNot checked for notices yet.
A two-phase variable neighborhood search for solving nonlinear optimal control problems
Reza Ghanbari, Aghileh Heydari, Saeed Nezhadhosein
Iranian Journal of Numerical Analysis and Optimization · 2015
doi:10.22067/ijnao.v5i1.34200 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
In this paper, a two-phase algorithm, namely IVNS, is proposed for solving nonlinear optimal control problems. In each phase of the algorithm, we use a variable neighborhood search (VNS), which performs a uniform distribution in the shaking step and the successive quadratic programming, as the local search step. In the first phase, VNS starts with a completely random initial solution of control input values. To increase the accuracy of the solution obtained from the phase 1, some new time nodes are added and the values of the new control inputs are estimated by spline interpolation. Next, in the second phase, VNS restarts by the solution constructed by the phase 1. The proposed algorithm is implemented on more than 20 well-known benchmarks and real world problems, then the results are compared with some recently proposed algorithms. The numerical results show that IVNS can find the best solution on 84% of test problems. Also, to compare the IVNS with a common VNS (when the number of time nodes is same in both phases), a computational study is done. This study shows that IVNS needs less computational time with respect to common VNS, when the quality of solutions are not different signifcantly.
Abstract licence: CC BY-NC
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.