Volume 20, Issue 2 (IJIEPM 2009)                   2009, 20(2): 23-30 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Taghavifard M, Sheikh K, Shahsavari A. Modified Ant Colony Algorithm for the Vehicle Routing Problem with Time Windows. Journal title 2009; 20 (2) :23-30
URL: http://ijiepm.iust.ac.ir/article-1-111-en.html
Modified Ant Colony Algorithm for the Vehicle Routing Problem with Time Windows
M. Taghavifard * , K. Sheikh , A. Shahsavari
, dr.taghavifard@gmail.com
Abstract:   (11430 Views)
Vehicle Routing Problem with Time Windows (VRPTW) is an NP-Complete Optimization Problem. Even finding an optimal solution for small size problems is too hard and time-consuming. The objective of VRPTW is to use a fleet of vehicles with specific capacity to serve a number of customers with dissimilar demands and time window constraints at minimum cost, without violating the capacity and time window constraints. This problem has been solved with a number of heuristic and meta-heuristic solution algorithms and optimal or near optimal solutions gained. In this paper, a modified Ant Colony algorithm is proposed. In this algorithm we tried to simplify the solution procedure and computational complexities of ant colony meta-heuristic. To gain this capability, we sacrificed some computational accuracy. Testing the solution procedure on the Solomon test-problems showed that this algorithm is capable of generating relatively good solutions.
Keywords: Vehicle Routing Problem with Time Windows, Ant Colony Algorithm, Solomon test-problems
Full-Text [PDF 337 kb]   (5627 Downloads)    
Type of Study: Research | Subject: Other related Industrial and production reserach subjects in which has direct relation to the state-of-the art of the IE
Received: 2009/11/29 | Published: 2009/08/15
Add your comments about this article : Your username or Email:
CAPTCHA
Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.