TARU PUBLICATIONS
Journal of Information and Optimization Sciences cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0103·ISSN (Print): 0252-2667

WoS  JIF 2026 : 0.4 (Q4)

Powered by:Powered by

Monthly Journal: Publishes theoretical and applied research on topics in information and optimization sciences.

Issues up to 2022 co-published with and available at:Taylor & Francis
submissions@tarupublications.com
Open Access Research Article

A note on the multi-depot vehicle routing problem

*

* Corresponding author · click or hover a name for details

pp. 641–643Vol. 47Issue 2February 2026DOI: 10.47974/JIOS-2112XML
Received:
05 Mar 2025
Published Online:
24 Nov 2025
Article type:
Research Article
Language:
EN
Article no.:
JIOS-2112
Pages:
641–643

Abstract

In a paper, Geetha, Vanathi, and Poonthalir [1] suggested a model for the MDVRP. However, we find that authors ignore the relationship between the two types of proposed binary decision variables, and it leads to the wrong integer programming model for the MDVRP. We give an illustrative example to identify the problem and suggest new constraints to overcome. Also, authors should include the distances between depots and customers in the objective function.

Keywords

Subject Classifications

90C1090B06

References

[1] S. Geetha, P. T. Vanathi, and G. Poonthalir, “Metaheuristic approach for the multi-depot vehicle routing problem,” Applied Artificial Intelligence, vol. 26, no. 9, pp. 878–901 (2012). DOI: 10.1080/08839514.2012.724685
[2] G. B. Dantzig and J. H. Ramser, “The truck dispatching problem,” Management Science, vol. 6, no. 1, pp. 80–91 (1959). DOI: 10.1287/mnsc.6.1.80
[3] L. K. Bhuranda, M. Rizwanullah, A. K. Sharma, K. Gautam, and Y. Chawla, “Stochastic optimization of multi-capacitated vehicle routing problem with pickup and delivery using saving matrix algorithm,” Journal of Information and Optimization Sciences, vol. 44, no. 3, pp. 541–552 (2023). DOI: 10.1080/02522667.2022.2119084

Views: 69Downloads: 15Citations: 0