جلد 29، شماره 2 - ( 3-1397 )                   جلد 29 شماره 2 صفحات 174-159 | برگشت به فهرست نسخه ها


XML English Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

fallah-tafti A, Vahdat Zad M A. A Mathematical Programming for a Special Case of 2E-LRP in Cash-In-Transit Sector Having Rich Variants. IJIEPR 2018; 29 (2) :159-174
URL: http://ijiepr.iust.ac.ir/article-1-777-fa.html
A Mathematical Programming for a Special Case of 2E-LRP in Cash-In-Transit Sector Having Rich Variants. نشریه بین المللی مهندسی صنایع و تحقیقات تولید. 1397; 29 (2) :159-174

URL: http://ijiepr.iust.ac.ir/article-1-777-fa.html


چکیده:   (4906 مشاهده)
In this article, we propose a special case of two-echelon location-routing problem (2E-LRP) in cash-in-transit (CIT) sector. To tackle this realistic problem and to make the model applicable, a rich LRP considering several existing real-life variants and characteristics named BO-2E-PCLRPSD-TW including different objective functions, multiple echelons, multiple periods, capacitated vehicles, distribution centers and automated teller machines (ATMs), different type of vehicles in each echelon, single-depot with different time windows is presented. Since, routing plans in the CIT sector ought to be safe and efficient, we consider the minimization of total transportation risk and cost simultaneously as objective functions. Then, we formulate such complex problem in mathematical mixed integer linear programming (MMILP). To validate the presented model and the formulation and to solve the problem, the latest version of ε-constraint method namely AUGMECON2 is applied. This method is especially efficient for solving multi objective integer programing (MOIP) problems and provides the exact Pareto fronts. Results substantiate the suitability of the model and the formulation.
 
     
نوع مطالعه: پژوهشي | موضوع مقاله: زنجیره تامین و لجستیک
دریافت: 1396/5/8 | پذیرش: 1397/2/16 | انتشار: 1397/2/30

ارسال نظر درباره این مقاله : نام کاربری یا پست الکترونیک شما:
CAPTCHA

بازنشر اطلاعات
Creative Commons License این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است.

کلیه حقوق این وب سایت متعلق به نشریه بین المللی مهندسی صنایع و تحقیقات تولید می باشد.

طراحی و برنامه نویسی : یکتاوب افزار شرق

© 2024 CC BY-NC 4.0 | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb