Using DIRECT to solve an aircraft routing problem

被引：42

作者：

Bartholomew-Biggs, MC ^{[1
]}

Parkhurst, SC ^{[1
]}

Wilson, SP ^{[1
]}

机构：

[1] Univ Hertfordshire, Numer Optimisat Ctr, Hatfield AL10 9AB, Herts, England

来源：

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS | 2002年 / 21卷 / 03期

关键词：

global optimization; direct search methods; route planning;

D O I：

10.1023/A:1013729320435

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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.

引用

页码：311 / 323

页数：13

共 15 条

[1] A tabu search Hooke and Jeeves algorithm for unconstrained optimization [J].

AlSultan, KS ;

AlFawzan, MA .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 103 (01) :198-208

[2]

[Anonymous], 1998, CRSCTR9829 N CAR STA

[3]

Baker C. A., 2000, Proceedings of the High Performance Computing Symposium - HPC 2000, P101

[4]

BAKER CA, 2000, 5 NASA HIGH PERF COM

[5]

BAKER CA, IN PRESS INT J COMPU

[6] Tabu Search applied to global optimization [J].

Chelouah, R ;

Siarry, P .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 123 (02) :256-270

[7]

COX SE, IN PRESS J GLOBAL OP

[8]

COX SE, 1999, 3 WORLD C STRUCT MUL

[9]

HEWITT C, 1998, ADV MISSION MANAGEME

[10]

HEWITT C, 1992, TACTICAL NAVFIGATION

← 1 2 →