Show simple item record

Electric vehicle charging under power and balance constraints as dynamic scheduling

dc.contributor.authorHernández Arauzo, Alejandro 
dc.contributor.authorPuente Peinador, Jorge 
dc.contributor.authorVarela Arias, José Ramiro 
dc.contributor.authorSedano Franco, Javier
dc.date.accessioned2015-10-30T11:52:35Z
dc.date.available2015-10-30T11:52:35Z
dc.date.issued2015
dc.identifier.citationComputers & Industrial Engineering, 85, p. 306-315 (2015); doi:10.1016/j.cie.2015.04.002
dc.identifier.issn0360-8352
dc.identifier.issn1879-0550
dc.identifier.urihttp://hdl.handle.net/10651/33766
dc.description.abstractScheduling the charging periods for a large set of electric vehicles with the objective of satisfying the user demands may be a very hard problem due to the physical constraints of the charging stations. In this paper, we consider a problem of this family which is motivated by a real life situation where a set of users demand electric charge while their vehicles are parked. Each stall has a charging point which is connected to one of the lines of a three-phase electric feeder. There are power constraints that limit the number of vehicles that can be charging at the same time on the same line and balance constraints that limit the difference in the number of vehicles charging in every two lines. We model this problem in the framework of Dynamic Constraint Satisfaction Problem (DCSP) with Optimization, and propose a solution procedure that requires solving a sequence of CSPs over time. Each one of these CSPs requires in its turn solving three instances of a one machine sequencing problem with variable capacity. This procedure was implemented on a simulator of the charging station and evaluated on a number of instances defined from different scenarios of vehicle arrivals and energy requirements. The results of the experimental study show clearly that the proposed algorithm is effective and that it produces schedules much better than those computed by a classic dispatching ruleeng
dc.description.sponsorshipThis research has been supported by the Spanish Government under research Projects TIN2010-20976-C02-02 and TIN2013-46511-C2-2-P, by the ITCL under Contract FUO-EM-075-13 an by the Principality of Asturias under Contract FC-13-COF13-035eng
dc.format.extentp. 306-315spa
dc.language.isoengspa
dc.publisherElsevierspa
dc.relation.ispartofComputers & Industrial Engineering, 85spa
dc.rights© 2015 Elsevier
dc.subjectScheduling electric vehicles chargingspa
dc.subjectDynamic Constraint Satisfaction Problemsspa
dc.subjectPower and balance constraintsspa
dc.subjectOne machine sequencingspa
dc.subjectTardiness minimizationspa
dc.titleElectric vehicle charging under power and balance constraints as dynamic schedulingeng
dc.typeinfo:eu-repo/semantics/articlespa
dc.identifier.doi10.1016/j.cie.2015.04.002
dc.type.dcmitextspa
dc.relation.projectIDTIN2010-20976-C02-02
dc.relation.projectIDTIN2013-46511-C2-2-P
dc.relation.projectIDFUO-EM-075-13
dc.relation.projectIDFC-13-COF13-035
dc.relation.publisherversionhttp://dx.doi.org/10.1016/j.cie.2015.04.002spa
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessspa


Files in this item

untranslated

This item appears in the following Collection(s)

Show simple item record