文章基本信息

标题：Open Vehicle Routing Problem by Ant Colony Optimization
本地全文：下载
作者：Er. Gurpreet Singh ; Dr. Vijay Dhir
期刊名称：International Journal of Advanced Computer Science and Applications(IJACSA)
印刷版ISSN：2158-107X
电子版ISSN：2156-5570
出版年度：2014
卷号：5
期号：3
DOI：10.14569/IJACSA.2014.050308
出版社：Science and Information Society (SAI)
摘要：Vehicle routing problem (VRP) is real-world combinatorial optimization problem which determine the optimal route of a vehicle. Generally, toprovide the efficientvehicle serving to the customer through different services by visiting the number of cities or stops. The VRP follows the Travelling Salesman Problem (TSP), in which each of vehicle visiting a set of cities such that every city is visited by exactly one vehicle only once. This work proposes the Ant Colony Optimization (ACO)-TSP algorithm to eliminate the tour loop for Open Vehicle routing Problem (OVRP). A key aspect of this algorithm is to plan the routes of buses that must pick up and deliver the school students from various bus stops on time, especially in the case of far distance covered by the vehicle in a rural area and find out the efficient and safe vehicle route.
关键词：thesai; IJACSA; thesai.org; journal; IJACSA papers; Ant Colony Optimization (ACO); Vehicle routing Problem(VRP);Open Vehicle routing Problem(OVRP); Travelling Salesman Problem(TSP);Swarm Intelligence(SI)