access icon free Vehicle routing problem solution considering minimising fuel consumption

Recently, logistics is not only playing more and more important role in social and economic development, but also caused serious energy consumption and environment pollution problems. Reasonable vehicle route planning is viewed as an important solution to reduce logistics enterprises’ operation costs as well as alleviate the energy and environmental problems. This study aims to propose a solution to time-dependent vehicle routing problem with time windows (TDVRPTW) considering minimising fuel consumption. First, a mathematical TDVRPTW model with the minimum fuel consumption as an objective function is established, in which the three-dimensional bin-packing problem is considered as a sub-problem and the alternative stop point concept is newly proposed to reduce the possible detouring distance and fuel consumption of logistic vehicle. Then, an ant colony algorithm is applied to solve the problem, and the departure time optimisation is introduced to further improve the obtained results. Finally, the proposed approach is evaluated with the real road network and traffic data of Beijing. The results show that the method introduced in this study outperforms the existing approaches in reducing fuel consumption as well as route length.

Inspec keywords: road traffic; logistics; energy consumption; vehicle routing; ant colony optimisation; planning; bin packing; minimisation; cost reduction; fuel economy

Other keywords: road network; vehicle route planning; TDVRPTW model; logistic vehicle; road traffic data; stop point concept; three-dimensional bin-packing problem; Beijing; time-dependent vehicle routing problem with time windows; economic development; social development; logistic enterprise operation cost reduction; environment pollution; energy consumption; ant colony algorithm; fuel consumption minimisation

Subjects: Optimisation techniques; Systems theory applications in transportation

References

    1. 1)
    2. 2)
    3. 3)
      • 11. Qureshi, A.G., Taniguchi, E., Yamada, T.: ‘An analysis of exact VRPTW solutions on ITS data-based logistics instances’, Int. J. Intell. Transp. Syst. Res., 2012, 10, (1), pp. 3446.
    4. 4)
    5. 5)
      • 24. Bu, L., Yuan, X.J., Pu, Y., Chang, J.Q.: ‘Optimization based on genetic algorithm for three-dimensional packing in a single container’, China Railw. Sci., 2004, 25, (4), pp. 108111.
    6. 6)
    7. 7)
      • 5. He, J.: ‘An hybrid heuristic algorithm for the two-echelon vehicle routing problem’. IET, Int. Conf. on Information Science and Control Engineering, Shenzhen, China, December 2012, pp. 15.
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)
    13. 13)
    14. 14)
      • 1. Yu, L., Wang, D.: ‘Green logistics capacitated VRPSDP based on ant colony algorithm’, Comput. Syst. Appl., 2013, 22, (7), pp. 127132.
    15. 15)
    16. 16)
      • 27. Dorigo, M., Gambardella, L.M.: ‘A study of some properties of Ant-Q’, in Voigt, H.M., Ebeling, W., Rechenberg, I., Schwefel, H.P. (Eds.): ‘Parallel problem solving from nature – PPSN IV’ (Springer, Berlin, Heidelberg, 1996), pp. 656665.
    17. 17)
    18. 18)
    19. 19)
    20. 20)
    21. 21)
    22. 22)
    23. 23)
    24. 24)
    25. 25)
      • 16. Wang, H.F., Lee, Y.Y.: ‘Modeling of a time dependent alternative vehicle routing problem with time windows’. Int. Conf. on Management and Service Science, Wuhan, China, August 2011, pp. 14.
    26. 26)
      • 8. Yildirim, U.M.: ‘An ant colony algorithm for time-dependent vehicle routing problem with time windows’. Operations Research Proc. 2008, 2009, pp. 337342.
    27. 27)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-its.2015.0027
Loading

Related content

content/journals/10.1049/iet-its.2015.0027
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading