论文信息 - Using DIRECT to Solve an Aircraft Routing Problem

Using DIRECT to Solve an Aircraft Routing Problem

In this paper we discuss a global optimization problem arising in the calculation of aircraft flight paths. Since gradient information for this problem may not be readily available, a direct-search algorithm (DIRECT), proposed by Jones et al., Journal of Optimization Theory and Applications, vol. 79, pp. 157–181, 1993, appears to be a promising solution technique. We describe some numerical experience in which DIRECT is used in several different ways to solve a sample problem.

[1] Miss A.O. Penney. (b) , 1974, The New Yale Book of Quotations.

[2] C. D. Perttunen,et al. Lipschitzian optimization without the Lipschitz constant , 1993 .

[3] K. Al-Sultan,et al. A tabu search Hooke and Jeeves algorithm for unconstrained optimization , 1997 .

[4] J. M. Gablonsky. An implementation of the direct algorithm , 1998 .

[5] Bernard Grossman,et al. Parallel Global Aircraft Configuration Design Space Exploration , 1999 .

[6] M. A. Wolfe. Interval mathematics, algebraic equations and optimization , 2000 .

[7] Bernard Grossman,et al. STUDY OF A GLOBAL DESIGN SPACE EXPLORATION METHOD FOR AEROSPACE VEHICLES , 2000 .

[8] Patrick Siarry,et al. Tabu Search applied to global optimization , 2000, Eur. J. Oper. Res..

[9] Layne T. Watson,et al. A Fully Distribute Parallel Global Search Algorithm , 2001, PPSC.