Acceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows
سال انتشار: 1391
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 689
فایل این مقاله در 7 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_IJIEPR-23-4_009
تاریخ نمایه سازی: 7 شهریور 1393
چکیده مقاله:
The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper, ACCPM is used to accelerate Lagrangian relaxation procedure for solving a vehicle routing problem with time windows (VRPTW). First, a basic cutting plane algorithm and its relationship with a column generation technique is clarified. Then, the proposed method based on ACCPM is explained as a stabilization technique for Lagrangian relaxation. Both approaches are tested on a benchmark instance to demonstrate the advantages of the proposed method in terms of computational time and quality of lower bounds.
کلیدواژه ها:
lagrangian relaxation ، vehicle routing problem with time windows ، analytic center cutting plane method