检索结果-内蒙古大学图书馆

A New Model for fleet assignment problem, Case Study of Iran Air Network at Vision 2036

INTERNATIONAL JOURNAL OF ENGINEERING 2015年第11期28卷 1614-1623页

作者： Tofigh, A. A. Bashiri, M. Manteghi, M. Jalili, M. Univ Amirkabir Dept Ind Engn Tehran Iran Univ Shahed Dept Ind Engn Tehran Iran Univ Maleke Ashtar Dept Ind Engn Tehran Iran Mat & Energy Res Ctr Dept Ind Engn Tehran Iran

The fleet assignment problem (FAP) assigns the type of airplane at each flight segment. Since airplane is an expensive resource, poor fleet assignment can cause a great increase in costs of airlines. There are so many consideration which should be tackled in formulation of a FAP problem, especially the parameters regarding to the airplanes. This paper presents a novel, mixed integer programing for formulation of FAP problem. The aim of this paper is to assign most appropriate fleet type to flight while minimizing the cost and determining optimal number of plane for each fleet. The model guarantees that each pair of nodes is served in a limit of planes utilization time constraint. The model was applied in a real example. In this example the demand matrix between 69 airports in Iran was estimated for year 2036. Finally, the most appropriate fleet was determined in the outlook 2036. The results show that the airplane assignment by the proposed model will need less purchasing cost comparing to current fleet needs and total investment cost in air industry will be decreased so much.

关键词： fleet assignment problem Airline planning Hub problem

来源：评论

学校读者我要写书评

暂无评论

Identifying potential routes and airports in Brazil: An integration of the route selection and fleet assignment problems

引用

CASE STUDIES ON TRANSPORT POLICY 2025年 20卷

作者： Nagano, Marcelo Seido de Jesus, Thiago Dias Rossi, Fernando Luis Univ Sao Paulo Sao Carlos Sch Engn Ave Trabalhador Saocarlense400 BR-13566590 Sao Carlos SP Brazil Fed Inst Educ Sci & Technol Sao Paulo Barretos SP Brazil Univ Sao Paulo Inst Ciencias Matemat & Computacao Trabalhador Sao Carlense Ave400 Centre BR-13566 590 Sao Carlos SP Brazil

The strategic planning of airline networks is critical for maximizing profitability and operational efficiency. Among the key challenges faced by airlines is the Route Selection problem (RSP)-determining which routes to operate based on demand, economic conditions, and infrastructure-and the fleet assignment problem (FAP)- optimally assigning aircraft to routes to minimize costs. While these problems are typically addressed separately, their integration can yield more robust and profitable solutions. This study presents a novel mathematical model that integrates RSP and FAP using Mixed Integer Linear Programming (MILP) to optimize network profitability and fleet utilization. The model was validated through a case study of a fictional regional airline in Southeast Brazil, analyzing 41 potential locations. The results identified 28 profitable routes, including 11 destinations currently without regular flights and one without an airport. By optimizing fleet allocation and route selection, the model provides a data-driven framework for airlines, policymakers, and investors to enhance network efficiency and identify underserved markets. This study demonstrates that an integrated approach to route selection and fleet assignment can significantly improve decision-making in the airline industry, offering a scalable methodology for network expansion and strategic investment.

关键词： Route Selection problem fleet assignment problem Mixed-Integer Linear Programming Airline

来源：评论

学校读者我要写书评

暂无评论

Assigning airport ground handling operations: a data-driven matheuristic

引用

International Transactions in Operational Research 2025年

作者： Dupaquis, Alexandre Guivarch, Ronan Mouysset, Sandrine Ruiz, Daniel Charvillat, Vincent Bouilhaguet, Frédéric APO Université de Toulouse IRIT Toulouse INP 2 Rue Charles Camichel Toulouse cedex 7 F-31071 France RESONATE MP4 2 Rue Des Voyelles Cargo 6 (Bat. Sodexi) Roissy CDG 95723 France APO Université de Toulouse IRIT UPS 118 Route de Narbonne Toulouse cedex 9 F-31062 France Institut Mines-Télécom 19 place Marguerite Perey Palaiseau 91120 France

In this paper, we study a problem in the crossover between vehicle routing and scheduling problems. The multi-trip capacitated vehicle routing and scheduling problem with time windows and meal breaks is extended to a heterogeneous fleet of trucks and drivers, with qualifications and different loading patterns. We propose an optimisation model that solves the problem in reasonable time for small instances. Then, we introduce two heuristics in order to deal with real-life cases: a greedy heuristic and a matheuristic extension, the latter building upon exact methods to solve parts of the problem. We tested our algorithms on multiple new real-life instances on U.S. airports. Our computational study compares the effectiveness of each approach and asserts the strength of our matheuristic. Moreover, we implemented our algorithms to help ground handlers specialised in catering operations to speed up the decision-making process of assigning hundreds of tasks every day, with conclusive results. © 2025 The Author(s). International Transactions in Operational Research published by John Wiley & Sons Ltd on behalf of International Federation of Operational Research Societies.

