Abstract

The Vehicle Routing Problem with Time Windows is an important task in logistic planning. The expenditure on employing labor force, i.e., drivers for vehicles, accounts for most of the costs in this domain. We propose an initialized Ant Colony approach, IACO-VRPTW, with the primary goal (f1) to reduce the number of vehicle needed to serve the customers and the second-priority goal (f2) of decreasing the travel distance. Compared with methods that optimize f2, IACO-VRPTW can reach or reduce f1 in 8 out of 18 instances of the Solomon benchmark set, at the cost of increasing travel distance slightly. IACO-VRPTW can effectively decrease the number of vehicles, travel distance and runtime compared with an ACO without initialization.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Colorni, A., Dorigo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: European Conference on Artificial Life, Paris, France, December 11-13, pp. 134–142 (1991)Google Scholar
  2. 2.
    Yu, B., Yang, Z.Z., Yao, B.Z.: A hybrid algorithm for vehicle routing problem with time windows. Expert Systems with Applications 38(1), 435–441 (2011)CrossRefGoogle Scholar
  3. 3.
    Alvarenga, G.B., Mateus, G.R., de Tomi, G.: A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Computer and Operations Research 34(6), 1561–1584 (2007)CrossRefMATHGoogle Scholar
  4. 4.
    Homberger, J., Gehring, H.: Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR 37, 297–318 (1999)Google Scholar
  5. 5.
    Li, H., Lim, A.: Local search with annealing-like restarts to solve the vrptw. European Journal of Operational Research 150(1), 115–127 (2003)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Berger, J., Barkaoui, M.: A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Computers and Operations Research 31(12), 2037–2053 (2004)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Qi, C., Sun, Y.: An improved ant colony algorithm for vrptw. In: 2008 International Conference on Computer Science and Software Engineering, pp. 455–458 (2008)Google Scholar
  8. 8.
    Homberger, J., Gehring, H.: A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. European Journal of Operational Research 162(1), 220–238 (2005)CrossRefMATHGoogle Scholar
  9. 9.
    Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35(2), 254–265 (1987)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Gambardella, L.M., Taillard, É., Agazzi, G.: Macs-vrptw: A multiple ant colony system for vehicle routing problems with time windows. Technical Report IDSIA-06-99, IDSIA, Lugano, Switzerland (1999)Google Scholar
  11. 11.
    Bent, R., Van Hentenryck, P.: A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science 38(4), 515–530 (2004)CrossRefGoogle Scholar
  12. 12.
    Solomon, M.M.: Vrptw benchmark problems, http://web.cba.neu.edu/~msolomon/problems.htm

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Wei Shi
    • 1
  • Thomas Weise
    • 1
  1. 1.The USTC-Birmingham Joint Research Institute in Intelligent Computation and Its Applications (UBRI)University of Science and Technology of China (USTC)HefeiChina

Personalised recommendations