Email this article Modeling of multi depot vehicle routing problem for petroleum products
- Authors: Belov A.1, Slastnikov S.1
-
Affiliations:
- National Research University Higher School of Economics Moscow
- Issue: Vol 38, No 5 (2017)
- Pages: 884-887
- Section: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/199949
- DOI: https://doi.org/10.1134/S1995080217050079
- ID: 199949
Cite item
Open Access
Access granted
Subscription Access
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.
About the authors
A. Belov
National Research University Higher School of Economics Moscow
Author for correspondence.
Email: AVBelov@hse.ru
Russian Federation, Moscow, 101000
S. Slastnikov
National Research University Higher School of Economics Moscow
Email: AVBelov@hse.ru
Russian Federation, Moscow, 101000
