Controlled time of arrival feasibility analysis

Previous research studies and operational trials have shown that using the airborne Required Time of Arrival (RTA) function, an aircraft can individually achieve an assigned time to a metering or merge point accurately. This study goes a step further and investigates the application of RTA to a real sequence of arriving aircraft into Melbourne Australia. Assuming that the actual arrival times were Controlled Time of Arrivals (CTAs) assigned to each aircraft, the study examines if the airborne RTA solution would work. Three scenarios were compared: a baseline scenario being the actual flown trajectories in a two hour time-span into Melbourne, a scenario in which the sequential landing slot times of the baseline scenario were assigned as CTAs and a third scenario in which the landing slots could be freely redistributed to the inbound traffic as CTAs. The research found that pressure on the terminal area would sometimes require aircraft to lose more time than possible through the RTA capability. Using linear holding as an additional measure to absorb extensive delays, up to 500NM (5%) of total track reduction and 1300kg (3%) of total fuel consumption could be saved in the scenario with landing slots freely distributed as CTAs, compared to the baseline scenario. Assigning CTAs in an arrival sequence requires the ground system to have an accurate trajectory predictor to propose additional delay measures (path stretching, linear holding) if necessary. Reducing the achievable time window of the aircraft to add control margin to the RTA function, had a negative impact and increased the amount of intervention other than speed control required to solve the sequence. It was concluded that the RTA capability is not a complete solution but merely a tool to assist in managing the increasing complexity of air traffic.

MILP for the inventory and routing problem for replenishment the car assembly line.

The inbound logistic for feeding the workstation inside the factory represents a critical issue in the car manufacturing industry. Nowadays, this issue is even more critical than in the past since more types of car are being produced in the assembly lines. Consequently, as workstations have to install many types of components, they also need to have an inventory of different types of the component in a compact space. The replenishment is a critical issue since a lack of inventory could cause line stoppage or reworking. On the other hand, an excess of inventory could increase the holding cost or even block the replenishment paths. The decision of the replenishment routes cannot be made without taking into consideration the inventory needed by each station during the production time which will depend on the production sequence. This problem deals with medium-sized instances and it is solved using online solvers. The contribution of this paper is a MILP for the replenishment and inventory of the components in a car assembly line.