Skip to main content
SpringerLink
Log in

Solving capacitated vehicle routing problem with demands as fuzzy random variable

  • Optimization
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Capacitated vehicle routing problem (CVRP) is a classical combinatorial optimization problem in which a network of customers with specified demands is given. The objective is to find a set of routes which originates as well as terminates at the depot node. These routes are to be traversed in such a way that the demands of all the customers in the network are satisfied and the cost associated with traversal of these routes come out to be a minimum. In real-world situations, the demand of any commodity depends upon various uncontrollable factors, such as season, delivery time, and market conditions. Due to these factors, the demand can always not be told in advance and a precise information about the demand is nearly impossible to achieve. Hence, the demands of the customers always experience impreciseness and randomness in real life. The decisions made by the customers about the demands may also have some scope of hesitation as well. In order to handle such demands of customers in the network, fuzzy random variables and intuitionistic fuzzy random variables are used in this work. The work bridges the gap between the classical version of CVRP and the real-life situation and hence makes it easier for the logistic management companies to determine the routes that should be followed for minimum operational cost and maximum profit. Mathematical models corresponding to CVRP with fuzzy stochastic demands (CVRPFSD) and CVRP with intuitionistic fuzzy stochastic demands (CVRPIFSD) have been presented. A two-stage model has been proposed to find out the solution for the same. To explain the working of the methodology defined in this work, different examples of networks with fuzzy and intuitionistic fuzzy demands have been worked out. The proposed solution approach is also tested on modified fuzzy stochastic versions of some benchmark instances.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

Data availability

The datasets generated during and/or analysed during the current study are available at http://vrp.atd-lab.inf.puc-rio.br/index.php/en/.

Code availability

Codes are available from the corresponding author on reasonable request.

