A new column generation algorithm for a reverse logistics model

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

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

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

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

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

NCLSC04_029

تاریخ نمایه سازی: 24 مهر 1391

چکیده مقاله:

One of the basic models in reverse logistics is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD). In this problem a fleet of vehicles with limited capacity should service some customers by delivering required goods and collecting used products in the same time. We have proposed a column generation algorithm for this problem based on the analytic center cutting plane method (ACCPM). This procedure gives us an efficient lower bound which could be used in more general frameworks like branch-and-price. This algorithm is compared with classical approach of column generation and the results demonstrate its superiority in stability and computational time

کلیدواژه ها:

reverse logistics ، vehicle routing ، column generation ، analytic center cutting plane methods

نویسندگان

Hadi Karimi,

Department of Industrial Engineering, Amirkabir University of Technology (Tehran Polytechnic

مراجع و منابع این مقاله:

لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :
  • Fleischmann M., Bloem hof-Ruwaard _ M., Dekker R., van der ...
  • Min H, The multiple vehicle routing problem with simultaneous delivery ...
  • Casco D.O., Golden B.L., Wasil E.A., Vehicle routing with backhauls: ...
  • Clark G., Wright J., Scheduling of vehicles from a central ...
  • Salhi S., Nagy G., Acluster insertion heuristic for single and ...
  • Dethloff J., Vehicle routing and reverse logistics: the vehicle routing ...
  • Chen J. F., Wu T. H., Vehicle routing problem with ...
  • Bianchessi N., Righini G., Heuristic algorithms for the vehicle routing ...
  • Nagy G., Salhi S., Heuristic algorithms for single and multiple ...
  • Montane F. A. T., Galvao R. D., A tabu search ...
  • www. i Iscs-conf. ir info@i Iscs-conf. ir 22 - 23 ...
  • Tang F. A., Galvao R. D., Vehicle routing problems with ...
  • Subramanian A., Drummond L. M. A., Bentes C., Ochi L. ...
  • Zachariadis E. E., Kiranoudis C. T., A local search metaheuristio ...
  • Angelelli E., Mansini R., The vehicle routing problem with time ...
  • Dell'Amico M., Righini G., Salani M., A bra nch-and-price approach ...
  • Subramanian A., Uchoa E., Ochi L. S., New lower bounds ...
  • International Symposium _ Experimental Algorithms (SEA). Lect. Notes in Comp. ...
  • Subramanian A., Uchoa E., Pessoa A. A., Ochi L. S., ...
  • Goffin J.-L., Haurie A., Vial J.-Ph., Decom position and nond ...
  • Elhedhli S., Gzara F., Integrated design of supply chain networks ...
  • Babonneau F., du Merle O., Vial J.-P., Solving large scale ...
  • Goffin J.-L, Vial J.-Ph., Convex nond fferentiable optimization: a survey ...
  • Gavish B., Graves S., The traveling salesman problem and related ...
  • Desaulniers G, Desrosiers J, Solomon MM (eds) Column generation. GERAD ...
  • Kelley J. E., The cutting plane method for solving _ ...
  • Desrosiers J., Lubbecke M.E., Selected topics in column generation. Oper. ...
  • www. i Iscs-conf. ir info@i Iscs-conf. ir 22 - 23 ...
  • www. i Iscs-conf. ir info@i Iscs-conf. ir 22 - 23 ...
  • نمایش کامل مراجع