Optimization Online


A Mixed Integer Disjunctive Model for Transmission Network Expansion

Laura Bahiense (laura***at***psr-inc.com)
Gerson C. Oliveira (gco***at***rionet.com.br)
Mario Pereira (mario***at***par-inc.com)
SÚrgio Granville (granville***at***psr-inc.com)

Abstract: The classical non-linear mixed integer formulation of the transmission network expansion problem cannot guarantee finding the optimal solution due to its non-convex nature. We propose an alternative mixed integer linear disjunctive formulation, which has better conditioning properties than the standard disjunctive model. The mixed integer program is solved by a commercial Branch and Bound code, where an upper bound provided by a heuristic solution is used to reduce the tree search. The heuristic solution is obtained using a GRASP metaheuristic, capable of finding sub-optimal solutions with an affordable computing effort. Combining the upper bound given by the heuristic and the mixed integer disjunctive model, optimality can be proven for several hard problem instances.

Keywords: Transmission Planning, Combinatorial Optimization, Meta-heuristics

Category 1: Applications -- OR and Management Sciences

Category 2: Integer Programming ((Mixed) Integer Linear Programming )

Category 3: Network Optimization

Citation: IEEE Transactions on Power Systems, vol. 16, No. 3, August 2001.

Download: [PDF]

Entry Submitted: 10/26/2001
Entry Accepted: 10/26/2001
Entry Last Modified: 10/26/2001

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society