Volume 29, Issue 2 (IJIEPR 2018)                   IJIEPR 2018, 29(2): 159-174 | Back to browse issues page

XML 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-en.html
A Mathematical Programming for a Special Case of 2E-LRP in Cash-In-Transit Sector Having Rich Variants
Alireza Fallah-tafti1 , Mohammad Ali Vahdat Zad 2
1- PhD candidate, department of Industrial Engineering, Yazd University, Yazd, Iran
2- Department of Industrial Engineering, Yazd University, Yazd, Iran , mvahdat@yazd.ac.ir
Abstract:   (5115 Views)
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.
 
Keywords: two-echelon location-routing problem, mixed integer linear programming, cash in transit, multiple objective optimization, augmented ε-constraint method
Full-Text [PDF 1071 kb]   (3394 Downloads)    
Highlights
  • Propose a special case of 2E-LRP in cash-in-transit sector combining multiple real-life variants such as multi-echelon, multi-period, capacitated vehicles and distribution centers, different time windows and different conflict objective functions to tackle realistic problems. Then, a mathematical mixed-integer linear programming for this rich LRP is formulated. To the best of our knowledge, this is the first mandatory step to apply the model in real-life problems and, on the other hand, a model with just few constraints even with the best solution approaches cannot be applicable in real-world problems.
  • Exploit a solution approach for optimizing the multi-objective mixed integer linear problem with large integer coefficients in order to find the location and number of intermediate facilities among candidate ones, the number of vehicles in each type and in each echelon, the amount of commodities received from the Central Bank and delivered to open logistics center and bank branches/ATMs.

Type of Study: Research | Subject: Logistic & Apply Chain
Received: 2017/07/30 | Accepted: 2018/05/6 | Published: 2018/05/20
Add your comments about this article : Your username or Email:
CAPTCHA
Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.