4.6 Article

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

Journal

ARTIFICIAL INTELLIGENCE REVIEW
Volume 55, Issue 8, Pages 6673-6707

Publisher

SPRINGER
DOI: 10.1007/s10462-022-10169-6

Keywords

Vehicle routing problem; Possibility theory; Choquet integral; Multi-criteria partitioning problem; Modeling of uncertainty and imprecision

Funding

  1. SRNSF (Georgia) [FR-21-2015]

Ask authors/readers for more resources

This paper presents a new approach to solve vehicle routing problems under extreme conditions, aiming to minimize decision-making risks through fuzzy modeling and bi-criteria partitioning model. Experimental results show that the proposed method can find all Pareto-optimal solutions from promising routes.
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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available