关键词： aircraft ground handling airport ground operations crew planning fleet assignment problem heuristics job shop linear programming planning scheduling vehicle routing

来源：评论

学校读者我要写书评

暂无评论

An algorithm for self-organization of driverless vehicles of a car-rental service

引用

NONLINEAR DYNAMICS 2016年第1期84卷 107-114页

作者： Alberto Conejero, J. Jordan, Cristina Sanabria-Codesal, Esther Univ Politecn Valencia IUMPA E-46022 Valencia Spain Univ Politecn Valencia Inst Univ Matemat Multidisciplinar IMM E-46022 Valencia Spain Univ Politecn Valencia DMA E-46022 Valencia Spain

The solution of fleet assignment problems is one of the core points in the management of a car-rental company. These problems arise from the restrictions imposed by the acceptance of reservations of the customers and from the necessity of an arrangement of the cars at the different depots for attending these bookings. However, with the coming of driverless cars, the rearrangement of vehicles among the depots can be simplified since no staff must be responsible of these tasks. In this note, we show a heuristic algorithm that permits to minimize the number of cars that have to be subcontracted from an external provider in order to attend a list of reservations from customers. Its efficacy is shown in comparison with the solution given by the integer linear programming method. These results can be of interest for other autonomous systems that need to be controlled.

关键词： fleet assignment problem Car-rental services Integer linear programming Heuristics Graph theory Time-space networks

来源：评论

学校读者我要写书评

暂无评论

Stochastic Airline fleet assignment With Risk Aversion

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2019年第8期20卷 3081-3090页

作者： Liu, Ming Liang, Bian Zheng, Feifeng Chu, Feng Tongji Univ Sch Econ & Management Shanghai 200092 Peoples R China Donghua Univ Sch Business & Management Shanghai 200051 Peoples R China Univ Paris Saclay Univ Evry IBISC F-91025 Evry France Fuzhou Univ Sch Econ & Management Fuzhou 350116 Fujian Peoples R China

The air transport industry is an important branch of the intelligent transportation system (ITS). It is widely admitted that modern ITS technologies and advanced management methods, such as fleet assignment, aircraft maintenance routing, and crew scheduling, can significantly increase an airline's market share and profit, and also improve customer satisfaction. This paper studies a new airline stochastic fleet assignment problem with random passenger demands under risk aversion. The objective is to maximize the expected total profit at a certain level of risk avoidance (i.e., conditional value-at-risk). To solve this problem, we present a risk-averse two-stage stochastic mixed-integer programming model. The first stage mainly deals with tactic level decisions: assigning aircraft families (e.g., Airbus A380 family) to flight legs. The operational level decisions are made in the second stage to efficiently assign aircraft types (e.g., Airbus A380-800 or A380-800F) to flight legs while meeting the family assignment plan developed in the first stage. Then, a sample average approximation algorithm is proposed to solve the stochastic programming problem considering risk aversion. A realistic international airline's numerical experiment is conducted to illustrate the efficiency of the proposed two-stage stochastic programming model and algorithm.

关键词： fleet assignment problem uncertain demand stochastic two-stage programming conditional value-at-risk sample average approximation

来源：评论

学校读者我要写书评

暂无评论

Car Rental Logistics problem: A Review of Literature

Car Rental Logistics Problem: A Review of Literature

引用

IEEE International Conference on Service Operations and Logistics and Informatics

作者： Yang, Yazao Jin, Wenzhou Hao, Xiaoni S China Univ Technol Inst Intelligent Transportat Syst & Logist Guangzhou Guangdong Peoples R China

ISBN: (纸本)9781424420124

This paper will introduce a special kind of logistics management problem which exists in the car rental industry. Revenue management conception has been used for reference in the car rental industry to develop booking, pricing and inventory strategies. In order to get a high degree of customer satisfaction and optimize vehicle fleet utilization, logistics managers in the car rental business approximately adopt three decision-making steps: namely, pool segmentation, strategic fleet planning and tactical fleet planning. Optimizing resource deployment and reducing the logistics cost are the targets of logistics management in enterprise. We will review the existing literature on the car rental logistics problem and identify some gaps in current research. This sort of research is prospective and useful for future development of the car rental industry.

关键词： car rental logistics optimize resource deployment revenue management demand forecast fleet assignment problem

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Flight Stringbased Ant Colony Algorithm for fleet assignment

A Dynamic Flight Stringbased Ant Colony Algorithm for Fleet ...

