A study on vehicle routing problem with inter loading facilities
Abstract
In this article, we discuss variant of the multi-depot vehicle routing problem where depots can act as intermediate replenishment facilities along the route of a vehicle. This problem is a generalization of the Vehicle Routing Problem (VRP). In the sequel we developed a Lexi-Search algorithm based “Pattern Recognition Technique” to solve this problem which takes care of simple combinatorial structure of the problem and computational results are reported.In this paper, we consider a real-world problem with a loaded vehicle. The vehicle is available for pickup and delivery service. Single-commodity cargo, that is, same cargo type, is present at the customer sites. The vehicle is able to carry out a Pickup and delivery service of such cargo among the customers. By starting and ending at the origin depot, the vehicle follows a route without having a predefined sequence of Pickup and delivery services.
Copyright © 2021 B. Mahaboob, T. Nageswara Rao, V.B.V.N. Prasad, Y. Hari Krishna, P. Venkateswararao, K. Prasad. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
B. Mahaboob, T. N. Rao, V. B. V. N. Prasad, Y. H. Krishna, P. Venkateswararao, K. Prasad, A study on vehicle routing problem with inter loading facilities, J. Math. Comput. Sci. 11 (2021), 4464–4496. https://doi.org/10.28919/jmcs/5683
BibTeX
@article{Mahaboob2021,
author = {Mahaboob, B. and Rao, T. Nageswara and Prasad, V.B.V.N. and Krishna, Y. Hari and Venkateswararao, P. and Prasad, K.},
title = {A study on vehicle routing problem with inter loading facilities},
journal = {J. Math. Comput. Sci.},
volume = {11},
year = {2021},
pages = {4464--4496},
doi = {10.28919/jmcs/5683}
}