Abstract

International audience .The sharp increase in air traffic flow causes traffic congestion in airspaces near airports, called Terminal Maneuvering Areas (TMA). The departure and arrival traffic of airports follow pre-designed routes named Standard Instrument Departure (SID) routes and Standard Terminal Arrival Routes (STAR). Optimizing these routes is crucial to regulate air traffic. Currently, SIDs and STARs are designed manually, based on the airport layout and nearby constraints. The objective of this research is to propose a methodology for designing an arrival/departure route in TMA, taking into account some constraints including obstacle avoidance. The shape of a route in horizontal plan is a succession of arcs of circles and segments. The originality of our study is, on the one hand, that the horizontal route is associated with a cone in vertical plan enveloping all ascent (or descent) aircraft profiles, and on the other hand, a branching strategy in a Branch and Bound (B\\&B) framework tailored on the problem is proposed. Document type: Part of book or chapter of book

Abstract

In this paper we consider the problem of shipping several products from an origin to a destination, when a discrete set of shipping frequencies is available only, in such a way that the sum of the transportation and inventory cost is minimized This problem, which is known to be NP-hard, has applications in transportation planning and in location analysis. We derive some dominance rules for the problem solutions which allow to tighten the bounds on the problem variables. Moreover, we present a branch-and-bound algorithm and we evaluate its performance on randomly generated problem instances. Document type: Part of book or chapter of book