Skip to main content
SpringerLink
Log in

Joint Scheduling and Optimal Charging of Electric Vehicles Problem

  • Conference paper
Computational Science and Its Applications – ICCSA 2014 (ICCSA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8580))

Included in the following conference series:

Abstract

In this paper, we consider the joint scheduling and optimal charging of electric vehicles problem. This problem can be defined as follows: Given a fleet of Electric Vehicles - EV and Combustion Engine Vehicles - CV, a set of tours to be processed by vehicles and a charging infrastructure, the problem aims to optimize the assignment of vehicles to tours and to minimize the charging cost of EVs while considering several operational constraints mainly related to chargers, electricity grid, and EVs driving range. We prove the NP-hardness in the ordinary sense of this problem. We provide a mixed-integer linear programming formulation to model the joint Scheduling and Optimal Charging of EVs problem (EVSCP) and we use CPLEX to solve small and medium instances. A two-phase sequential heuristic, based on the Maximum Weight Clique Problem (MWCP) and the Minimum Cost Flow Problem (MCFP), is developed to solve large instances of the EVSCP. Computational results on a large set of real and randomly generated test instances show the efficiency and the effectiveness of the proposed approaches.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lopez, M.A., Martin, S., Aguado, J.A., De la Torre, S.: V2G strategies for congestion management in microgrids with high penetration of electric vehicles. Electr. Pow. Syst. Res. 104, 28–34 (2013)

    Article  Google Scholar 

  2. Jian, J., Zhu, X., Shao, Z., Niu, S., Chan, C.C.: A scenario of vehicle-to-grid implementation and its double-layer optimal charging strategy for minimizing load variance within regional smart grids. Energ. Convers. Manage. 78, 508–517 (2014)

    Article  Google Scholar 

  3. Soares, J., Sousa, T., Morais, H., Vale, Z., Canizes, B., Silva, A.: Application-Specific Modified Particle Swarm Optimization for energy resource scheduling considering vehicle-to-grid. Appl. Soft Comput. 13, 4264–4280 (2013)

    Article  Google Scholar 

  4. Ramezani, M., Graf, M., Vogt, H.: A simulation environment for smart charging of electric vehicles using a multi-objective evolutionary algorithm. In: Kranzlmüller, D., Tjoa, A.M. (eds.) ICT-GLOW 2011. LNCS, vol. 6868, pp. 56–63. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  5. Lee, J., Park, G.-L., Kwak, H.-Y., Jeon, H.: Design of an energy consumption scheduler based on genetic algorithms in the smart grid. In: Jędrzejowicz, P., Nguyen, N.T., Hoang, K. (eds.) ICCCI 2011, Part I. LNCS, vol. 6922, pp. 438–447. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  6. Kang, J., Duncan, S.J., Mavris, D.N.: Real-time Scheduling Techniques for Electric Vehicle Charging in Support of Frequency Regulation. Procedia Comput. Sci. 16, 767–775 (2013)

    Article  Google Scholar 

  7. Wang, Y.W.: An optimal location choice model for recreation-oriented scooter recharge stations. Transport. Res. Part D: Transport and Environment 12(3), 231–237 (2007)

    Article  MATH  Google Scholar 

  8. Wang, Y.W.: Locating battery exchange stations to serve tourism transport. Transport. Res. Part D: Transport and Environment 13(3), 193–197 (2008)

    Article  Google Scholar 

  9. Wang, Y.W., Lin, C.C.: Locating multiple types of recharging stations for battery-powered electric vehicle transport. Transport. Res. Part E 58, 76–87 (2013)

    Article  Google Scholar 

  10. He, F., Wu, D., Yin, Y., Guan, Y.: Optimal deployment of public charging stations for plug-in hybrid electric vehicles. Transport. Res. Part B 47, 87–101 (2013)

    Article  Google Scholar 

  11. Artmeier, A., Haselmayr, J., Leucher, M., Sachenbacher, M.: The optimal routing problem in the context of battery-powered electric vehicles. In: 2nd International Workshop on Constraint Reasoning and Optimization for Computational Sustainability, Workshop CROCS at CPAIOR 2010 (2010)

    Google Scholar 

  12. Erdogan, S., Miller-Hooks, E.: A Green Vehicle Routing Problem. Transport. Res. Part E 48, 100–114 (2012)

    Article  Google Scholar 

  13. Lin, C., Choy, K.L., Ho, G.T.S., Chung, S.H., Lam, H.Y.: Survey of Green Vehicle Routing Problem: Past and future trends. Expert. Syst. Appl. 41, 1118–1138 (2014)

    Article  Google Scholar 

  14. Bashash, S., Moura, S.J., Forman, J.C., Fathy, H.K.: Plug-in hybrid electric vehicle charge pattern optimization for energy and battery longevity. J. Power Sources 196, 541–549 (2011)

    Article  Google Scholar 

  15. Kolen, W.J.A., Lenstra, J.K., Papadimitriou, C.H., Spieksma, F.C.R.: Interval Scheduling: A Survey. Nav. Res. Logist. 54, 530–543 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  16. Kovalyov, M.Y., Ng, C.T., Cheng, T.C.E.: Fixed interval scheduling: Models, applications, computational complexity and algorithms. Eur. J. Oper. Res. 178, 331–342 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  17. Arkin, E.M., Silverberg, E.B.: Scheduling with fixed start and end times. Discrete Appl. Math. 18, 1–8 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  18. Bouzina, K.I., Emmons, H.: Interval scheduling on identical machines. J. Global Optim. 9, 379–393 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  19. Faigle, U., Nawijn, W.M.: Note on scheduling intervals on-line. Discrete Appl. Math. 58, 13–17 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  20. Carlisle, M.C., Lloyd, E.L.: On the k-coloring of intervals. Discrete Appl. Math. 59, 225–235 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  21. Garey, R., Johnson, S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, A Series of Books in the Mathematical Sciences. William H. Freeman, United States (1979)

    Google Scholar 

  22. Brijnesh, J.J., Wysotski, F.: The Maximum Weighted Clique Problem and Hopfield Network. In: Proceedings - European Symposium on Artificial Neural Networks (ESANN), Bruges, pp. 331–336 (2004)

    Google Scholar 

  23. Yamaguchi, K., Masuda, S.: A New Exact Algorithm for the Maximum Weight Clique. In: The 23rd International Technical Conference on Circuits/Systems, Computers and Communications, Yamaguchi (2008)

    Google Scholar 

  24. Balas, E., Yu, C.S.: On graphs with polynomially solvable maximum-weight clique problem. Networks 19, 247–253 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  25. Orlin, J.B.: A Faster Strongly Polynomial Minimum Cost Flow Algorithm. Oper. Res. 41(2), 338–350 (1993)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Lorraine - LORIA, Nancy, France

    Ons Sassi

  2. University of Lorraine, Ile de Saulcy, Metz, France

    Ammar Oulamara

