کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
477165 1446139 2009 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning
چکیده انگلیسی

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.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 199, Issue 2, 1 December 2009, Pages 553–560
نویسندگان
, , ,