Fermatean Fuzzy Multiple Vehicle Routing Problem with Profits

EasyChair Preprint no. 8214

Abstract

In real life, while modeling and solving the “Vehicle Routing Problem with Profits (VRPP)” we often face a state of uncertainty as well as hesitation due to various qualitative and quantitative factors. To deal with such situations, in this paper, we propose “Fermatean Fuzzy Multiple Vehicle Routing Problem With-Profits (FFMVRPP)” in which we have considered the profits, and expenses as Fermatean Fuzzy (FF) values and have included qualitative
factors like ‘Relation of the customer with the seller’, ‘risk of transporting from one node to another to make our model more realistic. The paper includes the mathematical formulation of the FFMVRPP and proposed algorithms
to solve them. We propose Fermatean Fuzzy Clarke and Wright’s saving algorithm( FFCWA), Fermatean Fuzzy Nearest Neighbourhood algorithm, and Nearest Neighborhood + Brute Force algorithm (Group First and brute second). An example is also stated to elaborate on the given methods and ultimately we will conclude with the advantages of a FFMVRPP over the classical VVRP along with the references.

Keyphrases: Clarke and Wright’s saving algorithm, Fermatean Fuzzy Multiple Vehicle Routing Problem with Profits, Fermatean Fuzzy Sets, Nearest Neighborhood + Brute Force algorithm., Nearest Neighbourhood algorithm, vehicle routing problem with profits

@Booklet{EasyChair:8214,
  author = {Vishnu Singh and Biswajeet Singh},
  title = {Fermatean Fuzzy Multiple Vehicle Routing Problem with Profits},
  howpublished = {EasyChair Preprint no. 8214},

  year = {EasyChair, 2022}}