TABLE OF CONTENTS Toshiyuki Satoh
Abstract. A new global search method, proposed by Zakian and called the node array method, is evaluated numerically. The global search capability of the method is tested on fourteen known or specially devised problems containing various degrees of search difficulty. The test results show that the method is globally convergent and efficient.
A description of the node array (NA) method is given by Zakian (Section 1.7). The main purpose of this chapter is to provide a numerical evaluation of the efficiency of the method, by testing it on fourteen challenging problems, some of which were specially devised for this purpose, in collaboration with Zakian. In devising some of the test problems, special care was taken to ensure that the global search capacity of the method would be tested. The same test problems are used elsewhere (Whidborne, Chapter 7; Liu and Ishihara, Chapter 8) to test two other methods. The results of those tests provide a basis upon which the efficiency of the node array method can be assessed.
The particular node array method considered in this chapter employs the moving boundaries process (MBP) (see Appendix 6.A) to make the local searches. More specifically, the MBP considered here employs the Rosenbrock (R) trial generator and this generator is described in detail in Appendix 6.A. Consequently, the entire...
