Uncertainty modeling in multi-objective vehicle routing problem under extreme environment

被引:0
作者
Gia Sirbiladze
Harish Garg
Bezhan Ghvaberidze
Bidzina Matsaberidze
Irina Khutsishvili
Bidzina Midodashvili
机构
[1] Iv. Javakhishvili Tbilisi State University,Department of Computer Sciences, Faculty of Exact and Natural Sciences
[2] Deemed University,School of Mathematics, Thapar Institute of Engineering and Technology
来源
Artificial Intelligence Review | 2022年 / 55卷
关键词
Vehicle routing problem; Possibility theory; Choquet integral; Multi-criteria partitioning problem; Modeling of uncertainty and imprecision;
D O I
暂无
中图分类号
学科分类号
摘要
Assumption of fuzziness in the vehicle routing problems under extreme conditions is necessary for modelers, because there are usually insufficient objective input data. In extreme situations, the complexity of the description of vehicles’ movement on routes may cause by two poles: the imprecision of movement time and the uncertainty of the possibility of movement on roads. Traditionally, a fuzzy value has been used to represent the data’s impreciseness; hence, only one pole of expert’s information is taken in the aggregation results. The main objective of this paper is to present an efficient way for fuzzy vehicle routing modeling to minimize the decision-making risks in the optimal planning of routes network and from distribution centers to demand points. To address this, a new two-stage possibilistic bi-criteria vehicle routing problem (VRP) is presented under extreme conditions. In the first stage, the sample of so-called “promising” closed routes are selected based on a “constructive” approach using a simulation algorithm. The expected times of the vehicle movement between demand points are taken as fuzzy triangular numbers. In the second stage, based on Choquet integral’s, a bi-criteria partitioning model for the fuzzy VRP has been constructed. The constraint approach has been defined to obtain the optimal solution of the model. For numerical experiments, a parallel algorithm is created based on D. Knuth’s algorithm of dancing links. An example is presented with the results of our approach for the VRP, where all Pareto-optimal solutions are found from the promising routes.
引用
收藏
页码:6673 / 6707
页数:34
相关论文
共 50 条
[21]   MULTI-OBJECTIVE OPTIMIZATION FOR SUSTAINABLE VEHICLE ROUTING PROBLEM UNDER UNCERTAINTY USING THE L AGRANGIAN RELAXATION ALGORITHM-CASE : FOOD INDUSTRY COMPANY [J].
Aghaabdollahian, Behnaz ;
Javadi, Babak ;
Abdali, Mohammadreza .
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2024, 31 (05) :1152-1175
[22]   Closed-loop multi-objective waste management through vehicle routing problem in neutrosophic hesitant fuzzy environment [J].
Ghosh, Shyamali ;
Roy, Sankar Kumar .
APPLIED SOFT COMPUTING, 2023, 148
[23]   A Recourse Stochastic Goal Programming Approach for the Multi-objective Stochastic Vehicle Routing Problem [J].
Masri, Hatem ;
Ben Abdelaziz, Fouad ;
Alaya, Houda .
JOURNAL OF MULTI-CRITERIA DECISION ANALYSIS, 2016, 23 (1-2) :3-14
[24]   Metaheuristic algorithm for solving the multi-objective vehicle routing problem with time window and drones [J].
Han, Yun-qi ;
Li, Jun-qing ;
Liu, Zhengmin ;
Liu, Chuang ;
Tian, Jie .
INTERNATIONAL JOURNAL OF ADVANCED ROBOTIC SYSTEMS, 2020, 17 (02)
[25]   Acceleration of Neighborhood Evaluation for a Multi-objective Vehicle Routing [J].
Jagiello, Szymon ;
Rudy, Jaroslaw ;
Zelazny, Dominik .
ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, PT II (ICAISC 2015), 2015, 9120 :202-213
[26]   Solving Vehicle Routing Problem with Stochastic Demand Using Multi-objective Evolutionary Algorithm [J].
Jiang, Jing ;
Gee, Sen Bong ;
Arokiasami, Willson Amalraj ;
Tan, Kay Chen .
2014 INTERNATIONAL CONFERENCE ON SOFT COMPUTING & MACHINE INTELLIGENCE ISCMI 2014, 2014, :121-125
[27]   Multi-Objective Robust Optimisation Method for Stochastic Time-Dependent Vehicle Routing Problem [J].
Duan Z. ;
Lei Z. ;
Sun S. ;
Yang D. .
Xinan Jiaotong Daxue Xuebao/Journal of Southwest Jiaotong University, 2019, 54 (03) :565-572
[28]   Exact and metaheuristic algorithms for the vehicle routing problem with a factory-in-a-box in multi-objective settings [J].
Pasha, Junayed ;
Nwodu, Arriana L. ;
Fathollahi-Fard, Amir M. ;
Tian, Guangdong ;
Li, Zhiwu ;
Wang, Hui ;
Dulebenets, Maxim A. .
ADVANCED ENGINEERING INFORMATICS, 2022, 52
[29]   An improved ant colony algorithm for multi-objective vehicle routing problem with simultaneous pickup and delivery [J].
Chen X.-Q. ;
Hu D.-W. ;
Yang Q.-Q. ;
Hu H. ;
Gao Y. .
Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2018, 35 (09) :1347-1356
[30]   Multi-objective optimisation for sustainable few-to-many pickup and delivery vehicle routing problem [J].
Pilati, Francesco ;
Tronconi, Riccardo .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2024, 62 (09) :3146-3175