The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Optimal Traffic-Power Flow in Urban Electrified Transportation Networks
Abstract
This paper conducts an interdisciplinary study on the coordinated operation of both transportation system and power system. We consider an electrified transportation network enabled by wireless power transfer technology and coupled with a power distribution network (PDN) in the future city. The independent system operator, which is a public entity, is eligible to manage generation assets and charge congestion tolls (CTs) on electrified roads with the purpose of minimizing social cost. The route choices of electric vehicles are amenable to the Wardrop user equilibrium (UE) principle, such that no one can reduce his travel cost by changing route unilaterally. The traffic UE pattern further influences the spatial distribution of the electrical loads of the PDN. The power flow of the PDN is modeled through Dist-Flow equations. To find out the best generation schedule and CTs, we propose an optimal traffic-power flow model, which is a mixed integer nonlinear program with traffic UE constraints and further reformulated as a mixed integer second-order cone program, whose global optimal solution is accessible with reasonable computation effort. Case studies corroborate the benefits from the joint operation of the coupled networks, and demonstrate that ignoring the interdependency between the two critical infrastructures may lead to an insecure operation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Nonlinear programming: theory and algorithms
(1993) · Computers & Operations Research · doi:10.1016/0305-0548(93)90042-h · Cited by 5,779
Network reconfiguration in distribution systems for loss reduction and load balancing
Baran, M. E., & Wu, F. F. (1989) · IEEE Transactions on Power Delivery · doi:10.1109/61.25627 · Cited by 5,077
Network Reconfiguration in Distribution Systems for Loss Reduction and Load Balancing
Baran, M. E., & Wu, F. F. (1989) · IEEE Power Engineering Review · doi:10.1109/mper.1989.4310642 · Cited by 3,350
Applications of second-order cone programming
Lobo, M. S., Vandenberghe, L., Boyd, S., & Lebret, H. (1998) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(98)10032-0 · Cited by 2,401
Urban transportation networks: Equilibrium analysis with mathematical programming methods
(1986) · Transportation Research Part A: General · doi:10.1016/0191-2607(86)90023-3 · Cited by 2,349
Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods
Kolda, T. G., Lewis, R. M., & Torczon, V. (2003) · SIAM Review · doi:10.1137/s003614450242889 · Cited by 1,653
Branch Flow Model: Relaxations and Convexification—Part I
Farivar, M., & Low, S. H. (2013) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2013.2255317 · Cited by 1,541 · cited 1×
“It is shown in [38], [39] that DistFlow constrained OPF problems admit exact SOC relaxations, which proceeds as follows.”
BackgroundStudies in the Economics of Transportation.
Smeed, R. J., Beckmann, M., McGuire, C. B., Winsten, C. B., & Koopmans, T. C. (1957) · The Economic Journal · doi:10.2307/2227641 · Cited by 1,488
Integration of electric vehicles in the electric power system
Lopes, J. A. P., Soares, F. J., & Almeida, P. M. R. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2066250 · Cited by 1,465
Cited by
Hoang, A. T., Pham, V. V., & Nguyen, X. P. (2021) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2021.127161 · Cited by 663
Network Equilibrium of Coupled Transportation and Power Distribution Systems
Wei, W., Wu, L., Wang, J., & Mei, S. (2018) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2017.2723016 · Cited by 360
Self-citationWang, X., Shahidehpour, M., Jiang, C., & Li, Z. (2019) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2018.2867176 · Cited by 277
Self-citationSmart (Electricity) Grids for Smart Cities: Assessing Roles and Societal Impacts
Masera, M., Bompard, E. F., Profumo, F., & Hadjsaid, N. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2812212 · Cited by 185
Metadata
- Authors
- Wei, W., Mei, S., Wu, L., Shahidehpour, M., & Fang, Y.
- Venue
- IEEE Transactions on Smart Grid
- Published
- 2017-01
- Volume
- 8
- Issue
- 1
- Pages
- 84-95
- ISSN
- 1949-3053 (ISSN-L)
- 1949-3061
- OpenAlex
- W2522715769
- Cited by
- 285
- References
- 46
- FWCI
- 5.18
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.