Ant colony optimization algorithms with diversified search in the problem of optimization of airtravel itinerary

DOI10.1007/S10559-019-00208-6MaRDI QIDQ2174053zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 17 April 2020

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-019-00208-6

zbMATH Keywords

ant algorithmsdynamic discretization discoveryflight networkroute optimizationsearch diversificationtime-extended networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90)

Recommendations

• Modifications of the ant colony method for aviation routing problems
• Ant colony algorithm in airline seat inventory optimization
• Traveling salesman problem in a time varying network
• Ant colony optimization algorithms for solving transportation problems
• The time-dependent orienteering problem with time windows: a fast ant colony system

Cites work

• A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem
• Ant colony optimization.
• Cooperative model-based metaheuristics
• Development and analysis of cooperative model-based metaheuristics
• Formalization and classification of combinatorial optimization problems
• On the complexity of time-dependent shortest paths

Cited in

(3)

• Modifications of the ant colony method for aviation routing problems
• An efficient ant colony algorithm based on wake-vortex modeling method for aircraft scheduling problem
• Ant colony algorithm in airline seat inventory optimization

This page was built for publication: Ant colony optimization algorithms with diversified search in the problem of optimization of airtravel itinerary

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