A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning

The air-cargo consolidation problem with pivot weight: Models and solution methods

“…This follows the same assumption of Li et al [10], based on the fact that the aggregate cargo weight of a ULD in an ideal plan should be around its pivot weight; the airfreight forwarder tries to achieve this when reserving the capacity.…”

“…In this paper, we provide two formulations. One is very similar to the model of Li et al [10] but eliminates a redundant constraint, and the other is based on column generation. We then propose four solution methodologies to solve the problem that we test and compare.…”

“…Other than Li et al [10], the pivot-weight scheme has not been investigated before. There is, however, some research on the ocean counterpart that addresses the loading problem based on 20-foot containers.…”

“…And rather than benefiting from a discount for larger loads, the forwarder will, as noted, pay a penalty when the weight exceeds U j . The ACPW problem thus models a practical situation that, other than Li et al [10], has previously received limited study. Li et al [10] give a detailed description of the problem and propose a large-scale neighborhood search heuristic to solve it.…”

“…The ACPW problem thus models a practical situation that, other than Li et al [10], has previously received limited study. Li et al [10] give a detailed description of the problem and propose a large-scale neighborhood search heuristic to solve it. In this paper, we provide two formulations.…”