MASc Thesis Seminar | Mohammad Alqssem Alzaeem: "A Lagrangian Approach for The Airfreight Cosolidation Problem Under Pivot-weight"Export this event to calendar

Wednesday, May 9, 2018 — 10:00 AM EDT

International airfreight forwarders are faced with the problem of consolidating shipments for effcient transportation by airline carriers. The use of standard unit loading devices (ULDs) is a solution adopted by the airfreight industry to speed up cargo loading, increase safety, and protect cargo. We study the airfreight consolidation problem from the forwarders perspective where a decision on the number of ULDs used and the assignment of shipments to ULDs is optimized. The cost of using a ULD consists of a fixed charge and depends on the weight of the cargo it contains. A ULD is charged at an under-pivot rate if the total weight is below a threshold limit, called the pivot-weight. Additional weight is charged at the over-pivot rate. We propose a solution methodology based on Lagrangian relaxation that is capable of providing high quality solutions in reasonable computational times. Besides, a high-quality lower bound, we propose four heuristics to generate feasible solutions, all based on the solution of the subproblems. The first, takes the solution of one of the subproblems and solves a restricted version of the original problem (LagHeur).  Although, it yields high quality, almost optimal solutions, this approach takes long computational time. As a remedy, we restrict the solution to the root node and collect the best feasible solution that is generated (LagHeur0).  The other two heuristics are a heuristic based on solving two knapsack problems (2knap) and a best-fit greedy heuristic (best-fit). Problems with up to 80 ULDs and 400 shipments are solved to within an average of 1%, 2%, 2% of optimality in less than 5s, 10s and 400s by best-fit, 2knap and LagHeur0, respectively.

Supervisor: Samir Elhedhli

Location 
CPH - Carl A. Pollock Hall
Room 4335
200 University Avenue West

Waterloo, ON N2L 3G1
Canada

S M T W T F S
27
28
29
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
  1. 2019 (65)
    1. December (1)
    2. November (5)
    3. October (10)
    4. September (8)
    5. August (3)
    6. July (4)
    7. June (9)
    8. May (6)
    9. April (8)
    10. March (10)
    11. February (3)
    12. January (1)
  2. 2018 (43)
    1. December (3)
    2. November (4)
    3. October (5)
    4. September (4)
    5. August (1)
    6. July (3)
    7. June (5)
    8. May (3)
    9. April (6)
    10. March (5)
    11. February (3)
    12. January (1)
  3. 2017 (35)
  4. 2016 (11)
  5. 2015 (10)
  6. 2014 (19)
  7. 2013 (15)
  8. 2012 (20)