Solving the aerial fleet refueling problem using group theoretic tabu search

Barnes, J. Wesley; Wiley, Victor; Moore, James T.; Ryer, David M.

doi:10.1016/s0895-7177(04)90544-4

Cited by 28 publications

(24 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Scrich et al (2004) applied TS to solve the problem of scheduling job with the aim of minimizing total tardiness [107]. Barnes et al (2004) applied TS to solve the aerial fleet refueling using group theoretic. They applied group theory to partitioning and ordering combinatorial optimization [13].…”

Section: Tabu Searchmentioning

confidence: 99%

See 1 more Smart Citation

Survey of Metaheuristic Algorithms for Combinatorial Optimization

Baghel¹,

Agrawal²,

Silakari³

2012

IJCA

View full text Add to dashboard Cite

This paper is intended to give a review of metaheuristic and their application to combinatorial optimization problems. This paper comprises a snapshot of the rapid evolution of metaheuristic concepts, their convergence towards a unified framework and the richness of potential application in combinatorial optimization problems. Over the years, combinatorial optimization problems are gaining awareness of the researchers both in scientific as well as industrial world. This paper aims to present a brief survey of different metaheuristic algorithms for solving the combinatorial optimization problems. Basically we have divided the metaheuristic into three broad categories namely trajectory methods, population based methods and hybrid methods. Trajectory methods are those that deal with a single solution. These include simulated annealing, tabu search, variable neighborhood search and greedy randomized adaptive search procedure. Population based methods deal with a set of solutions. These include genetic algorithm, ant colony optimization and particle swarm optimization. Hybrid methods deal with the hybridization of single point search methods and population based methods. These are further categorized into five different types. Finally we conclude the paper by giving some issues which are needed to develop a well performed metaheuristic algorithm.

show abstract

Section: Tabu Searchmentioning

confidence: 99%

“…Barnes et al (2004) applied TS to solve the aerial fleet refueling using group theoretic. They applied group theory to partitioning and ordering combinatorial optimization [13]. Harwig et al (2006) applied adaptive TS to solve two dimensional orthogonal packing problems [51].…”

Section: Tabu Searchmentioning

confidence: 99%

Survey of Metaheuristic Algorithms for Combinatorial Optimization

Baghel¹,

Agrawal²,

Silakari³

2012

IJCA

View full text Add to dashboard Cite

show abstract

“…Aerial reconnaissance simulations is the topic of [110]. The authors of [9] use an adaptive tabu search approach for solving the aerial fleet refueling problem.…”

Section: Real-world Applicationsmentioning

confidence: 99%

Reactive Search Optimization: Learning While Optimizing

Battiti

Brunato

2010

International Series in Operations Research &Amp; Management Science

View full text Add to dashboard Cite

“…Recent work by Barnes, Wiley, Moore and Ryer (2004) on the Aerial Flight Refueling Problem (AFRP), Crino, Moore, Barnes and Nanry (2004) on the Theater Distribution Vehicle Routing and Scheduling Problem (TDVRSP), and Combs (2002Combs ( , 2004 on the Crew Scheduling Problem (CSP) clearly demonstrate that a tabu search approach can provide robust, effective and efficient solutions to practical large scale combinatorial optimization problems. Thus an ATS approach to the SAP will provide an effective methodology to fill the gaps left by current models at AMC by providing timely, robust, detailed and excellent solutions to the SAP.…”

Section: Motivationmentioning

confidence: 99%