Given the sets of flights and aircraft of an airline carrier, the fleet assignment problem consists in assigning the most profitable aircraft type to each flight. An extension to this problem is to allow for some flexibility on flight departure times. These time adjustments increase the number of possible connections and therefore improve the solution quality in terms of profits or in the reduc...

The Rental Fleet Scheduling Problem (RFSP) arises in vehicle rental operations that offer a wide variety of vehicle types to customers, and allow a rented vehicle to “migrate” to a setdown depot other than the pickup depot. When there is a shortage of vehicles of a particular type at a depot, vehicles may be relocated to that depot, or vehicles of similar types may be substituted. The RFSP invo...

This paper compares technologies for a dynamic truckload pickup and delivery problem in a competitive environment using sequential auctions. In this environment, demands arrive randomly over time and are described by pick up, delivery locations and hard timewindows. Upon demand arrival, carriers compete for the loads in a second price auction. Four fleet assignment technologies with different d...

In this paper we present methodologies for improving the demand-responsiveness of air transportation systems. The main ingredients are the flexibility in transportation capacity provided by an innovative aircraft and an integrated model where supply-demand interactions are explicitly formulated. The integrated model benefits from the simultaneous schedule planning and revenue management decisio...

This thesis addresses the decentralized task assignment problem in cooperative autonomous search and track missions by presenting the Consensus-Based class of assignment algorithms. These algorithm make use of information consensus routines to converge on the assignment rather than the situational awareness of the fleet. A market-based approach is used as the mechanism for task selection, while...

<span lang="EN-US">Airline fleet assignment is the process of allocating different types aircraft to scheduled flight legs in order reduce operating costs and increase revenue. In this research, flights data records from Egypt Air airlines was employed build an intelligent model predict optimal type for new flights. Deep neural network (DNN) support vector machines (SVM) used formulations...

assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. in this study, we solve quadratic assignment problem (qap), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. it should be noted that any facility must be assign to only one location. in this paper, first o...

This paper introduces a new type of constraints, related to schedule synchronization, in the problem formulation of aircraft ̄eet assignment and routing problems and it proposes an optimal solution approach. This approach is based on Dantzig±Wolfe decomposition/column generation. The resulting master problem consists of ̄ight covering constraints, as in usual applications, and of schedule synch...

It was recently demonstrated that a well-known eigenvalue bound for the Quadratic Assignment Problem (QAP) actually corresponds to a semideenite programming (SDP) relaxation. However, for this bound to be computationally useful the assignment constraints of the QAP must rst be eliminated, and the bound then applied to a lower-dimensional problem. The resulting \projected eigenvalue bound" is on...