An efficient ant colony system for Vehicle Routing Problems with Time Windows
by Orivalde S. Silva Jr.; Jose E. Leal
International Journal of Logistics Systems and Management (IJLSM), Vol. 10, No. 2, 2011

Abstract: This paper presents an efficient algorithm based on a meta-heuristic Multiple Ant Colony System (MACS) for solving Vehicle Routing Problems with Time Windows (VRPTW). This study aims to determine the minimum cost routes for a fleet of vehicles of the same capacity to meet the demand of a set of customers within a specified time interval called a time window. The methodology, known as MACS-VRPTW, uses two ant colonies to minimise the number of vehicles and total time required to serve all customers. The algorithm was implemented in the Java environment, and six standard problems used as benchmarks in the literature were tested.

Online publication date: Wed, 06-May-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Logistics Systems and Management (IJLSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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