Solving the aerial fleet refueling problem using group theoretic tabu search
From MaRDI portal
Publication:1767071
DOI10.1016/S0895-7177(04)90544-4zbMath1055.90511MaRDI QIDQ1767071
Publication date: 4 March 2005
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Related Items (6)
The dynamic bowser routing problem ⋮ The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches ⋮ An integer programming approach to support the US Air Force's air mobility network ⋮ Optimal scheduling for replacing perimeter guarding unmanned aerial vehicles ⋮ Solving the aerial fleet refueling problem using group theoretic tabu search ⋮ An adaptive VNS algorithm for vehicle routing problems with intermediate stops
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recovering information about a group from its complex group algebra
- Linearity in the traveling salesman problem
- Using group theory and transition matrices to study a class of metaheuristic neighborhoods
- Solving the theater distribution vehicle routing and scheduling problem using group theoretic tabu search
- Solving the aerial fleet refueling problem using group theoretic tabu search
- A note on characterizing the \(k-OPT\) neighborhood via group theory
- Applying tabu search to the job-shop scheduling problem
- The Reactive Tabu Search
- Local search structure in the symmetric travelling salesperson problem under a general class of rearrangement neighborhoods
This page was built for publication: Solving the aerial fleet refueling problem using group theoretic tabu search