Article citationsMore >>

BirgerRaa.New models and algorithms for the cyclic inventory routing problem [J]. 4OR, 2008, 61:97-100.

has been cited by the following article:

Article

Research on the Refined Oil Distribution Routing Problem Based on Ant-colony Algorithm

1School of Information, Beijing Wuzi University, Beijing, China


American Journal of Modeling and Optimization. 2016, Vol. 4 No. 3, 67-73
DOI: 10.12691/ajmo-4-3-1
Copyright © 2016 Science and Education Publishing

Cite this paper:
Zhenping Li, Zhiguo Wu, Lulu Jiang. Research on the Refined Oil Distribution Routing Problem Based on Ant-colony Algorithm. American Journal of Modeling and Optimization. 2016; 4(3):67-73. doi: 10.12691/ajmo-4-3-1.

Correspondence to: Zhenping  Li, School of Information, Beijing Wuzi University, Beijing, China. Email: lizhenping66@163.com

Abstract

Refined oil distribution routing problem is defined as: Given the demand of each gas station and multiple types of oil tankers, how to distribute the refined oil from oil depot to meet the needs of each gas station so as to minimize the total cost. This paper mainly studies the distribution vechicles deployment and route planning of an oil company. With the consideration of capacity constraints of the tankers, demand, time window and unloading time of each gas station, a mathematical model is built which takes the minimum of system operating cost as the objective, and an improved ant-colony algorithm is designed to solve the model. Comparing the approximate optimal solution obtained by the improved ant-colony algorithm with the optimal solution obtained by Lingo software, the feasibility and effectiveness of the improved ant-colony algorithm for solving the refined oil distribution routing problem is verified.

Keywords