引用

2016 IEEE Information Technology,Networking,Electronic and Automation Control Conference(ITNEC 2016)

作者： Zhang Kang Yu Ying Wang Weijie Department of automation Shanghai University

ISBN: (纸本)9781467391955

A mathematical model with the flight string as the decision variables, aiming to minimize the number of the flights and to maximize the maintenance opportunities, is proposed in this paper, and a dynamically constructed flight string based ant colony algorithm is presented to solve the problem. A new mechanism of pheromone update is utilized in the algorithm to fasten the convergence rate. Numerical examples are extended from the small scale scheduling problems with single maintenance base to the large scale scheduling problems with multiple maintenance bases. Simulation results show that the proposed algorithm could not only solve the problem, but also improve the efficiency.

关键词： air transportation ant colony algorithm dynamically constructed flight string fleet assignment problem double objectives

来源：评论

学校读者我要写书评

暂无评论

An integrated frequency assignment and fleet assignment model: A strategic application in the Brazilian regional aviation market

Transport Economics and Management

引用

Transport Economics and Management 2023年 1卷 151-159页

作者： Thiago Dias de Jesus Marcelo Seido Nagano Victor Rafael Rezende Celestino University of São Paulo São Carlos School of Engineering Av. Trabalhador Sãocarlense 400 São Carlos SP Brazil University of Brasília Faculty of Economics Administration Accounting and Public Policy Management Asa Norte Brasília DF Brazil

Airlines endeavour to implement substantial measures to ensure profitability and maintain a competitive edge in the market. This entails conducting extensive studies and engaging in strategic planning to make optimal decisions. A crucial element of this process involves addressing the fleet assignment problem (FAP). Typically, aircraft operating within an established network are acquired before adopting this method, rather than being selected based on an optimal solution. Consequently, incumbent airlines frequently operate in Brazilian regional aviation with fleets that are not optimised for the specific routes they serve. This study aims to explore an integrated frequency assignment and fleet assignment model, which identifies the most suitable aircraft for a given network. Model parameters were estimated from historical data from multiple incumbent airlines and were applied to a fictitious airline operating from Goiania International Airport (Brazil) as the hub. The findings from multiple test runs ascertain optimal frequency and aircraft capacity selections, as well as recommended fleet sizes. Further analysis reveals, for instance, that the Embraer E190-E2 is the most suitable aircraft for a scenario constrained to a single type of fleet, demonstrating the potential for significant profitability on the routes in the simulated network.

关键词： Brazilian regional aviation fleet assignment problem Integrated airline model Mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Weekly fleet assignment Model and Algorithm

引用

Journal of Southwest Jiaotong University(English Edition) 2007年第3期15卷 231-235页

作者：朱星辉朱金福巩在武 College of Civil Aviation Nanjing University of Aeronautics and Astronautics

A 0-1 integer programming model for weekly fleet assignment was put forward based on linear network and weekly flight scheduling in China. In this model, the objective function is to maximize the total profit of fleet assignment, subject to the constraints of coverage, aircraft flow balance, fleet size, aircraft availability, aircraft usage, flight restriction, aircraft seat capacity, and stopover. Then the branch-and-bound algorithm based on special ordered set was applied to solve the model. At last, a real- wofld case study on an airline with 5 fleets, 48 aircrafts and 1 786 flight legs indicated that the profit increase was ￥ 1 591276 one week and the running time was no more than 4 rain, which shows that the model and algorithm are fairly good for domestic airline.

关键词： Flight scheduling fleet assignment problem 0-1 Integer programming model Branch-and-bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Car Rental Logistics problem:A Review of Literature

Car Rental Logistics Problem:A Review of Literature

引用

2008 IEEE International Conference on Service Operations and Logistics, and Informatics(IEEE/SOLI’2008)(IEEE服务运作、物流与信息年会)

作者： Yazao Yang Wenzhou Jin Xiaoni Hao Institute of Intelligent Transportation Systems and LogisticsSouth China University of TechnologyGua Institute of Intelligent Transportation Systems and Logistics South China University of Technology G

This paper will introduce a special kind of logistics management problem which exists in the car rental *** management conception has been used for reference in the car rental industry to develop booking,pricing and inventory *** order to get a high degree of customer satisfaction and optimize vehicle fleet utilization,logistics managers in the car rental business approximately adopt three decision-making steps: namely,pool segmentation,strategic fleet planning and tactical fleet *** resource deployment and reducing the logistics cost are the targets of logistics management in *** will review the existing literature on the car rental logistics problem and identify some gaps in current *** sort of research is prospective and useful for future development of the car rental industry.

关键词： car rental logistics optimize resource deployment revenue management demand forecast fleet assignment problem

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：