© The Institution of Engineering and Technology
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.
References
-
-
1)
-
13. Yu, B., Yang, Z.Z.: ‘An ant colony optimization model: the period vehicle routing problem with time windows’, Transp. Res. E, 2011, 47, (2), pp. 166–181 (doi: 10.1016/j.tre.2010.09.010).
-
2)
-
25. Yao, E.J., Song, Y.Y.: ‘Study on eco-route planning algorithm and environmental impact assessment’, J. Intell. Transp. Syst., 2013, 17, (1), pp. 42–53 (doi: 10.1080/15472450.2013.747822).
-
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. 34–46.
-
4)
-
6. Szeto, W.Y., Wu, Y., Ho, S.C.: ‘An artificial bee colony algorithm for the capacitated vehicle routing problem’, Eur. J. Oper. Res., 2011, 215, (1), pp. 126–135 (doi: 10.1016/j.ejor.2011.06.006).
-
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. 108–111.
-
6)
-
18. Demir, E., Bektas, T.: ‘A review of recent research on green road freight transportation’, Eur. J. Oper. Res., 2014, 237, (3), pp. 775–793 (doi: 10.1016/j.ejor.2013.12.033).
-
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. 1–5.
-
8)
-
4. Erdoğan, S., Miller-Hooks, E.: ‘A green vehicle routing problem’, Transp. Res. E, 2012, 48, (1), pp. 100–114 (doi: 10.1016/j.tre.2011.08.001).
-
9)
-
22. Moura, A., Oliveira, J.F.: ‘An integrated approach to the vehicle routing and container loading problems’, OR Spectrum, 2009, 31, (4), pp. 775–800 (doi: 10.1007/s00291-008-0129-4).
-
10)
-
M. Gendreau ,
M. Iori ,
G. Laporte ,
S. Martello
.
A tabu search algorithms for routing and container loading problem.
Transp. Sci.
,
3 ,
342 -
350
-
11)
-
15. Lecluyse, C., Sörensen, K., Peremans, H.: ‘A network-consistent time-dependent travel time layer for routing optimization problems’, Eur. J. Oper. Res., 2013, 226, (3), pp. 395–413 (doi: 10.1016/j.ejor.2012.11.043).
-
12)
-
3. McIlroy, R.C., Stanton, N.A., Harvey, C.: ‘Getting drivers to do the right thing: a review of the potential for safely reducing energy consumption through design’, IET Intell. Transp. Syst., 2013, 8, (4), pp. 388–397 (doi: 10.1049/iet-its.2012.0190).
-
13)
-
14. Soler, D., Albiach, J., MartíNez, E.: ‘A way to optimally solve a time-dependent vehicle routing problem with time windows’, Oper. Res. Lett., 2009, 37, (1), pp. 37–42 (doi: 10.1016/j.orl.2008.07.007).
-
14)
-
1. Yu, L., Wang, D.: ‘Green logistics capacitated VRPSDP based on ant colony algorithm’, Comput. Syst. Appl., 2013, 22, (7), pp. 127–132.
-
15)
-
7. Chen, H.K., Hsueh, C.F., Chang, M.S.: ‘The real-time time dependent vehicle routing problem’, Transp. Res. E, 2006, 42, (5), pp. 383–408 (doi: 10.1016/j.tre.2005.01.003).
-
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. 656–665.
-
17)
-
20. Xiao, Y., Zhao, Q., Kaku, I., Xu, Y.: ‘Development of a fuel consumption optimization model for the capacitated vehicle routing problem’, Comput. Oper. Res., 2012, 39, (7), pp. 1419–1431 (doi: 10.1016/j.cor.2011.08.013).
-
18)
-
2. Kuo, Y.: ‘Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem’, Comput. Ind. Eng., 2010, 59, (1), pp. 157–165 (doi: 10.1016/j.cie.2010.03.012).
-
19)
-
21. Kuo, Y., Wang, C.C.: ‘Optimizing the VRP by minimizing fuel consumption’, Manage. Environ. Qual.: Int. J., 2011, 22, (4), pp. 440–450 (doi: 10.1108/14777831111136054).
-
20)
-
9. Li, H., Lim, A.: ‘Local search with annealing-like restarts to solve the VRPTW’, Eur. J. Oper. Res., 2003, 150, (1), pp. 115–127 (doi: 10.1016/S0377-2217(02)00486-1).
-
21)
-
10. Pureza, V., Morabito, R., Reimann, M.: ‘Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW’, Eur. J. Oper. Res., 2012, 218, (3), pp. 636–647 (doi: 10.1016/j.ejor.2011.12.005).
-
22)
-
19. Ubeda, S., Arcelus, F.J., Faulin, J.: ‘Green logistics at Eroski: a case study’, Int. J. Prod. Econ., 2011, 131, (1), pp. 44–51 (doi: 10.1016/j.ijpe.2010.04.041).
-
23)
-
17. Ichoua, S., Gendreau, M., Potvin, J.Y.: ‘Vehicle dispatching with time-dependent travel times’, Eur. J. Oper. Res., 2003, 144, (2), pp. 379–396 (doi: 10.1016/S0377-2217(02)00147-9).
-
24)
-
12. Figliozzi, M.A.: ‘An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows’, Transp. Res. C, 2010, 18, (5), pp. 668–679 (doi: 10.1016/j.trc.2009.08.005).
-
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. 1–4.
-
26)
-
8. Yildirim, U.M.: ‘An ant colony algorithm for time-dependent vehicle routing problem with time windows’. Operations Research Proc. 2008, 2009, pp. 337–342.
-
27)
-
26. Suzuki, Y.: ‘A new truck-routing approach for reducing fuel consumption and pollutants emission’, Transp. Res. D, 2011, 16, (1), pp. 73–77 (doi: 10.1016/j.trd.2010.08.003).
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-its.2015.0027
Related content
content/journals/10.1049/iet-its.2015.0027
pub_keyword,iet_inspecKeyword,pub_concept
6
6