Gia Sirbiladze, Bezhan Ghvaberidze, Bidzina Midodashvili, Bidzina Matsaberidze, Irina Khutsishvili
{"title":"A new fuzzy approach of vehicle routing problem for disaster-stricken zones","authors":"Gia Sirbiladze, Bezhan Ghvaberidze, Bidzina Midodashvili, Bidzina Matsaberidze, Irina Khutsishvili","doi":"10.1515/gmj-2023-2097","DOIUrl":null,"url":null,"abstract":"Route planning problems are among the activities that have the highest impact in emergency logistical planning, goods transportation and facility location-distribution because of their effects on efficiency in resource management, service levels and client satisfaction. In the extreme conditions, such as disaster-stricken zones, the difficulty of vehicle movement between nearest different affected areas (demand points) on planning routes cause the imprecision of time of movement and the uncertainty of feasibility of movement. In this paper, the imprecision is presented by triangular fuzzy numbers and the uncertainty is presented by a possibility measure. A new two-stage, fuzzy bi-criterion optimization approach for the vehicle routing problem (VRP) is considered. On the first stage, the sample of so-called “promising” closed routes are selected based on a “constructive” approach. On the second stage, triangular fuzzy valued Choquet aggregation (TFCA) operator is constructed for the selected closed routes. The evaluation of constructed routes, levels of failure and possibility of vehicle movement on the roads are aggregated by the TFCA operator by the new criterion – minimization of infeasibility of movement. The new criterion together with the classic criterion – minimization of the total distance traveled – creates a bi-criteria fuzzy VRP. The constructed VRP is reduced to the bi-criteria fuzzy partitioning problem, and an 𝜀-constraint approach is developed for solving it. For numerical experiments, a parallel algorithm is created on the basis of D. Knuth’s algorithm of Dancing Links (DLX). An example is presented with the results of our approach for the VRP, where all Pareto-optimal solutions are found from the set of promising routes. The optimal solutions tend to avoid roads that are problematic because of extreme situations.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1515/gmj-2023-2097","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Route planning problems are among the activities that have the highest impact in emergency logistical planning, goods transportation and facility location-distribution because of their effects on efficiency in resource management, service levels and client satisfaction. In the extreme conditions, such as disaster-stricken zones, the difficulty of vehicle movement between nearest different affected areas (demand points) on planning routes cause the imprecision of time of movement and the uncertainty of feasibility of movement. In this paper, the imprecision is presented by triangular fuzzy numbers and the uncertainty is presented by a possibility measure. A new two-stage, fuzzy bi-criterion optimization approach for the vehicle routing problem (VRP) is considered. On the first stage, the sample of so-called “promising” closed routes are selected based on a “constructive” approach. On the second stage, triangular fuzzy valued Choquet aggregation (TFCA) operator is constructed for the selected closed routes. The evaluation of constructed routes, levels of failure and possibility of vehicle movement on the roads are aggregated by the TFCA operator by the new criterion – minimization of infeasibility of movement. The new criterion together with the classic criterion – minimization of the total distance traveled – creates a bi-criteria fuzzy VRP. The constructed VRP is reduced to the bi-criteria fuzzy partitioning problem, and an 𝜀-constraint approach is developed for solving it. For numerical experiments, a parallel algorithm is created on the basis of D. Knuth’s algorithm of Dancing Links (DLX). An example is presented with the results of our approach for the VRP, where all Pareto-optimal solutions are found from the set of promising routes. The optimal solutions tend to avoid roads that are problematic because of extreme situations.