Full Load Distribution Scheduling Problem for Refined Oil
Science Journal of Applied Mathematics and Statistics
Volume 4, Issue 5, October 2016, Pages: 183-188
Received: Jun. 27, 2016; Accepted: Aug. 13, 2016; Published: Aug. 25, 2016
Views 3565      Downloads 91
Xiaocun Mao, School of Information, Beijing Wuzi University, Beijing, China
Xinxin Zhang, School of Information, Beijing Wuzi University, Beijing, China
Zhenping Li, School of Information, Beijing Wuzi University, Beijing, China
Article Tools
Follow on us
This paper presents solution approaches for the multi-period multi-compartment Vehicle Routing Problem in fuel delivery. Multi-compartment vehicles are used for fuel distribution from one depot to a set of petrol stations that have deterministic fuel consumption of each hour. Due to the highly complicated assignment compartments of the same vehicle to petrol stations in full load distribution scheduling problem, a heuristic method will be adopted to solve this problem. By means of a case study, the heuristic developed is shown to be very effective in solving such comprehensive full load distribution scheduling problem for refined oil, and the results obtained are promising.
Vehicle Routing Problem, Full-Load, Multi-period Delivery, Heuristics Algorithm
To cite this article
Xiaocun Mao, Xinxin Zhang, Zhenping Li, Full Load Distribution Scheduling Problem for Refined Oil, Science Journal of Applied Mathematics and Statistics. Vol. 4, No. 5, 2016, pp. 183-188. doi: 10.11648/j.sjams.20160405.11
Copyright © 2016 Authors retain the copyright of this article.
This article is an open access article distributed under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
B. Wang. Study on the optimization of vehicle routing problem in finished oil distribution [J]. Chemical Engineering Management, 2015 (in chinese).
D. Cinar, K. Gakis, P. M. Pardalos, A 2-phase constructive algorithm for cumulative vehicle routing problems with limited duration [J]. Expert Systems with Applications, 2016 (56): 48–58.
S. Z. Song, F. S. Kong, VRP routing selection based on time-varying network [J]. IEEE Computer Society, Applied Artificial Intelligence, 2014 (28): 957-991.
G. G. Hajar, D. Farzad, R. Asadollah, Vehicle routing problem for minimizing consumption of energy in three dimensional space [J]. KUWAIT JOURNAL OF SCIENCE, 2016 (43): 139-150.
F. V. Louveaux, J. J. Salazar-Gonzalez, Solving the Single Vehicle Routing Problem with Variable Capacity [J]. Transportation Science, 2016 (50): 708-719.
İ. Kara, B. Y. Kara, M. K. Yetiş, Cumulative vehicle routing problems [C]. I-Tech Education and Publishing KG, Vienna, Austria, 2008: 85–98.
Z. X. Luo, H. Qin, C. H. Chen, On service consistency in multi-period vehicle routing [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015 (243): 731-744.
M. Vidović, D. Popović, B. Ratković, Mixed integer and heuristics model for the inventory routing problem in fuel delivery [J]. International Journal of Production Economics, 2014 (147): 593–604.
B. Yang, Z. H. Hu, C. Wei, Routing with time-windows for multiple environmental vehicle types [J]. Computers & Industrial Engineering, 2015 (89): 150–16.
F. B. de Oliveira, R. Enayatifar, H. J. Sadaei, F. G. Guimarães, J. Y. Potvin, A cooperative conventional algorithm for the Multi-Depot Vehicle Routing Problem [J]. Expert Systems with Applications, 2016 (54): 398-402.
Science Publishing Group
1 Rockefeller Plaza,
10th and 11th Floors,
New York, NY 10020
Tel: (001)347-983-5186