References

  • Atanassov K (2016) Intuitionistic fuzzy sets. Int. J. Bioautom. 20(S1):S1–S6

    MathSciNet  Google Scholar 

  • Awad H, Elshaer R, AbdElmo’ez A, Nawara G (2018) An effective genetic algorithm for capacitated vehicle routing problem. In: Proceedings of the international conference on industrial engineering and operations management, pp 374–384

  • Barma PS, Dutta J, Mukherjee A, Kar S (2021) A hybrid GA-BFO algorithm for the profit-maximizing capacitated vehicle routing problem under uncertain paradigm. J Intell Fuzzy Syst 40(5):8709–8725

  • Bernardo M, Pannek J (2018) Robust solution approach for the dynamic and stochastic vehicle routing problem. J Adv Transp 2018(1):1–11

    Article  Google Scholar 

  • Brito J, Martínez FJ, Moreno JA, Verdegay JL (2010) Fuzzy approach for vehicle routing problems with fuzzy travel time. In: International conference on fuzzy systems. IEEE, pp 1–8

  • Chiao KP (2015) Ranking type 2 fuzzy sets by parametric embedded representation. In: 2015 international conference on machine learning and cybernetics (ICMLC), vol 1. IEEE, pp 371–376

  • Chiao KP (2016) Ranking interval type 2 fuzzy sets using parametric graded mean integration representation. In: 2016 international conference on machine learning and cybernetics (ICMLC), vol 2. IEEE, pp 606–611

  • Christiansen CH, Lysgaard J (2007) A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands. Oper Res Lett 35(6):773–781

    Article  MathSciNet  MATH  Google Scholar 

  • Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12(4):568–581

    Article  Google Scholar 

  • Cordeau JF, Laporte G, Savelsbergh MW, Vigo D (2007) Vehicle routing. Handb Oper Res Manag Sci 14:367–428

    Google Scholar 

  • Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms. MIT Press

  • Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manage Sci 6(1):80–91

    Article  MathSciNet  MATH  Google Scholar 

  • Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28–39

    Article  Google Scholar 

  • Dror M, Laporte G, Trudeau P (1989) Vehicle routing with stochastic demands: properties and solution frameworks. Transp Sci 23(3):166–176

    Article  MathSciNet  MATH  Google Scholar 

  • Dutta J, Barma PS, Mukherjee A, Kar S, De T, Pamušar D, Šukevičius Š, Garbinčius G (2022) Multi-objective green mixed vehicle routing problem under rough environment. Transport 37(1):51–63

  • Fang L, Chen P, Liu S (2007) Particle swarm optimization with simulated annealing for tsp. In: Proceedings of the 6th wseas international conference on artificial intelligence, knowledge engineering and data bases. Citeseer, pp 206–210

  • Frieze AM (1983) An extension of christofides heuristic to the k-person travelling salesman problem. Discret Appl Math 6(1):79–83

    Article  MathSciNet  MATH  Google Scholar 

  • Gauvin C, Desaulniers G, Gendreau M (2014) A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands. Comput Oper Res 50:141–153

    Article  MathSciNet  MATH  Google Scholar 

  • Gendreau M, Laporte G, Séguin R (1996) Stochastic vehicle routing. Eur J Oper Res 88(1):3–12

    Article  MATH  Google Scholar 

  • Gultom P, Napitupulu N (2020) The development of algorithm for determining optimal route for distribution of goods based on distance, time, and road quality using fuzzy set and Clarke and algorithm Wright savings. In: Journal of physics: conference series, vol 1542. IOP Publishing, pp 1–9

  • Gupta P, Govindan K, Mehlawat MK, Khaitan A. (2022) Multiobjective capacitated green vehicle routing problem with fuzzy time-distances and demands split into bags. Int J Prod Res 60(8):2369–2385

  • Irvanizam I, Usman T, Iqbal M, Iskandar T, Marzuki M (2020) An extended fuzzy todim approach for multiple-attribute decision-making with dual-connection numbers. Adv Fuzzy Syst 2020(1):1–10

    MathSciNet  MATH  Google Scholar 

  • Kandasamy V, Ilanthenral K, Smarandache F (2015) Neutrosophic graphs: a new dimension to graph theory. Infinite Study

  • Kaur H, Singh H (2017) Local search based algorithm for CVRP with stochastic demands. Int J Adv Res Comput Sci 8(7):1087–1092

    Article  Google Scholar 

  • Kondratenko Y, Kondratenko G, Sidenko I, Taranov M (2020) Fuzzy and evolutionary algorithms for transport logistics under uncertainty. In: International conference on intelligent and fuzzy systems. Springer, pp 1456–1463

  • Kuo R, Zulvia FE, Suryadi K (2012) Hybrid particle swarm optimization with genetic algorithm for solving capacitated vehicle routing problem with fuzzy demand-a case study on garbage collection system. Appl Math Comput 219(5):2574–2588

    MathSciNet  MATH  Google Scholar 

  • Laporte G, Nobert Y (1987) Exact algorithms for the vehicle routing problem. In: North-Holland mathematics studies, vol 132. Elsevier, pp 147–184

  • Marković D, Petrovć G, Ćojbašić Ž, Stanković A (2020) The vehicle routing problem with stochastic demands in an urban area—a case study. Facta Univer, Ser: Mech Eng 18(1):107–120

    Google Scholar 

  • Mirzaei-khafri S, Bashiri M, Soltani R et al (2020) A robust optimization model for a location-arc routing problem with demand uncertainty. Int J Ind Eng 27(2):288–307

    Google Scholar 

  • Mohammed MA, Ahmad MS, Mostafa SA (2012) Using genetic algorithm in implementing capacitated vehicle routing problem. In: 2012 International conference on computer and information science (ICCIS), vol 1. IEEE, pp 257–262

  • Oyola J (2019) The capacitated vehicle routing problem with soft time windows and stochastic travel times. Rev Facult Ingen 28(50):19–33

    Article  Google Scholar 

  • Pop PC, Zelina I, Lupşe V, Sitar CP, Chira C (2011) Heuristic algorithms for solving the generalized vehicle routing problem. Int J Comput Commun Control 6(1):158–165

    Article  Google Scholar 

  • Puri ML, Ralescu DA, Zadeh L (1993) Fuzzy random variables. In: Readings in fuzzy sets for intelligent systems. Elsevier, pp 265–271

  • Russell SJ, Norvig P (2016) Artificial intelligence: a modern approach. Pearson Education Limited, Malaysia

    MATH  Google Scholar 

  • Shalaby MAW, Mohammed AR, Kassem S (2020) Modified fuzzy c-means clustering approach to solve the capacitated vehicle routing problem. In: 2020 21st international Arab conference on information technology (ACIT). IEEE, pp 1–7

  • Singh SK, Yadav SP (2018) Intuitionistic fuzzy multi-objective linear programming problem with various membership functions. Ann Oper Res 269(1–2):693–707

    Article  MathSciNet  MATH  Google Scholar 

  • Singh V, Sharma K (2020) Capacitated vehicle routing problem with interval type-2 fuzzy demands. In: Advances in mechanical engineering. Springer, pp 83–89

  • Tordecilla RD, Martins LDC, Panadero J, Copado PJ, Perez-Bernabeu E, Juan AA (2021) Fuzzy simheuristics for optimizing transportation systems: dealing with stochastic and fuzzy uncertainty. Appl Sci 11(17):7950

  • Toth P, Vigo D (2002) The vehicle routing problem. SIAM

  • Úbeda S, Faulin J, Serrano A, Arcelus FJ (2014) Solving the green capacitated vehicle routing problem using a Tabu search algorithm. Lect Notes Manag Sci 6(1):141–149

    Google Scholar 

  • Werners B, Drawe M (2003) Capacitated vehicle routing problem with fuzzy demand. In: Fuzzy sets based heuristics for optimization. Springer, pp 317–335

  • Xia X, Liao W, Zhang Y, Peng X (2021) A discrete spider monkey optimization for the vehicle routing problem with stochastic demands. Appl Soft Comput 111(1):1–13

    Google Scholar 

  • Zimmermann HJ (2011) Fuzzy set theory-and its applications. Springer

  • Zulvia FE, Kuo R, Hu TL (2012) Solving CVRP with time window, fuzzy travel time and demand via a hybrid ant colony optimization and genetic algorithm. In: 2012 IEEE congress on evolutionary computation. IEEE, pp 1–8

Download references

Funding

This research is supported by VNIT Nagpur.

Author information

Authors and Affiliations

  1. Department of Mathematics, Visvesvaraya National Institute of Technology, Nagpur, India

    V. P. Singh & Kirti Sharma

  2. Department of Mathematics, Indian Institute of Technology, Kharagpur, India

    Debjani Chakraborty

Authors
  1. V. P. Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kirti Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Debjani Chakraborty
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. P. Singh.

Ethics declarations

Conflict of interest

The authors state that there is no conflict of interest.

Human and animal rights

This article does not contain any studies with human participants or animals performed by any of the authors.

Informed consent

Informed consent was obtained from all individual participants included in the study.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Singh, V.P., Sharma, K. & Chakraborty, D. Solving capacitated vehicle routing problem with demands as fuzzy random variable. Soft Comput 27, 16019–16039 (2023). https://doi.org/10.1007/s00500-023-08888-1

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-023-08888-1

Keywords

Search

Navigation