Abstract
The paper is devoted to modeling multi depot vehicle routing problem (VRP) with capacity constraints for petroleum products delivery. Applying efficient metaheuristics algorithms combined with local search procedures, we present how to get suboptimal solutions for this NP-hard problem in an acceptable time. Some parallel computing techniques are also used to reduce the execution time. Experimental results are performed by the case of VRP for petroleum products.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Luo, X. Li, and M. Chen, “Multi-phase meta-heuristic for multi-depots vehicle routing problem,” J. Software Eng. Appl. 6 (3B), 82–86 (2013).
G. Laporte, “The vehicle routing problem: an overview of exact and approximate algorithms,” Eur. J. Operat. Res. 59, 345–358 (1992).
G. Laporte, M. Gendreau, J. Potvin, and F. Semet, “Classical and modern heuristics for the vehicle routing problem,” Int. Trans. Operat. Res. 7, 285–300 (2000).
G. Laporte and Y. Nobert, “Exact algorithms for the vehicle routing problem,” in Surveys in Combinatorial Optimization, Ed. by S. Martello, G. Laporte, M. Minoux, and C. Ribeiro (North-Holland, Amsterdam, 1987), pp. 147–184.
A. Belov and S. Slastnikov, “Improving the efficiency of solving discrete optimization problems: the case of VRP,” J. Phys.: Conf. Ser. 681, 012050 (2016).
A. Belov and S. Slastnikov, “A metaheuristic approach for the problem of motor fuel distribution,” Proc. Comput. Sci. 31, 143–150 (2014).
Author information
Authors and Affiliations
Corresponding author
Additional information
Submitted by L. N. Shchur
Rights and permissions
About this article
Cite this article
Belov, A., Slastnikov, S. Modeling of multi depot vehicle routing problem for petroleum products. Lobachevskii J Math 38, 884–887 (2017). https://doi.org/10.1134/S1995080217050079
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1995080217050079