An intelligent vehicle routing system for family farming collective organisations Online publication date: Tue, 10-Apr-2012
by Edilson Ferneda; Bernardo A. Mello; Janaína D.A.S. Diniz; Adelaide S. Figueiredo
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 4, No. 1/2, 2012
Abstract: This paper presents an implementation of the Ant Colony Algorithm for the Vehicle Routing Problem (VRP). For the calculation of the best way between two adjacent points in the route, the classical algorithm of Dijkstra was used. Field activities and tests were carried out in different collective organisations, and collection and distribution route maps were created for each pilot-organisation. During the development of the system, some processes were revised in order to better adjust the routes, after considering the parameters related to cost, time and sales volume. The main difficulties in the development of this system were related to the adaptation of the standards proposed by urban routing systems to a rural context. Also, concerning the future trends of the model, many efforts have been made to improve the geographical interface and to test other VRP algorithms, like VRP with time windows and Dynamic VRP.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Reasoning-based Intelligent Systems (IJRIS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook