Acceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows

سال انتشار: 1391
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 1,117

فایل این مقاله در 6 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

IIEC08_029

تاریخ نمایه سازی: 7 آذر 1391

چکیده مقاله:

The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in thevehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. Atfirst the basic cutting plane algorithm and its relationship with column generation method is clarified then the new method based on ACCPM is proposed as a stabilization technique ofcolumn generation (lagrangian relaxation). Both approaches are tested on a benchmark instance to demonstrate the advantages ofproposed method in terms of computational time and lower bounds quality

کلیدواژه ها:

lagrangian relaxation ، vehicle routing problem with time windows ، analytic center cutting plane method

نویسندگان

Hadi Karimi

Amirkabir University of Technology (Tehran Polytechnic

Abbas Seifi

Amirkabir University of Technology (Tehran Polytechnic)