A neighborhood search algorithm for the combined through and fleet assignment model with time windows

DOI10.1002/NET.20026zbMATH Open1055.90567OpenAlexW2002046944WikidataQ59592512 ScholiaQ59592512MaRDI QIDQ3156830FDOQ3156830

Authors: Ravindra K. Ahuja, Jian Liu, James B. Orlin, Jon Goodstein, Amit Mukherjee 

Publication date: 12 January 2005

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20026

Recommendations

• A very large-scale neighborhood search algorithm for the combined through-fleet-assignment model
• Airline fleet assignment with time windows
• Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues
• Advances in the Optimization of Airline Fleet Assignment
• scientific article; zbMATH DE number 2050792

zbMATH Keywords

networksinteger programmingfleet assignmentneighborhood searchAirline scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Discrete location and assignment (90B80)

Cites Work

• A very large-scale neighborhood search algorithm for the combined through-fleet-assignment model

Cited In (4)

• Fleet design optimisation from historical data using constraint programming and large neighbourhood search
• Airline fleet assignment with time windows
• Airline flight schedule planning under competition
• Integrated optimisation model for airline bank structure and fleet assignment problem

This page was built for publication: A neighborhood search algorithm for the combined through and fleet assignment model with time windows

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