Joint optimization of green vehicle scheduling and routing problem with time-varying speeds

32Citations
Citations of this article
51Readers
Mendeley users who have this article in their library.

Abstract

Based on an analysis of the congestion effect and changes in the speed of vehicle flow during morning and evening peaks in a large- or medium-sized city, the piecewise function is used to capture the rules of the time-varying speed of vehicles, which are very important in modelling their fuel consumption and CO2 emission. A joint optimization model of the green vehicle scheduling and routing problem with time-varying speeds is presented in this study. Extra wages during nonworking periods and soft time-window constraints are considered. A heuristic algorithm based on the adaptive large neighborhood search algorithm is also presented. Finally, a numerical simulation example is provided to illustrate the optimization model and its algorithm. Results show that, (1) the shortest route is not necessarily the route that consumes the least energy, (2) the departure time influences the vehicle fuel consumption and CO2 emissions and the optimal departure time saves on fuel consumption and reduces CO2 emissions by up to 5.4%, and (3) extra driver wages have significant effects on routing and departure time slot decisions.

Cite

CITATION STYLE

APA

Zhang, D., Wang, X., Li, S., Ni, N., & Zhang, Z. (2018). Joint optimization of green vehicle scheduling and routing problem with time-varying speeds. PLoS ONE, 13(2). https://doi.org/10.1371/journal.pone.0192000

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free