Modifications of the ant colony method for aviation routing problems

DOI10.1134/S0005117915030091MaRDI QIDQ499568zbMATH OpenFDO

Authors Yu. P. Titov

Publication date 30 September 2015

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0005117915030091

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Ant colony optimization algorithms for solving transportation problems
• Ant colony optimization algorithms with diversified search in the problem of optimization of airtravel itinerary
• scientific article; zbMATH DE number 1488087
• Ant algorithms: theory and applications
• Ant Colonies Optimization (ACO) for the solution of the Vehicle Routing Problem (VRP)

Cited in

(4)

• Ant colony optimization algorithms with diversified search in the problem of optimization of airtravel itinerary
• Ant colony optimization algorithms for solving transportation problems
• An efficient ant colony algorithm based on wake-vortex modeling method for aircraft scheduling problem
• Control of set of system parameter values by the ant colony method

This page was built for publication: Modifications of the ant colony method for aviation routing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499568)