Research Article

A Clustering Algorithm For The Capacitated Vehicle Routing Problems With Stochastic Demands

Volume: 10 Number: 2 December 26, 2022
EN TR

A Clustering Algorithm For The Capacitated Vehicle Routing Problems With Stochastic Demands

Abstract

In today’s world, logistics problems are crucial for the supply chain management. The vehicle routing problems are one of the most studied combinatorial optimization problems in the logistics literature. In real life applications, all of the parameters of the problem may not be known. In this paper, we considered the capacitated vehicle routing problem with stochastic demands. Uniform and normal distributions were analyzed on customer demands to observe the stochastic nature of the problem. These methods were compared by using GAMS with different test problems which were taken from the literature. The clustering analysis including the K-means algorithm also applied on large-sized test problems. All of the obtained results were presented in detail.

Keywords

References

  1. [1] Dantzig G.B., Ramser, J.H. The Truck Dispatching Problem, Informs, 6 80-91, 1959.
  2. [2] Dror M., Trudeau P. Savings by Split Delivery Routing, Transportation Science, 23 141–145, 1989.
  3. [3] Laporte G., Louveaux F., Mercure H. Models and exact solutions for a class of stochastic location routing problems, European Journal of Operational Research, 39 71–78, 1989.
  4. [4] Smith S.L., Pavone M., Bullos F., Frazzoli E. Dynamic vehicle routing with priority classes of stochastic demands, IAM Journal on Control and Optimization, 48:5 3224–3245, 2010.
  5. [5] Tripathi M., Kuriger G. An ant based simulation optimization for vehicle routing problem with stochastic demands, IEEE Winter Simulation Conference (WSC 2009), December, 2009.
  6. [6] Erera A.L., Morales J.C., Savelsbergh M. The vehicle routing problem with stochastic demand and duration constraints, Transportation Science, 44:4 474-492, 2010.
  7. [7] Moghaddam F.B., Babak R.R., Sadjadi J.S. Vehicle routing problem with uncertain demands: An advanced particle swarm algorithm, Computers and Industrial Engineering, 62 306–317, 2012.
  8. [8] Goodson J.C., Ohlmann J.W., Thomas B.W. Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand, European Journal of Operational Research, 217:2 312–323, 2012.

Details

Primary Language

English

Subjects

Engineering

Journal Section

Research Article

Publication Date

December 26, 2022

Submission Date

May 10, 2022

Acceptance Date

December 22, 2022

Published in Issue

Year 2022 Volume: 10 Number: 2

APA
Alpaslan Takan, M., & Ağayeva, Ç. (2022). A Clustering Algorithm For The Capacitated Vehicle Routing Problems With Stochastic Demands. Mus Alparslan University Journal of Science, 10(2), 955-959. https://doi.org/10.18586/msufbd.1218311
AMA
1.Alpaslan Takan M, Ağayeva Ç. A Clustering Algorithm For The Capacitated Vehicle Routing Problems With Stochastic Demands. Mus Alparslan University Journal of Science. 2022;10(2):955-959. doi:10.18586/msufbd.1218311
Chicago
Alpaslan Takan, Melis, and Çerkez Ağayeva. 2022. “A Clustering Algorithm For The Capacitated Vehicle Routing Problems With Stochastic Demands”. Mus Alparslan University Journal of Science 10 (2): 955-59. https://doi.org/10.18586/msufbd.1218311.
EndNote
Alpaslan Takan M, Ağayeva Ç (December 1, 2022) A Clustering Algorithm For The Capacitated Vehicle Routing Problems With Stochastic Demands. Mus Alparslan University Journal of Science 10 2 955–959.
IEEE
[1]M. Alpaslan Takan and Ç. Ağayeva, “A Clustering Algorithm For The Capacitated Vehicle Routing Problems With Stochastic Demands”, Mus Alparslan University Journal of Science, vol. 10, no. 2, pp. 955–959, Dec. 2022, doi: 10.18586/msufbd.1218311.
ISNAD
Alpaslan Takan, Melis - Ağayeva, Çerkez. “A Clustering Algorithm For The Capacitated Vehicle Routing Problems With Stochastic Demands”. Mus Alparslan University Journal of Science 10/2 (December 1, 2022): 955-959. https://doi.org/10.18586/msufbd.1218311.
JAMA
1.Alpaslan Takan M, Ağayeva Ç. A Clustering Algorithm For The Capacitated Vehicle Routing Problems With Stochastic Demands. Mus Alparslan University Journal of Science. 2022;10:955–959.
MLA
Alpaslan Takan, Melis, and Çerkez Ağayeva. “A Clustering Algorithm For The Capacitated Vehicle Routing Problems With Stochastic Demands”. Mus Alparslan University Journal of Science, vol. 10, no. 2, Dec. 2022, pp. 955-9, doi:10.18586/msufbd.1218311.
Vancouver
1.Melis Alpaslan Takan, Çerkez Ağayeva. A Clustering Algorithm For The Capacitated Vehicle Routing Problems With Stochastic Demands. Mus Alparslan University Journal of Science. 2022 Dec. 1;10(2):955-9. doi:10.18586/msufbd.1218311