An ant colony system for the open vehicle routing problem

Authors:
Xiangyong Li;Peng Tian
Affiliations:
Antai College of Economics & Management, Shanghai Jiaotong University, Shanghai, P.R. China;Antai College of Economics & Management, Shanghai Jiaotong University, Shanghai, P.R. China
Venue:
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Year:
2006

Citing 3
Cited 2

Ant Colony Optimization

Ant Colony Optimization
Very large-scale vehicle routing: new test problems, algorithms, and results

Computers and Operations Research
The open vehicle routing problem: Algorithms, large-scale test problems, and computational results

Computers and Operations Research

A hybrid evolution strategy for the open vehicle routing problem

Computers and Operations Research
A honey bees mating optimization algorithm for the open vehicle routing problem

Proceedings of the 13th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the open vehicle routing problem (OVRP), in which the vehicles do not return to the starting depot after serving the last customers or, if they do, they must make the same trip in the reverse order. We present an ant colony system hybridized with local search for solving the OVRP (ACS-OVRP). Additionally, a Post-Optimization procedure is incorporated in the proposed algorithm to further improve the best-found solutions. The computational results of ACS-OVRP compared to those of other algorithms are reported, which indicate that the ACS-OVRP is another efficient algorithm for solving the OVRP.