Skip to main content

A Skewed General Variable Neighborhood Search Approach for Solving the Battery Swap Station Location-Routing Problem with Capacitated Electric Vehicles

  • Chapter
  • First Online:
Green Transportation and New Advances in Vehicle Routing Problems
  • 611 Accesses

Abstract

The station location problem plays an important role for reducing the amount of energy consumption in several logistics companies while identifying the location of the stations and the number of the located stations. In addition, an electric vehicle represents a significant factor to minimize the costs and to reduce the pollution caused by transport operations. To achieve these goals, we consider a new variant of location-routing problem for an electric vehicle with a single depot, such as the location decision is undertaken about the battery swap stations with an elaboration of vehicle routing. Our solution method is based on a skewed version of the variable neighborhood search (SVNS) metaheuristic. The local search corresponds to the mixed variable neighborhood descent (Mixed-VND) where a set of four routing neighborhood structures are described in the sequential VND procedure and nested with relocated station move. The solution generated by the local search is compared to the current solution according to a particular distance function. The obtained results for all available instances of the problem show the performance of our approach compared to those existing in the literature.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 179.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 179.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Affi, M., Derbel, H., Jarboui, B.: Variable neighborhood search algorithm for the green vehicle routing problem. Int. J. Ind. Eng. Comput. 9(2), 195–204 (2018)

    Google Scholar 

  2. Albareda-Sambola, M., Dıaz, J.A., Fernández, E.: A compact model and tight bounds for a combined location-routing problem. Comput. Oper. Res. 32(3), 407–428 (2005)

    Article  MathSciNet  Google Scholar 

  3. Bruglieri, M., Pezzella, F., Pisacane, O., Suraci, S.: A variable neighborhood search branching for the electric vehicle routing problem with time windows. Electron. Notes Discrete Math. 47, 221–228 (2015)

    Article  MathSciNet  Google Scholar 

  4. Derbel, H., Jarboui, B., Hanafi, S., Chabchoub, H.: Genetic algorithm with iterated local search for solving a location-routing problem. Exp. Syst. Appl. 39(3), 2865–2871 (2012)

    Article  Google Scholar 

  5. Erdoğan, S., Miller-Hooks, E.: A green vehicle routing problem. Transp. Res. E Logist. Transp. Rev. 48(1), 100–114 (2012)

    Article  Google Scholar 

  6. Felipe, Á., Ortuño, M.T., Righini, G., Tirado, G.: A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges. Transp. Res. E Logist. Transp. Rev. 71, 111–128 (2014)

    Article  Google Scholar 

  7. Hansen, P., Mladenović, N., Pérez, J.A.: Variable neighbourhood search: methods and applications. 4OR 6(4), 319–360 (2008)

    Google Scholar 

  8. Hiermann, G., Puchinger, J., Ropke, S., Hartl, R.F.: The electric fleet size and mix vehicle routing problem with time windows and recharging stations. Eur. J. Oper. Res. 252(3), 995–1018 (2016)

    Article  MathSciNet  Google Scholar 

  9. Ilić, A., Urošević, D., Brimberg, J., Mladenović, N.: A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem. Eur. J. Oper. Res. 206(2), 289–300 (2010)

    Article  MathSciNet  Google Scholar 

  10. Jarboui, B., Derbel, H., Hanafi, S., Mladenović, N.: Variable neighborhood search for location routing. Comput. Oper. Res. 40(1), 47–57 (2013)

    Article  MathSciNet  Google Scholar 

  11. Laporte, G., Nobert, Y.: An exact algorithm for minimizing routing and operating costs in depot location. Eur. J. Oper. Res. 6(2), 224–226 (1981)

    Article  Google Scholar 

  12. Macedo, R., Alves, C., Hanafi, S., Jarboui, B., Mladenović, N., Ramos, B., de Carvalho, J.M.V.: Skewed general variable neighborhood search for the location routing scheduling problem. Comput. Oper. Res. 61, 143–152 (2015)

    Article  MathSciNet  Google Scholar 

  13. Schneider, M., Stenger, A., Goeke, D.: The electric vehicle-routing problem with time windows and recharging stations. Transp. Sci. 48(4), 500–520 (2014)

    Article  Google Scholar 

  14. Taha, M., Fors, M.N., Shoukry, A.A.: An exact solution for a class of green vehicle routing problem. In: International Conference on Industrial Engineering and Operations Management, pp. 7–9 (2014)

    Google Scholar 

  15. Yang, J., Sun, H.: Battery swap station location-routing problem with capacitated electric vehicles. Comput. Oper. Res. 55, 217–232 (2015)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Affi, M., Derbel, H., Jarboui, B., Siarry, P. (2020). A Skewed General Variable Neighborhood Search Approach for Solving the Battery Swap Station Location-Routing Problem with Capacitated Electric Vehicles. In: Derbel, H., Jarboui, B., Siarry, P. (eds) Green Transportation and New Advances in Vehicle Routing Problems. Springer, Cham. https://doi.org/10.1007/978-3-030-45312-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-45312-1_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-45311-4

  • Online ISBN: 978-3-030-45312-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics