Ant colony optimization algorithms with diversified search in the problem of optimization of airtravel itinerary
DOI10.1007/S10559-019-00208-6zbMATH Open1442.90195OpenAlexW2989618330WikidataQ126671027 ScholiaQ126671027MaRDI QIDQ2174053FDOQ2174053
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
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
route optimizationant algorithmsdynamic discretization discoveryflight networksearch diversificationtime-extended networks
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90)
Cites Work
- Ant colony optimization.
- On the complexity of time-dependent shortest paths
- Cooperative model-based metaheuristics
- Development and analysis of cooperative model-based metaheuristics
- A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem
- Formalization and classification of combinatorial optimization problems
Cited In (3)
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)
