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

NCU Institutional Repository > 工學院 > 土木工程學系 > 期刊論文 > Item 987654321/49785

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/49785

题名:	Applying Lagrangian relaxation-based algorithms for airline coordinated flight scheduling problems
作者:	Chen,CH;Yan,S;Chen,M
贡献者:	土木工程學系
关键词:	STOCHASTIC-FLOW NETWORK;RELIABILITY EVALUATION;LOCAL SEARCH;CONSTRAINT;MODELS;NODES
日期:	2010
上传时间:	2012-03-27 16:16:40 (UTC+8)
出版者:	國立中央大學
摘要:	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.
關聯:	COMPUTERS & INDUSTRIAL ENGINEERING
显示于类别:	[土木工程學系 ] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	695	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing