Abstract
Caused by regulations regarding to climate protection, battery electric vehicles (BEVs) offer great opportunities in context of ecological compatibility of urban transport systems. Therefore, operating models in context of vehicle routing are required. Because of the BEVs more restrictive driving range in comparison to vehicles with an internal combustion engine (ICE) and due to the fact of a less-developed network of service stations, model formulations have to include the possibility of recharging at dedicated locations. So additional restrictions in formulations are needed to handle the maximum range depending on battery capacity. There were published only a small number of articles addressed to energy consumption, battery range and possible recharging stops in mixed-integer programming (MIP) formulations in the underlying practice relevant Vehicle Routing Problem with Time Windows (VRPTW) over the past few years. So we describe different MIP-formulations for an enhanced VRPTW, considering capacity restrictions concerning to cargo and energy, customer time windows and the capability of charging stops. Effects of these formulations are shown for small-sized problems, while a column generation approach is presented for more realistic problem instances.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Achterberg, T. (2009). SCIP: solving constraint integer programs. Mathematical Programming Computation, 1(1), 1–41.
Desaulniers, G., Desrosiers, J., & Solomon, M. M. (2005). Column generation. New York: Springer.
Desrochers, M., Desrosiers, J., & Solomon, M. M. (1992). A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40, 324–354.
Erdogan, S., & Miller-Hooks, E. (2012). A green vehicle routing problem. Transportation Research Part E, 48, 100–114.
Preis, H., Frank, S., & Nachtigall, K. (2014). Energy-optimized routing of electric vehicles in urban delivery systems. In: S. Helber, M. Breitner, D. Rösch, C. Schön, J. -M. Graf von der Schulenburg, P. Sibbertsen, M. Steinbach, S. Weber, & A. Wolter (Eds.), Operations research proceedings 2012 (pp. 583–588). Berlin: Springer
Schneider, M., Stenger, A., & Goeke, D. (2012). The electric vehicle routing problem with time windows and recharging stations. Technical report 02/2012
Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35, 254–265.
Toth, P., & Vigo, D. (2002). The vehicle routing problem. Philadelphia: Siam.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Frank, S., Preis, H., Nachtigall, K. (2014). On the Modeling of Recharging Stops in Context of Vehicle Routing Problems. In: Huisman, D., Louwerse, I., Wagelmans, A. (eds) Operations Research Proceedings 2013. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-07001-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-07001-8_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07000-1
Online ISBN: 978-3-319-07001-8
eBook Packages: Business and EconomicsBusiness and Management (R0)