A Mathematical Programming for a Special Case of 2E-LRP in Cash-In-Transit Sector Having Rich Variants
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 includ...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Iran University of Science & Technology
2018-06-01
|
| Series: | International Journal of Industrial Engineering and Production Research |
| Subjects: | |
| Online Access: | http://ijiepr.iust.ac.ir/article-1-777-en.html |
| _version_ | 1819003527151747072 |
|---|---|
| author | alireza fallah-tafti Mohammad Ali Vahdat Zad |
| author_facet | alireza fallah-tafti Mohammad Ali Vahdat Zad |
| author_sort | alireza fallah-tafti |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-20T23:22:25Z |
| format | Article |
| id | doaj.art-0427ade04ad447f188e2ec946edede7e |
| institution | Directory Open Access Journal |
| issn | 2008-4889 2345-363X |
| language | English |
| last_indexed | 2024-12-20T23:22:25Z |
| publishDate | 2018-06-01 |
| publisher | Iran University of Science & Technology |
| record_format | Article |
| series | International Journal of Industrial Engineering and Production Research |
| spelling | doaj.art-0427ade04ad447f188e2ec946edede7e2022-12-21T19:23:28ZengIran University of Science & TechnologyInternational Journal of Industrial Engineering and Production Research2008-48892345-363X2018-06-01292159174A Mathematical Programming for a Special Case of 2E-LRP in Cash-In-Transit Sector Having Rich Variantsalireza fallah-tafti0Mohammad Ali Vahdat Zad1 PhD candidate, department of Industrial Engineering, Yazd University, Yazd, Iran Department of Industrial Engineering, Yazd University, Yazd, Iran 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.http://ijiepr.iust.ac.ir/article-1-777-en.htmltwo-echelon location-routing problemmixed integer linear programmingcash in transitmultiple objective optimizationaugmented ε-constraint method |
| spellingShingle | alireza fallah-tafti Mohammad Ali Vahdat Zad A Mathematical Programming for a Special Case of 2E-LRP in Cash-In-Transit Sector Having Rich Variants International Journal of Industrial Engineering and Production Research two-echelon location-routing problem mixed integer linear programming cash in transit multiple objective optimization augmented ε-constraint method |
| title | A Mathematical Programming for a Special Case of 2E-LRP in Cash-In-Transit Sector Having Rich Variants |
| title_full | A Mathematical Programming for a Special Case of 2E-LRP in Cash-In-Transit Sector Having Rich Variants |
| title_fullStr | A Mathematical Programming for a Special Case of 2E-LRP in Cash-In-Transit Sector Having Rich Variants |
| title_full_unstemmed | A Mathematical Programming for a Special Case of 2E-LRP in Cash-In-Transit Sector Having Rich Variants |
| title_short | A Mathematical Programming for a Special Case of 2E-LRP in Cash-In-Transit Sector Having Rich Variants |
| title_sort | mathematical programming for a special case of 2e lrp in cash in transit sector having rich variants |
| topic | two-echelon location-routing problem mixed integer linear programming cash in transit multiple objective optimization augmented ε-constraint method |
| url | http://ijiepr.iust.ac.ir/article-1-777-en.html |
| work_keys_str_mv | AT alirezafallahtafti amathematicalprogrammingforaspecialcaseof2elrpincashintransitsectorhavingrichvariants AT mohammadalivahdatzad amathematicalprogrammingforaspecialcaseof2elrpincashintransitsectorhavingrichvariants AT alirezafallahtafti mathematicalprogrammingforaspecialcaseof2elrpincashintransitsectorhavingrichvariants AT mohammadalivahdatzad mathematicalprogrammingforaspecialcaseof2elrpincashintransitsectorhavingrichvariants |