SavedAdd your journal

Journals / ACADEMIC PLATFORM-JOURNAL OF ENGINEERING AND SCIENCE / 2021 / Cilt: 9 - Sayı: 2

A Methodology for Explicit Representation of the Stochastic Demand due to Electric Vehicles in Generation Expansion Planning Problems

Hatice Tekiner MOGULKOC
Pages
257–263
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

The results show that GEP models with selected demand curves produce more realistic decisions (closer to the solutions obtained by using the entire demand patterns) than the decisions obtained by the models with average EVs demand.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Generation expansion planning (GEP) problems are solved to find the optimum investment decisions to satisfy the increasing electricity demand.
📊
Key Findings & Data:Integration of electric vehicles (EVs) with the capability of charging from the grid will also increase the electricity demand of the grid.
💡
Conclusion & Impact:The results show that GEP models with selected demand curves produce more realistic decisions (closer to the solutions obtained by using the entire demand patterns) than the decisions obtained by the models with average EVs demand.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Özet

Generation expansion planning (GEP) problems are solved to find the optimum investment decisions to satisfy the increasing electricity demand. Integration of electric vehicles (EVs) with the capability of charging from the grid will also increase the electricity demand of the grid. Depending on the charging/driving characteristics of users, demand curves for EVs will be shaped and it will be different on each day. Therefore, it is very crucial to represent this stochastic nature of EVs demand in the associated GEP problems. This paper is proposing a methodology to represent EVs demand realistically on GEP models. The proposed methodology starts with generating random demand patterns to demonstrate possibilities for the EVs demand patterns via Monte Carlo Simulation, then using an optimization-based model to select a representative set. Two stage stochastic programming model is proposed for GEP problems and solved to minimize the expected cost over the entire set, the representative set and the average EVs demand. The results show that GEP models with selected demand curves produce more realistic decisions (closer to the solutions obtained by using the entire demand patterns) than the decisions obtained by the models with average EVs demand. In most cases, the models using average EVs demand fail to capture the new peaks generated by EVs, therefore, they suggest less capacity expansion then the required amount. This results in more unmet demand in the system.

🔖

Cite This Article

MOGULKOC, H. T. (2021). A Methodology for Explicit Representation of the Stochastic Demand due to Electric Vehicles in Generation Expansion Planning Problems. ACADEMIC PLATFORM-JOURNAL OF ENGINEERING AND SCIENCE, Cilt: 9 - Sayı: 2, 257–263. https://ajindex.com/articles/354798

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (11)

  1. T. Saraç and S. Kaya, “Plasti̇ k enjeksi̇ yon maki̇ neleri̇ ni̇ n vardi̇ ya bazinda çi̇ zelgelenmesi̇ problemi̇ i̇ çi̇ n bi̇ r hedef programlama modeli̇,” Journal of Industrial Engineering, vol. 24, pp. 12–26
  2. T. Eren and E. Güner, “Sira-Bağimli Hazirlik Zamanli İki Ölçütlü Çizelgeleme Problemi: Toplam Tamamlanma Zamani Ve Maksimum Erken Bitirme,” Erciyes University Journal of Science and Technology, vol. 23, no. 1-2, pp. 95–105, 2007
  3. T. Eren, “Learning and Deteriorating Effects on the Single Machine Scheduling Problems,” International Journal of Engineering Research and Development, vol. 6, no. 1, pp. 15–20, Jan. 2014. [4] "Digital Conversion on the Way to Industry 4.0", Springer Science and Business Media LLC, 2021 [5] V.F. Viagas, A. Costa, Two novel population based algorithms for the single machine scheduling problem with sequence dependent setup times and release times, Swarm and Evolutionary Computation, Volume 63, 2021, 100869, ISSN 2210-6502,
  4. Y. Zhao and G. Wang, “A dynamic differential evolution algorithm for the dynamic single-machine scheduling problem with sequence-dependent setup times Yue,” Journal of the Operational Research Society, vol. 71, no. 2, pp. 225–236, 2020
  5. S. Muştu and T. Eren, “The Single Machine Scheduling Problem with Sequence-Dependent Setup Times and a Learning Effect on Processing Times.,” Applied Soft Computing, vol. 71, pp. 291–306, 2018
  6. P. Perez-Gonzalez and J. M. Framinan, “Single machine scheduling with periodic machine availability,” Computers & Industrial Engineering, vol. 123, pp. 180–188, 2018
  7. R. M. Souza, S. Ricardo, and M. Felizardo, “Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties,” Computers and Operations Research, vol. 81, pp. 203–215, 2017
  8. Z. Ceylan, E. Karan, Ç. Bakirci, and S. Sabuncu “Single Machine Scheduling Problem with Sequence Dependent Setup Times: An Application in White Goods I,” International Journal of Multidisciplinary Studies and Innovative Technologies, vol. 3, no. 1, pp. 14–21, 2019
  9. O. Herr and A. Goel, “Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints,” European Journal of Operational Research, vol. 248, no. 1, pp. 123–135, 2016
  10. T. Prabhakar, “A Production Scheduling Problem with Sequencing,” Management Science, vol. 21, no. 1, pp. 34–42, 2014
  11. T. C. E. Cheng, W. C. Lee,