Paper Info
Title
ABCGA Algorithm for the Two Echelon Vehicle Routing Problem
Abstract
In recent years, logistics industry has received extensive attention with the development of online shopping. Logistics distribution is the core of logistics industry. Scientifically rational logistics distribution can save delivery cost and improve customer satisfaction. Therefore, it is very important to study the two echelon vehicle routing problem (2E-VRP) in logistics distribution.Artificial bee colony algorithm has strong global optimization ability and the performance of genetic algorithm depends on the choice of the initial solution. Based on large-scale neighbour search, this paper proposes ABCGA algorithm. ABCGA algorithm makes use of artificial bee colony algorithm for the first time to solve the 2E-VRP problem. Then, genetic algorithm is used to optimize the original optimal solution. ABCGA algorithm has many advantages such as stable effect, high efficiency and so on. This paper experiments on 93 test problems from set2, set3, and set4 data sets. Compared with ALNS algorithm, GRASP+VND and ABC algorithm, the experimental results show that ABCGA has better performance on the test problems with less customers.
Year
DOI
Venue
2017
10.1109/CSE-EUC.2017.61
2017 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC)
Keywords
Field
DocType
artificial bee colony algorithm,genetic algorithm,two echelon vehicle routing problem
Artificial bee colony algorithm,Vehicle routing problem,Customer satisfaction,GRASP,Global optimization,Computer science,Operations research,Destination-Sequenced Distance Vector routing,Algorithm,Genetic algorithm
Conference
Volume
ISSN
ISBN
1
1949-0828
978-1-5386-3222-2
Citations 
PageRank 
References 
0
0.34
12
Authors
3
Name
Order
Citations
PageRank
Xiaoling Zhong113.76
Siyu Jiang242.41
Hengjie Song3465.33