An ant colony optimization model: The period vehicle routing problem with time windows
This paper proposes an improved ant colony optimization (IACO) to solve period vehicle routing problem with time windows (PVRPTW), in which the planning period is extended to several days and each customer must be served within a specified time window. Multi-dimension pheromone matrix is used to accumulate heuristic information on different days. Two-crossover operations are introduced to improve the performance of the algorithm. The effectiveness of IACO is evaluated using a set of well-known benchmarks. Some of the results are better than the best-known solutions. Results also show the IACO seems to be a powerful tool for PVRPTW.
Volume (Year): 47 (2011)
Issue (Month): 2 (March)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic|
When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:47:y:2011:i:2:p:166-181. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.