完整後設資料紀錄
DC 欄位語言
dc.contributor.authorYang, Shun-Nengen_US
dc.contributor.authorCheng, Wei-Shengen_US
dc.contributor.authorHsu, Yu-Chingen_US
dc.contributor.authorGan, Chai-Hienen_US
dc.contributor.authorLin, Yi-Bingen_US
dc.date.accessioned2014-12-08T15:30:36Z-
dc.date.available2014-12-08T15:30:36Z-
dc.date.issued2013-06-01en_US
dc.identifier.issn0895-7177en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.mcm.2011.11.054en_US
dc.identifier.urihttp://hdl.handle.net/11536/21871-
dc.description.abstractToday, charging stations (CSs) for electric vehicles (EVs) are much less popular than gas stations. Therefore, searching and selecting CSs is an important issue for the drivers of EVs. This paper investigates the EV charging problem. We propose two types of CS-selection algorithms. The first type only utilizes local information of an EV. The second type utilizes the global information obtained through interactions between the EVs and a Global CS-selection (GCS) server through the mobile telecommunications network. Our study indicates that by using the global information (specifically the workload status of each CS), the EVs can be effectively charged with short waiting times at the CSs. (C) 2011 Elsevier Ltd. All rights reserved.en_US
dc.language.isoen_USen_US
dc.subjectCharge schedulingen_US
dc.subjectCharging station selectionen_US
dc.subjectElectric vehicleen_US
dc.titleCharge scheduling of electric vehicles in highwaysen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.mcm.2011.11.054en_US
dc.identifier.journalMATHEMATICAL AND COMPUTER MODELLINGen_US
dc.citation.volume57en_US
dc.citation.issue11-12en_US
dc.citation.spage2873en_US
dc.citation.epage2882en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000318915800027-
dc.citation.woscount2-
顯示於類別:期刊論文


文件中的檔案:

  1. 000318915800027.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。