Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 199, Issue 2, Pages 553-560Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2008.11.033
Keywords
Cargo loading problem; Large-scale neighborhood search; Heuristics; Decision support systems
Funding
- City University of Hong Kong [7002352]
- National Natural Science Foundation of China [60704048]
Ask authors/readers for more resources
Cost effectiveness is central to the air freight forwarders. In this work, we study how an air freight forwarder should plan its cargo loading in order to minimize the total freight cost given a limited number of rented containers. To solve the problem efficiently for practical implementation, we propose a new large-scale neighborhood search heuristic. The proposed large-scale neighborhood relaxes the subset-disjoint restriction made in the existing literature; the relaxation risks a possibility of infeasible exchanges while at the same time it avoids the potentially large amount of checking effort required to enforce the subset-disjoint restriction. An efficient procedure is then used to search for improvement in the neighborhood. We have also proposed a subproblem to address the difficulties caused by the fixed charges. The compromised large-scale neighborhood (CLSN) search heuristic has shown stably superior performance when compared with the traditional large-scale neighborhood search and the mixed integer programming model. (C) 2008 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available