Rectangle packing problem for battery charging dispatch considering uninterrupted discrete charging rate

Tao Ding; Jiawen Bai; Pengwei Du; Boyu Qin; Furong Li; Jin Ma; Zhaoyang Dong

doi:10.1109/TPWRS.2019.2892615

Rectangle packing problem for battery charging dispatch considering uninterrupted discrete charging rate

Tao Ding^*
, Jiawen Bai
, Pengwei Du
, Boyu Qin
, Furong Li
, Jin Ma
, Zhaoyang Dong

^*Corresponding author for this work

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

23 Citations (Scopus)

Abstract

A battery charging dispatch model is proposed in this letter for a battery swap station to maximize the total profit over the given time horizon by finding the optimal dispatch of the batteries, while guaranteeing the corresponding power and energy constraints. To address the uninterrupted discrete charging rate, this problem is skillfully formulated as a two-dimensional-rectangle packing problem that can be solved by a mixed-integer linear program. Numerical results suggest that the rectangle packing problem can efficiently coordinate the dispatch of the multi-type batteries. © 1969-2012 IEEE.

Original language	English
Article number	8610220
Pages (from-to)	2472-2475
Journal	IEEE Transactions on Power Systems
Volume	34
Issue number	3
DOIs	https://doi.org/10.1109/TPWRS.2019.2892615
Publication status	Published - 1 May 2019
Externally published	Yes

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Research Keywords

Battery charging
Mixed integer program
Rectangle packing problem
Uninterrupted discrete-rate charging

Access Output

10.1109/TPWRS.2019.2892615

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{7c28031a63ca41409e02bbf1b2647cb1,

title = "Rectangle packing problem for battery charging dispatch considering uninterrupted discrete charging rate",

abstract = "A battery charging dispatch model is proposed in this letter for a battery swap station to maximize the total profit over the given time horizon by finding the optimal dispatch of the batteries, while guaranteeing the corresponding power and energy constraints. To address the uninterrupted discrete charging rate, this problem is skillfully formulated as a two-dimensional-rectangle packing problem that can be solved by a mixed-integer linear program. Numerical results suggest that the rectangle packing problem can efficiently coordinate the dispatch of the multi-type batteries. {\textcopyright} 1969-2012 IEEE.",

keywords = "Battery charging, Mixed integer program, Rectangle packing problem, Uninterrupted discrete-rate charging",

author = "Tao Ding and Jiawen Bai and Pengwei Du and Boyu Qin and Furong Li and Jin Ma and Zhaoyang Dong",

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].",

year = "2019",

month = may,

day = "1",

doi = "10.1109/TPWRS.2019.2892615",

language = "English",

volume = "34",

pages = "2472--2475",

journal = "IEEE Transactions on Power Systems",

issn = "0885-8950",

publisher = "IEEE",

number = "3",

}

TY - JOUR

T1 - Rectangle packing problem for battery charging dispatch considering uninterrupted discrete charging rate

AU - Ding, Tao

AU - Bai, Jiawen

AU - Du, Pengwei

AU - Qin, Boyu

AU - Li, Furong

AU - Ma, Jin

AU - Dong, Zhaoyang

N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

PY - 2019/5/1

Y1 - 2019/5/1

N2 - A battery charging dispatch model is proposed in this letter for a battery swap station to maximize the total profit over the given time horizon by finding the optimal dispatch of the batteries, while guaranteeing the corresponding power and energy constraints. To address the uninterrupted discrete charging rate, this problem is skillfully formulated as a two-dimensional-rectangle packing problem that can be solved by a mixed-integer linear program. Numerical results suggest that the rectangle packing problem can efficiently coordinate the dispatch of the multi-type batteries. © 1969-2012 IEEE.

AB - A battery charging dispatch model is proposed in this letter for a battery swap station to maximize the total profit over the given time horizon by finding the optimal dispatch of the batteries, while guaranteeing the corresponding power and energy constraints. To address the uninterrupted discrete charging rate, this problem is skillfully formulated as a two-dimensional-rectangle packing problem that can be solved by a mixed-integer linear program. Numerical results suggest that the rectangle packing problem can efficiently coordinate the dispatch of the multi-type batteries. © 1969-2012 IEEE.

KW - Battery charging

KW - Mixed integer program

KW - Rectangle packing problem

KW - Uninterrupted discrete-rate charging

UR - https://www.scopus.com/pages/publications/85065241301

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85065241301&origin=recordpage

U2 - 10.1109/TPWRS.2019.2892615

DO - 10.1109/TPWRS.2019.2892615

M3 - RGC 21 - Publication in refereed journal

SN - 0885-8950

VL - 34

SP - 2472

EP - 2475

JO - IEEE Transactions on Power Systems

JF - IEEE Transactions on Power Systems

IS - 3

M1 - 8610220

ER -

Rectangle packing problem for battery charging dispatch considering uninterrupted discrete charging rate

Abstract

Bibliographical note

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this