Customer Level Grid Extension Pole Layout Through Least Cost Optimization

Run this computational tool to place the following components of a grid:

• Service Drop Poles
• Service Drop Lines
• Distribution Poles
• Distribution Lines

The algorithm makes the following optimizations:

• Place service drop poles and distribution poles near roads when it is more cost effective to do so.
• Avoid pole obstacles when placing service drop poles and distribution poles.
• Avoid line obstacles when placing service drop lines and distribution lines.

Relevant Industries

• Energy > Grid

Target Applications

• Grid Extension

Pricing Notes

• Pricing is on a per-site basis.
• Please contact billing@crosscompute.com for special rates.

Usage Notes

• Choose a sufficient amount of memory and time to run the algorithm.
• You can influence the algorithm to put more poles near roads by increasing Off Road Cost Multiplier.
• It is a good idea to run the algorithm multiple times because random sampling will generate slightly different results.

Acknowledgments

Thank you to the following groups that made this work possible:

• CrossCompute
• American Public Power Association
• Electric Vine
• Powerhive
• Quadracci Sustainable Engineering Lab

Geography

The algorithm expects an attribute called demand or demand_in_kwh_per_day for each customer or pole.

• Customers must be polygons or points.
• Roads must be lines.
• Pole obstacles must be polygons.
• Line obstacles must be polygons.

Layout

Electricity

Cost

Algorithm