Multi-step simultaneous changes Constructive Heuristic Algorithm for Transmission Network Expansion Planning

Randomized discrepancy bounded local search for transmission expansion planning

“…DBLS provides a natural way to incorporate constructive heuristics from the TNEP literature, e.g. [14], [15], into a more general framework and is related to the approach of [9]. The formal model of DBLS for TNEP is presented in Figure 1.…”

“…i ∈ B | c i ∈ X . The first implementation is described in Figure 2 and is based upon the constructive heuristic presented in [14]. It first chooses the variable corresponding to the corridor that is most overloaded (lines 1-3), if one exists.…”

“…The second heuristic is based upon the standard cost reduction stages of constructive heuristics [14], [15] and chooses to explore those variables whose removal of components will decrease the cost the most (lines 1-2 of Figure 3). It is used when η(σ) = ν(σ) = 0.…”

“…Until recently it has been been easy to adapt plans derived from these models to more realistic conditions (see [21], [22]). The approaches tend to fall into three categories, complete search based upon mixed-integer program (MIP) formulations [21], [23], locally optimal search such as constructive heuristics [14], [15], and meta-heuristics [24], [25], [26], [27], [28], [29].…”

“…In previous work [10], we presented a novel approach to address these challenges. This approach, DiscrepancyBounded Local Search (DBLS), embedded ideas from simulation optimization [11], [12], [13] in a local search procedure that generalizes constructive heuristics [14], [15], constraintbased local search [16], [17], and is related to global search techniques such as limited discrepancy search [18], [19], [20]. The key idea of the approach is the encapsulation of the power model within a simulation black box.…”