改进遗传算法求解VRP问题
Improved Genetic Algorithm for VRP
查看参考文献15篇
|
文摘
|
物流配送车辆路径问题(Vehicle Routing Problem, VRP)是一类具有广泛应用的NP - Hard问题,是解决物流配送效率的关键,传统方法寻找最优解的效率低、耗时长,往往找不到满意的解,导致物流成本过高。为了提高VRP寻优效率,降低物流运送成本,对基本遗传算法改进求解VRP问题。首先建立VRP的数学模型,然后基于贪婪随机自适应算法(Greedy Randomized Adaptive Search Procedure,GRASP)改进遗传算法的邻域搜索能力,生成遗传算法初始种群,最后利用遗传算法从GRASP生成的初始种群中找到最优解。计算结果表明,所采用的改进遗传算法可以更好的求解车辆路径问题,有效降低物流运送成本。 |
|
其他语种文摘
|
The vehicle routing problem whose solution is a key to improve efficiency of logistics problem is a classical NP - hard problem,and it is usually difficult for traditional methods to obtain satisfying solutions so as to high logistics costing. In this paper, in order to reduce logistics costs, the hybrid genetic algorithm was selected to solve the VRP problem. This paper established the VRP mathematic model at first. Second, the improvement using Greedy Randomized Adaptive Search Procedure (GRASP) was focused on the local search ability of basic genetic algorithm to generate the initial solution. The genetic algorithm was used to find the best solution from the initial solutions in the end. The calculation result shows that this improved genetic algorithm can solve the vehicle routing problem better than the basic one and reduce logistics costing effectively. |
|
来源
|
计算机仿真
,2013,30(12):140-143,157 【扩展库】
|
|
关键词
|
车辆路径问题:遗传算法
;
随机贪婪自适应搜索过程:物流
;
邻域搜索
|
|
地址
|
中国科学院新疆理化技术研究所, 新疆, 乌鲁木齐, 830011
|
|
语种
|
中文 |
|
文献类型
|
研究性论文 |
|
ISSN
|
1006-9348 |
|
学科
|
自动化技术、计算机技术 |
|
基金
|
国家自然科学基金
;
中国科学院西部之光人才培养计划
;
新疆维吾尔自治区科技支疆项目
|
|
文献收藏号
|
CSCD:5031010
|
参考文献 共
15
共1页
|
|
1.
黄小燕. 改进遗传操作PSO算法及其在VRP中的应用.
计算机仿真,2009,26(11):294-298
|
被引
1
次
|
|
|
|
|
2.
蔡蓓蓓. 混合量子遗传算法及其在VRP中的应用.
计算机仿真,2010,27(7):267-270
|
被引
6
次
|
|
|
|
|
3.
廖良才. 基于混合遗传算法的物流配送车辆调度优化问题求解方法.
系统工程,2008,28(6):27-31
|
被引
1
次
|
|
|
|
|
4.
Geonwook Jeon. A vehicle routing problem solved by using a hybrid genetic algorithm.
Computers & Industrial Engineering,2007,53:680-692
|
被引
8
次
|
|
|
|
|
5.
Ziauddin Ursani. Localized genetic algorithm for vehicle routing problem with time windows.
Applied Soft Computing,2011,11:5375-5390
|
被引
18
次
|
|
|
|
|
6.
Yves Rochat. Probabilistic diversification and intensification in local search for vehicle routing problem.
Journal of Heuristic,1995,1:147-167
|
被引
11
次
|
|
|
|
|
7.
郑雅燕. TSP问题的一种改进的GRASP算法.
计算机工程与科学,2008,30(11):60-64
|
被引
1
次
|
|
|
|
|
8.
Yannis Marinakis. Multiple phase neighborhood search-GRASP for the capacitated vehicle routing problem.
Expert Systems with Applications,2012,39:6807-6815
|
被引
2
次
|
|
|
|
|
9.
Thomas A Feo. Greedy randomized adaptive search procedures.
Journal of Global Optimization,1995,6(1995):109-134
|
被引
15
次
|
|
|
|
|
10.
Yannis Marinakis. Expanding neighborhood GRASP for the traveling salesman problem.
Computational Optimization and Applications,2005,32(2005):231-257
|
被引
1
次
|
|
|
|
|
11.
Jari Kytojoki. An efficient variable neighborhood search heuristic for very large scale vehicle routing problems.
Computers & Operations Research,2007,34:2743-2757
|
被引
13
次
|
|
|
|
|
12.
田延硕. 一种提高局部搜索能力的混合遗传算法.
电子科技大学学报,2006,35(2):232-234
|
被引
3
次
|
|
|
|
|
13.
王小平.
遗传算法一理论、应用与软件实现,2002
|
被引
1083
次
|
|
|
|
|
14.
李军.
物流配送车辆优化调度理论与方法,2001
|
被引
87
次
|
|
|
|
|
15.
Bruce L Golden.
The vehicle routing problem,2010
|
被引
1
次
|
|
|
|
|
了解气象卫星更多信息，请访问