Transportation Planning to Accommodate Needs of Wind Energy Projects

Astroza, Sebastián; Patil, Priyadarshan N.; Smith, Katherine I.; Bhat, Chandra R.

doi:10.3141/2669-02

Cited by 7 publications

(2 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is particularly important for applications where TAP is solved multiple times as a sub-problem. Some applications include network design problems (Yang 1997;Patil, Walthall, and Boyles 2022;Gokalp, Patil, and Boyles 2021), sensitivity analysis (Boyles 2012), trip table estimation (Yang 1995;Lundgren and Peterson 2008), network pricing (Yang and Lam 1996), and other bilevel optimization problems (Yin 2000;Astroza et al 2017;Pandey and Patil 2022;Boyles et al 2018). Patil, Ross, and Boyles (2021) provide additional background on convergence analysis for TAP.…”

Section: Convergence Experimentsmentioning

confidence: 99%

A fresh look at symmetric traffic assignment and algorithm convergence

Patil¹

2023

Preprint

View full text Add to dashboard Cite

Extensions of the static traffic assignment problem with link interactions were studied extensively in the past. Much of the network modeling community has since shifted to dynamic traffic assignment incorporating these interactions. We believe there are several reasons to re-examine static assignment with link interactions. First, if link interactions can be captured in a symmetric, monotone manner, equilibrium always exists and is unique, and provably-correct algorithms exist. We show that several of the most efficient algorithms for the separable traffic assignment problem can be readily applied with symmetric interactions. We discuss how the (asymmetric) Daganzo merge model can be approximated by symmetric linear cost functions. Second, we present computational evidence suggesting that convergence to equilibrium is faster when symmetric, monotone link interactions are present. This is true even when interactions are asymmetric, despite the lack of a provable convergence result. Lastly, we present convergence behavior analysis for commonly used network and link metrics. For these reasons, we think static assignment with link interactions deserves additional attention in research and practice.

show abstract

Section: Convergence Experimentsmentioning

confidence: 99%

A fresh look at symmetric traffic assignment and algorithm convergence

Patil¹

2023

Preprint

View full text Add to dashboard Cite

show abstract

“…(See our related video and abstract [11] for more details, and the resulting tour optimization.) There is an abundance of other related applied work, e.g., mowing lawns or moving huge wind turbines [9]. [11] for an accompanying abstract.…”

Section: Introductionmentioning

confidence: 99%

Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation

Fekete

Krupke

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We investigate a variety of problems of finding tours and cycle covers with minimum turn cost. Questions of this type have been studied in the past, with complexity and approximation results, and open problems dating back to work by Arkin et al. in 2001. A wide spectrum of practical applications have renewed the interest in these questions, and spawned variants: for full coverage, every point has to be covered, for subset coverage, specific points have to be covered, and for penalty coverage, points may be left uncovered by incurring an individual penalty.We make a number of contributions. We first show that finding a minimum-turn (full) cycle cover is NP-hard even in 2-dimensional grid graphs, solving the long-standing open Problem 53 in The Open Problems Project edited by Demaine, Mitchell and O'Rourke. We also prove NPhardness of finding a subset cycle cover of minimum turn cost in thin grid graphs, for which Arkin et al. gave a polynomial-time algorithm for full coverage; this shows that their boundary techniques cannot be applied to compute exact solutions for subset and penalty variants.On the positive side, we establish the first constant-factor approximation algorithms for all considered subset and penalty problem variants for very general classes of instances, making use of LP/IP techniques. For these generalized graph problems with many possible edge directions (and thus, turn angles, such as in hexagonal grids or higher-dimensional variants), our approximation factors also improve the combinatorial ones of Arkin et al. Our approach can also be extended to other geometric variants, such as scenarios with obstacles and linear combinations of turn and distance costs.

show abstract

Off Shore Wind Power: A Promising and Scalable Future Electricity Source

Bothun

2020

Springer Proceedings in Energy

View full text Add to dashboard Cite

Transportation Planning to Accommodate Needs of Wind Energy Projects

Cited by 7 publications

References 7 publications

A fresh look at symmetric traffic assignment and algorithm convergence

A fresh look at symmetric traffic assignment and algorithm convergence

Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation

Off Shore Wind Power: A Promising and Scalable Future Electricity Source

Contact Info

Product

Resources

About