article · 2010

A Dynamic Programming Algorithm for Vehicle Routing Problems

Cited by 6Abstract and details only

Abstract

Vehicle Routing Problems (VRPs) are usually treated as static routing problem, since all the information is known before the routes been constructed. However, the real world VRPs are dynamic, where information relevant to the routing can change after the initial scheme has been done. This paper treats the dynamic VRPs with real time traffic information. We formulate the mathematic model of the VRPs, and propose a dynamic programming algorithm based on chaos optimization, whereas the route calculating module and dynamic programming module are introduced. Finally, the efficiency of the proposed algorithm is demonstrated by computer simulations.

Cite this paper

APA 7

Wei, O., & Sun, B. (2010). A Dynamic Programming Algorithm for Vehicle Routing Problems. https://doi.org/10.1109/iccis.2010.182

MLA 9

Wei, Ou, and Bao‐Gang Sun. “A Dynamic Programming Algorithm for Vehicle Routing Problems.” vol. 27, 2010, pp. 733–36, https://doi.org/10.1109/iccis.2010.182.

Chicago

Wei, Ou, and Bao‐Gang Sun. 2010. “A Dynamic Programming Algorithm for Vehicle Routing Problems.” https://doi.org/10.1109/iccis.2010.182.

Harvard

Wei, O. and Sun, B. (2010) ‘A Dynamic Programming Algorithm for Vehicle Routing Problems’. Available at: https://doi.org/10.1109/iccis.2010.182.

BibTeX

@article{wei2010dynamic,
  title = {{A Dynamic Programming Algorithm for Vehicle Routing Problems}},
  author = {Wei, Ou and Sun, Bao‐Gang},
  volume = {27},
  pages = {733--736},
  year = {2010},
  doi = {10.1109/iccis.2010.182}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.