An Improved Ant Algorithm for VRP with the Shortest Delivery Time In Distribution Center

@article{Chen2007AnIA,
  title={An Improved Ant Algorithm for VRP with the Shortest Delivery Time In Distribution Center},
  author={Zixia Chen},
  journal={Third International Conference on Natural Computation (ICNC 2007)},
  year={2007},
  volume={4},
  pages={761-765}
}
An improved ant algorithm is brought up to minimize the delivery time of vehicle routing problem (VRP) in distribution center. Firstly VRP whose objective is to minimize the delivery time is given, then the optimal vehicle distribution route division approach of distribution center for given customer array is defined, and the ant colony algorithm for VRP with objective to minimize the delivery time is presented. The research of this paper is based on the information and application case of… CONTINUE READING

Figures, Tables, and Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-8 OF 8 REFERENCES

A simple and effective evolutionary algorithm for the vehicle routing problem

Christian Prins
  • Computers & Operations Research,
  • 2004
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Qing-tai Ye.An Algorithm Research on Single Vehicle Routing Problem Based on Real Streets Distribution

Zi-xia Chen
  • Computer Engineering,
  • 2005
VIEW 1 EXCERPT

Conventional Network Analysis Functions in Geographic Information System and Their Relative Algorithms

Wen Zeng, Shi-wen Xu
  • Earth Science-Journal of China University of Geosciences,
  • 1998
VIEW 1 EXCERPT