Using DIRECT to Solve an Aircraft Routing Problem

Authors:
M. C. Bartholomew-Biggs;S. C. Parkhurst;S. P. Wilson
Affiliations:
Numerical Optimisation Centre, University of Hertfordshire, Hatfield AL10 9AB UK;Numerical Optimisation Centre, University of Hertfordshire, Hatfield AL10 9AB UK;Numerical Optimisation Centre, University of Hertfordshire, Hatfield AL10 9AB UK
Venue:
Computational Optimization and Applications
Year:
2002

Citing 2
Cited 4

Lipschitzian optimization without the Lipschitz constant

Journal of Optimization Theory and Applications
Interval mathematics, algebraic equations and optimization

Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. IV: optimization and nonlinear equations

Using Global Optimization for a Microparticle Identification Problem with Noisy Data

Journal of Global Optimization
Optimizing Preventive Maintenance Models

Computational Optimization and Applications
A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems

Computational Optimization and Applications
Simplicial Lipschitz optimization without the Lipschitz constant

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.