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

DOI10.1016/j.ejor.2008.11.033zbMath1176.90661OpenAlexW2066282788MaRDI QIDQ1042176

Yi Tao, Yanzhi Li, Fan Wang

Publication date: 7 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.11.033

zbMATH Keywords

decision support systemsheuristicscargo loading problemlarge-scale neighborhood search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Tying mechanism for airlines' air cargo capacity allocation ⋮ The airline container loading problem with pickup and delivery ⋮ The air-cargo consolidation problem with pivot weight: models and solution methods ⋮ Airfreight forwarder's shipment planning: shipment consolidation and containerization

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of very large-scale neighborhood search techniques
• A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach
• Weight distribution considerations in container loading
• Loading plates with non-identical items
• Packing problems
• A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
• Solving the pallet loading problem
• On solving multiobjective bin packing problems using evolutionary particle swarm optimization
• Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
• The Three-Dimensional Bin Packing Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem