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

NCUIR > Engineering College > Department of Civil Engineering > journal & Dissertation > Item 987654321/49785

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/49785

Title:	Applying Lagrangian relaxation-based algorithms for airline coordinated flight scheduling problems
Authors:	Chen,CH;Yan,S;Chen,M
Contributors:	土木工程學系
Keywords:	STOCHASTIC-FLOW NETWORK;RELIABILITY EVALUATION;LOCAL SEARCH;CONSTRAINT;MODELS;NODES
Date:	2010
Issue Date:	2012-03-27 16:16:40 (UTC+8)
Publisher:	國立中央大學
Abstract:	Van and Chen (2007, 2008) employed network flow techniques to construct coordinated scheduling models for passenger- and cargo-transportation, respectively. These models are formulated as mixed integer multiple commodity network flow problems with side constraints (NFPWS) that are characterized as NP-hard. Problem sizes are expected to be huge making the model more difficult to solve than traditional passenger/cargo flight scheduling problems. Therefore, a family of Lagrangian based algorithm is developed to solve the coordinated fleet routing and flight scheduling problems. Numerical tests are performed to evaluate the proposed algorithm using real operating data from two Taiwan airlines. The test results indicate that these solution algorithms are a significant improvement over those obtained with CPLEX. Moreover, the Lagrangian based algorithms are better than the mixed-stop heuristic, consequently they could be useful for allied airlines to solve coordinated fleet routing and flight scheduling problems. (C) 2010 Elsevier Ltd. All rights reserved.
Relation:	COMPUTERS & INDUSTRIAL ENGINEERING
Appears in Collections:	[Department of Civil Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	669	View/Open

社群 sharing

Loading...