• Aucun résultat trouvé

The Airline Container Loading Problem with Pickup and Delivery

N/A
N/A
Protected

Academic year: 2021

Partager "The Airline Container Loading Problem with Pickup and Delivery"

Copied!
1
0
0

Texte intégral

(1)

A Container Assignment Problem with Pickup and Delivery

V. Lurkin and M. Schyns1

QuantOM, HEC Management School, University of Liège, Rue Louvrex 14 (N1), 4000 Liège, Belgium. [vlurkin@ulg.ac.be ; M.Schyns@ulg.ac.be.]

Keywords : assignment problem, weight and balance, Integer Linear Problem, reallocation,

pickup and delivery

1

Abstract

We address the problem of allocating containers into predefined positions of a carrier, in this case aircraft, under several realistic structural and safety constraints. The originality of our approach is to allow multi-trips with pickup and delivery at some intermediate locations. The objective is to minimize the economic and environmental costs including the impact of the intermediate operations. We resort to an integer linear model. Numerical experiments have been performed using a standard B&C library. Heuristics are developed to speed up the process.

Références

[1] Limbourg, S., Schyns, M., and Laporte, G. (2011). Automatic Aircraft Cargo Load Plan-ning. Journal of the Operational Research Society

[2] William S. Swelbar (2010). The Future Economics of the Airline Industry, A Changing Vernacular. MIT International Center for Air Transportation.

[3] Abdelghany, A. and Abdelghany, K. (2009). Modeling Applications in the Airline Industry.

Ashgate Publishing, Ltd.

[4] Bonnet C. (2009). Optimum CG position, What is the best CG position for an aircraft ?

Proceedings of the 16th Performance and Operations conference, Paris.

[5] Souffriau, W., Demeester, P. and Vanden Berghe, G. and De Causmaecker,P. (2008). The Aircraft Weight and Balance Problem. Proceedings of ORBEL 22, Brussels, pp. 44–45. [6] International Air Transport Association (IATA) (2004). Getting to grips with fuel economy

(Airbus report).

[7] Fok, K. and Chun A. (2004). Optimizing Air Cargo Load Planning and Analysis.

Procee-dings of the International Conference on Computing, Communications and Control Tech-nologies, Austin, Texas, USA.

[8] Mongeau, M. and Bès, C. (2003). Optimization of Aircraft Container Loading, IEEE

Tran-sactions on Aerospace and Electronic Systems, Vol. 39, pp. 140–150.

[9] Heidelberg, K.R., Parnell, G.S. and Ames, J.E. (1998). Automated Air Load Planning.

Naval Research Logistics, Vol. 45, pp.751–768.

[10] Ng, K.Y.K. (1992). A multicriteria optimization approach to aircraft loading. IEEE

Références

Documents relatifs

Other problems derived from LRP-2E are considered in the literature, such as, (i) Two-Echelon vehicle routing problem (VRP-2E) when there is no fixed cost for using depots

According to the Table 4 and “Open depot” column, we found out that CPLEX and solution algorithms have led to the different location of depots because in

A feasible loading is defined as follows: first, it must satisfy the packing con- straint, items cannot overlap each other and they must fit completely into the vehicle; second,

In this section we describe our additive branch-and-bound algorithm for the TSPPDL. The three main aspects of a branch-and-bound algorithm are i) the branching strategy (i.e.

Time preproc., time spent on preprocessing, this includes the time spent tightening time windows (see Section 6.4) and calculating the sets A + i and A − i needed for the

The goal is to design a least-cost route for the vehicle, starting from and ending at a central depot, that serves all customer requests while satisfying the side constraints,

Assume that the instance I 0 is feasible. We first show that all precedence constraints between pickups and deliveries are respected using the given order of the partial routes.

Here, we show the number of stacks (M ), the capacity of each stack (Q), the number of nodes (n), the number of solved instances (Solved ), the average gap for unsolved instances