In recent years, as a result of the increase in environmental problems, green logistics has become a focus of interest by researchers, governments, policy makers, and investors. In this study, a cumulative multi-trip vehicle routing problem with limited duration (CumMTVRP-LD) is modelled by taking into account the reduction of CO 2 emissions. In classical vehicle routing problems (VRP), each vehicle can perform only one trip. Because of the high investment costs of additional vehicles, organizations allow the vehicles to perform multiple trips as in multi-trip vehicle routing problems (MTVRP), which reflects the real requirements better than the classical VRP. This study contributes to the literature by using a mixed integer programming (MIP) formulation and a simulated annealing (SA) based solution methodology for CumMTVRP-LD, which considers the minimization of fuel consumption as the objective function. According to preliminary computational results using benchmark problems in the literature, the proposed methodology obtained promising results in terms of solution quality and computational time.
This is a preview of subscription content,to check access.
Access this article
Alizamir, S., Rebennack, S., Pardalos, P.M. (2008). Improving the neighborhood selection strategy in simulated annealing using the optimal stopping problem. In C.M. Tan (Ed.) Simulated annealing, (pp. 363–382). InTech.
Alonso, F., Alvarez, M.J., Beasley, J.E. (2008). A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions. Journal of the Operational Research Society, 59(7), 963–976.
Andress, D., Nguyen, T.D., Das, S. (2011). Reducing GHG emissions in the United States’ transportation sector. Energy for Sustainable Development, 15(2), 117–136.
Azi, N., Gendreau, M., Potvin, J.Y. (2007). An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. European Journal of Operational Research, 178(3), 755–766.
Azi, N., Gendreau, M., Potvin, J.Y. (2010). An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. European Journal of Operational Research, 202(3), 756–763.
Azi, N., Gendreau, M., Potvin, J.Y. (2014). An adaptive large neighborhood search for a vehicle routing problem with multiple routes. Computers & Operations Research, 41, 167–173.
Bertsimas, D., & Tsitsiklis, J. (1993). Simulated annealing. Statistical Science, 8(1), 10–15.
Brandão, J., & Mercer, A. (1997). A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. European Journal of Operational Research, 100(1), 180–191.
Brandão, J., & Mercer, A. (1998). The multi-trip vehicle routing problem. Journal of the Operational Research Society, 49(8), 799–805.
Breedam, A.V. (1995). Improvement heuristics for the vehicle routing problem based on simulated annealing. European Journal of Operational Research, 86(3), 480–490.
Cattaruzza, D., Absi, N., Feillet, D., Vidal, T. (2013). A memetic algorithm for the multi trip vehicle routing Problem. European Journal of Operational Research. doi:10.1016/j.ejor.2013.06.012.
Christofides, N., Mingozzi, A., Toth, P. (1979). Combinatorial Optimization.
Clarke, G., & Wright, J.W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4), 568–581.
Şen, A., & Bülbül, K. (2008). A survey on multi trip vehicle routing problem. In Proceedings of the 6th International Logistics and Supply Chain Congress, 6–7 November, (pp. 401–407). Istanbul, Turkey.
Taillard, É.D., Laporte, G., Gendreau, M. (1996). Vehicle routeing with multiple use of vehicles. The Journal of the Operational Research Society, 47(8), 1065–1070.
Fleischmann, B. (1990). The vehicle routing problem with multiple use of vehicles. Working paper. Universitt Hamburg, Germany: Fachbereich Wirtschaftswissenschaften.
Golden, B., Wasil, E., Kelly, J., Chao, I. (1998). Metaheuristics in vehicle routing. In T.G. Crainic, & G. Laporte (Eds.), Fleet Management and Logistics, (pp. 49–58). Boston: Kluwer Academic Publishers.
Hernandez, F., Feillet, D., Giroudeau, R., Naud, O. (2014). A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration. 4OR, 12(3), 235–259. doi:10.1007/s10288-013-0238-z.
Huang, C., & ve Lee, C. (2011). A study of multi-trip vehicle routing problem and distribution center location problem. In Proceedings of POMS 22nd Annual Conference. Reno, Nevada, USA.
Huang, Z., & Zheng, Q. (2014). Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs, (pp. 1–16).
International Energy Agency (2011). United States: Indicators for 2011. http://www.iea.org/statistics/statisticssearch/.
Kara, İ., Kara, B.Y., Yetiş, M.K. (2008). Cumulative vehicle routing problems. In T. Caric, & H. Gold (Eds.), Vehicle Routing Problem (pp. 85–98). KG, Vienna: I-Tech Education and Publishing.
Kokubugata, H., & Kawashima, H. (2008). In C.M. Tan (Ed.), Application of simulated annealing to routing problems in city logistics, (pp. 131–154). InTech.
Kopfer, H., & Kopfer, H. (2013). In H.J. Kreowski, B. Scholz-Reiter, K.D. Thoben (Eds.), Emissions minimization vehicle routing problem in dependence of different vehicle classes, (pp. 49–58). Berlin Heidelberg: Springer.
Lenstra, J.K., & Kan, A.H.G.R. (1981). Complexity of vehicle routing and scheduling problems. Networks, 11(2), 221– 227.
Li, J. (2012). Vehicle routing problem with time windows for reducing fuel consumption. Journal of Computers, 7(2), 3020–3027.
Lin, C., Choy, K., Ho, G., Chung, S., Lam, H. (2014). Survey of green vehicle routing problem: Past and future trends. Expert Systems with Applications, 41, 1118–1138.
Ma, X., Huang, Z., Koutsopoulos, H. (2014). Integrated traffic and emission simulation: a model calibration approach using aggregate information. Environmental Modeling & Assessment. doi:10.1007/s10666-013-9397-8.
Ma, X., Lei, W., Andrasson, I., Chen, H. (2012). An evaluation of microscopic emission models for traffic pollution simulation using on-board measurement. Environmental Modeling & Assessment, 17(4), 375–387.
Macedo, R., Alves, C., de Carvalho, J.V., Clautiaux, F., Hanafi, S. (2011). Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. European Journal of Operational Research, 214(3), 536–545.
Marinakis, Y., Migdalas, A., Pardalos, P. (2007). A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm. Journal of Global Optimization, 38(4), 555–580.
Mingozzi, A., Roberti, R., Toth, P. (2013). An exact algorithm for the multitrip vehicle routing problem. INFORMS Journal on Computing, 25(2), 193–207.
Nanduri, V., & Kazemzadeh, N. (2012). A survey of carbon market mechanisms and models. In Q.P. Zheng, S. Rebennack, P.M. Pardalos, M.V.F. Pereira, N.A. Iliadis (Eds.), Handbook of C O 2 in Power Systems, Energy Systems, (pp. 89–105). Berlin Heidelberg: Springer.
Nguyen, P.K., Crainic, T.G., Toulouse, M. (2013). A tabu search for time-dependent multi-zone multi-trip vehicle routing Problem with Time Windows. European Journal of Operational Research, 231(1), 43–56.
Olivera, A., & Viera, O. (2007). Adaptive memory programming for the vehicle routing problem with multiple trips. Computers & Operations Research, 34(1), 28–47.
Petch, R., & Salhi, S. (2004). A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. Discrete Applied Mathematics, 133(1–3), 69–92.
Report to Congress U.S. Department of Transportation (2010). Transportation’srole in reducing U.S. greenhouse gas emissions. Volume 1: Synthesis Report, Department of Transportation, USA.
Salhi, S., & Petch, R.J. (2007). A GA based heuristic for the vehicle routing problem with multiple trips. Journal of Mathematical Modelling and Algorithms, 6(4), 591–613.
Solomon, M.M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2), 254–265.
Svirezhev, Y., Brovkin, V., von Bloh, W., Schellnhuber, H., Petschel-Held, G. (1999). Optimisation of reduction of global C O 2 emission based on a simple model of the carbon cycle. Environmental Modeling & Assessment, 4(1), 23– 33.
Taillard, E. (1993). Parallel iterative search methods for vehicle routing problems. Networks, 23(8), 661–673.
Tavakkoli-Moghaddam, R., Gazanfari, M., Alinaghian, M., Salamatbakhsh, A., Norouzi, N. (2011). A new mathematical model for a competitive vehicle routing problem with time windows solved by simulated annealing. Journal of Manufacturing Systems, 30(2), 83–92.
Yellow, P.C. (1970). A computational modification to the savings method of vehicle scheduling. Operational Research Quarterly, 21(2), 281–283.
This research is partially supported by LATNA Laboratory, NRU HSE, RF government grant, ag. 11.G34.31.0057., and D. Cinar is supported by TUBITAK- BIDEB 2219-International Postdoctoral Research Scholarship Program during this study at the University of Florida. We thank the anonymous reviewers for providing insightful comments and directions which has resulted in this paper.
About this article
Cite this article
Cinar, D., Gakis, K. & Pardalos, P.M. Reduction of CO2 Emissions in Cumulative Multi-Trip Vehicle Routing Problems with Limited Duration. Environ Model Assess 20, 273–284 (2015). https://doi.org/10.1007/s10666-014-9434-2