Using DIRECT to solve an aircraft routing problem

DOI10.1023/A:1013729320435zbMath1017.90133OpenAlexW1540445155MaRDI QIDQ5961070

S. C. Parkhurst, Simon P. Wilson, Michael Bartholomew-Biggs

Publication date: 26 August 2003

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1013729320435

zbMATH Keywords

direct search methodsglobal optimizationroute planning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Related Items (28)

Derivative-free global ship design optimization using global/local hybridization of the DIRECT algorithm ⋮ ARGONAUT: algorithms for global optimization of constrained grey-box computational problems ⋮ A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems ⋮ Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Optimizing preventive maintenance models ⋮ Additive scaling and the \texttt{DIRECT} algorithm ⋮ Derivative-free optimization: a review of algorithms and comparison of software implementations ⋮ On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization ⋮ Determination of protein structure and dynamics combining immune algorithms and pattern search methods ⋮ Combining global and local strategies to optimize parameters in magnetic spacecraft control via attitude feedback ⋮ Military aircraft mission planning. Efficient model-based metaheuristic approaches ⋮ The aircraft routing problem with refueling ⋮ An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework ⋮ Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme ⋮ A modified DIviding RECTangles algorithm for a problem in astrophysics ⋮ DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization ⋮ Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption ⋮ Application of reduced-set Pareto-Lipschitzian optimization to truss optimization ⋮ Simplicial Lipschitz optimization without the Lipschitz constant ⋮ Globally-biased disimpl algorithm for expensive global optimization ⋮ Using global optimization for a microparticle identification problem with noisy data ⋮ The DIRECT algorithm: 25 years later ⋮ Tuning BARON using derivative-free optimization algorithms ⋮ Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints ⋮ A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints ⋮ A univariate global search working with a set of Lipschitz constants for the first derivative ⋮ Global optimization approaches to an aircraft routing problem

This page was built for publication: Using DIRECT to solve an aircraft routing problem