Comparative analysis of two different heuristics for model of VRP

被引：2
|
作者：
Joshi, Sourabh [1 ]
Kaur, Sarabjit [1 ]
机构：
[1] CT Inst Technol & Res, Dept Comp Sci Engn, Jalandhar, India
来源：
2015 SECOND INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING AND COMMUNICATION ENGINEERING ICACCE 2015 | 2015年
关键词：
Ant Colony Optimization; Ant Colony Algorithm; Nearest Neighbor Insertion; Vehicle routing problem; VEHICLE-ROUTING PROBLEM;
D O I：
10.1109/ICACCE.2015.87
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Vehicle routing problem (VRP) is realistic optimization problem used to find the best feasible route of a vehicle. VRP is mostly used for sorting the different routes of vehicles to provide efficient services to the customers. In this paper, we implement two different heuristics, nearest neighbor insertion and ant colony optimization for solving vehicle routing problem and their respective results are shown by using graphical implementation. While performing the experiment we analyzed both the heuristics and depict which heuristic solve the problem efficiently with respect to cost and time.
引用
收藏
页码：124 / 127
页数：4
相关论文
共 50 条
12345