Solving continuous single-objective defensive location problem based on hybrid directed tabu search algorithm

Khanduzi, Raheleh; Peyghami, M. Reza; Maleki, Hamid Reza

doi:10.1007/s00170-014-6180-1

Cited by 7 publications

(1 citation statement)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Indeed, the slow convergence of TS was overcome by incorporating local search strategies, such as the Nelder-Mead (NM) method [39] and the adaptive pattern search (APS) [25], into the main algorithm. On the other hand, the DTS has been successfully applied to various real-world optimization problems [26,28,29,31,38,41]. Therefore, we survey application of DTS to solve OCP and use the values of the parameters that are required in the implementation of the DTS method of Hedar and Fukushima [26].…”

Section: Introductionmentioning

confidence: 99%

A directed tabu search method for solving controlled Volterra integral equations

Ebrahimzadeh

Khanduzi

2016

Math Sci

Self Cite

View full text Add to dashboard Cite

This paper proposes a pseudo-spectral scheme for obtaining approximate optimal control and state. This computational scheme represents the solution of the optimal control problem (OCP) by an mth degree Lagrange interpolating polynomial, using Legendre nodes. Then, OCP of non-linear Volterra integral equation is transformed into an optimization problem. Directed tabu search (DTS) method is utilized to derive the solutions of the optimal control and state as well as the optimal value of the objective function. In the DTS method, two neighborhood-local search strategies based on Nelder-Mead method and adaptive pattern search are applied. In addition, a tabu list with anti-cycling rules, the so-called tabu regions and semi-tabu regions are used. In addition, diversification and intensification search schemes are employed. DTS is able to converge to the global optimum solutions of a set of numerical examples. Therefore, some good balance between the diversification and intensification ensures a faster and efficient convergence to get quality solutions. Numerical examples are provided which confirm the reliability and efficiency of the proposed method. Moreover, a comparison is made with optimal solutions obtained by the other numerical methods in the literature.

show abstract