Authors
  1. Ons Sassi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ammar Oulamara
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Engineering, University of Basilicata, 85100, Potenza, Italy

    Beniamino Murgante

  2. Department of Computer and Information Sciences, Covenant University, Ota, Nigeria

    Sanjay Misra

  3. Department of Production and Systems, University of Minho, 4710-057, Braga, Portugal

    Ana Maria A. C. Rocha

  4. DICAR, Polytecnico di Bari, 70125, Bari, Italy

    Carmelo Torre

  5. University of Minho, Braga, Portugal

    Jorge Gustavo Rocha  & Maria Irene Falcão  & 

  6. Monash University, 3800, Clayton, VIC, Australia

    David Taniar

  7. Department of Intelligent Informatics, Kyushu Sangyo University, 2-3-1 Matsukadai, 813-8503, Higashi-ku, Fukuoka, Japan

    Bernady O. Apduhan

  8. Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli, 1, 06123, Perugia, Italy

    Osvaldo Gervasi

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Sassi, O., Oulamara, A. (2014). Joint Scheduling and Optimal Charging of Electric Vehicles Problem. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2014. ICCSA 2014. Lecture Notes in Computer Science, vol 8580. Springer, Cham. https://doi.org/10.1007/978-3-319-09129-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09129-7_6

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09128-0

  • Online ISBN: 978-3-319-09129-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation