Lighting Group Circuit Planner
Allocate indivisible lighting groups to proposed circuits using actual input VA and continuous-load weighting; show a feasible plan or oversized groups.
Use this result well
- Inputs that matter
- Fixture and circuit design basis, Circuit voltage (V), Proposed circuit rating (A), Indivisible fixture groups, and 1 more
- Output to expect
- Lighting group circuit allocation
- Check the units and required inputs before comparing results.
- Keep the assumptions with a copied result so you can reproduce the calculation later.
Related Tools
Tools you might need next
Compare copper and aluminum chart sizes using required ampacity, correction factors, terminal ratings and protection limits; save the full basis.
Compare mixed insulated conductors or cables with full raceway internal areas; apply the ordinary count-based fill limit once and screen candidates.
Plan a centered grid from luminaire spacing criteria and height above the work plane; get fixture counts, pitch, offsets and actual coordinates.
Reference & details
How it works
Updated September 2026
How it works
Updated September 2026Lighting group circuit allocation
Allocate indivisible lighting groups to identical proposed circuits using actual fixture input VA and the ordinary 125% continuous-load allowance. Each row stays on one circuit. The deterministic first-fit-decreasing arrangement is a feasible arithmetic plan when all groups fit; it is not guaranteed to use the fewest circuits.
Group weighted VA = quantity × fixture VA × (1.25 if continuous, otherwise 1); circuit weighted VA capacity = voltage × breaker A.Updated: September 2026
Example Scenarios
Try the built-in example, then replace its source data with your actual documented values. Retain failed comparisons and unresolved decisions.
→ 1 circuits in a feasible group allocation
FAQ
About Lighting Group Circuit Planner
Allocate indivisible lighting groups to identical proposed circuits using actual fixture input VA and the ordinary 125% continuous-load allowance. Each row stays on one circuit. The deterministic first-fit-decreasing arrangement is a feasible arithmetic plan when all groups fit; it is not guaranteed to use the fewest circuits.