Abstract
A generalization on the tabu search method, recently developed for combinatorial optimization problems, is described in this paper. The novel version of the tabu search method can be used to solve a larger class of combinatorial optimization problems. Application of this method to var optimization and planning, which is formulated as a nonlinear large-scale mixed integer programming problem with non-differentiable objective function, is demonstrated. Judicious engineering judgment which is essential for a successful application of the proposed tabu search is developed. Simulation results of a real-world power system are included. A simulation comparison is done between the proposed method and the simulated annealing method, which is currently one of the most popular method for combinatorial optimization problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
