Applying Lagrangian relaxation-based algorithms for airline coordinated flight scheduling problems

Route planning for a seaplane service: The case of the Greek Islands

“…Finally, crew scheduling matches crews to aircrafts so that work rules are satisfied at minimum operating costs. The literature is rich with respect to all four planning steps, with indicative recent studies on flight scheduling and fleet routing by Yan and Young [51], Yan and Tseng [49], Yan et al [48,50], Haouari et al [22], and Chen et al [8], and on aircraft routing and crew scheduling by Mercier and Sourmis [36], Lacasse-Guay et al [33], Weide et al [47] and Cadarso and Marin [6]. Comprehensive models integrating all four planning steps have been also proposed by Salazar-González [43] and Cacchiani and Salazar-González [5].…”

Applying bi-random MODM model to navigation coordinated scheduling: a case study of Three Gorges Project

“…Meanwhile, passengers could also save the waiting time and cost. Because of its important practical significance, coordinated scheduling has been addressed by a number of researchers in many areas, such as supply chain management (Bonfill et al 2008;Sawik 2009), production and delivery (Garcia et al 2004;Li et al 2008;Tang, Gong 2009;Lee, Yoon 2010;Delavar et al 2010;Tang et al 2010), transportation (Shrivastava, O'Mahony 2006;Yan, Chen 2007; Yan et al 2008;Zegordi, Nia 2009;Chen et al 2010), customer orders system (Liu 2010), etc.…”

Aircraft Routing and Scheduling: a Case Study in an Airline Company

“…Problem sizes are expected to be huge making the model more difficult to solve than traditional passenger/cargo flight scheduling problems. Therefore, Chen, Yan and Chen (2010) developed a family of Lagrangian based algorithm to solve the coordinated fleet routing and flight scheduling problems [9].…”