Abstract
This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed to reduce the domain of the integer variables of the transportation model of the transmission expansion planning (TM-TEP) problem. This problem is a MILP and very difficult to solve specially for large scale systems. The branch and bound (BB) algorithm is used to solve the problem in both full and the reduced search space. The proposed method might be useful to reduce the search space of those kinds of MILP problems that a fast heuristic algorithm is available for finding local optimal solutions. The obtained results using some real test systems show the efficiency of the proposed method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Escobar, A.H., Gallego, R.A., Romero, R.: Multistage and coordinated planning of the expansion of transmission systems. IEEE Trans. Power Syst. 19(2), 735–744 (2004)
Verma, A., Panigrahi, B.K., Bijwe, P.R.: Harmony search algorithm for transmission network expansion planning. Generation, Transmission & Distribution, IET 4(6), 663–673 (2010)
Binato, S., Pereira, M.V.F., Granville, S.: A new Benders decomposition approach to solve power transmission network design problems. IEEE Transactions on Power Systems 16(2), 235–240 (2001)
Rider, M.J., Garcia, A.V., Romero, R.: Transmission system expansion planning by a branch-and-bound algorithm. Generation, Transmission & Distribution, IET 2(1), 90–99 (2008)
Romero, R., Asada, E.N., Carreno, E., Rocha, C.: Constructive heuristic algorithm in branch-and-bound structure applied to transmission network expansion planning. Generation, Transmission & Distribution, IET 1(2), 318–323 (2007)
Rahmani, M., Rshidienjad, M., Carreno, E.M., Romero, R.: Efficient method for AC transmission network expansion planning. Electric Power Systems Research 80(9), 1056–1064 (2010)
Faria Jr., H., Binato, S., Resende, M.G.C., Falcao, D.M.: Power transmission network design by greedy randomized adaptive path relinking. IEEE Transactions on Power Systems 20(1), 43–49 (2005)
Leite da Silva, A.M., Rezende, L.S., Honório, L.M., Manso, L.A.F.: Performance comparison of metaheuristics to solve the multi-stage transmission expansion planning problem. Generation, Transmission & Distribution, IET 5(3), 360–367 (2011)
Taylor, J.A., Hover, F.S.: Linear Relaxations for Transmission System Planning. IEEE Transactions on Power Systems 26(4), 2533–2538 (2011)
Romero, R., Monticelli, A., Garcia, A., Haffner, S.: Test systems and mathematical models for transmission network expansion planning. IEE Proc., Gener., Transm. Distrib. 149(1), 27–36 (2002)
Chung, T.S., Li, K.K., Chen, G.J., Xie, J.D., Tang, G.Q.: Multiobjective transmission network planning by a hybrid GA approach with fuzzy decision analysis. Int. J. Electr. Power Energy Syst. 25, 187–192 (2003)
Lee, C.W., Ng, S.K.K., Zhong, J., Wu, F.F.: Transmission Expansion Planning From Past to Future. In: Power Systems Conference and Exposition, PSCE 2006, pp. 257–265. IEEE PES (2006)
Latorre, G., Cruz, R.D., Areiza, J.M., Villegas, A.: Classification of publications and models on transmission expansion planning. IEEE Transactions on Power Systems 18(2), 938–946 (2003)
Festa, P., Resende, M.G.C.: Hybridizations of GRASP with path-relinking. AT&T Labs Research, 1–19 (2011)
Schrijver, A.: Theory of linear and integer programming. John Wiley & Sons, Ltd., West Sussex (1996)
Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8, 67–71 (1989)
Garver, L.L.: Transmission network estimation using linear programming. IEEE Trans. Power Appl. Syst. 89(7), 1688–1697 (1970)
Pereira, M.V.F., Pinto, L.M.V.G.: Application Of Sensitivity Analysis Of Load Supplying Capability To Interactive Transmission Expansion Planning. IEEE Transactions on Power Apparatus and Systems 104(2), 381–389 (1985)
Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 219–249. Kluwer Academic Publishers (2003)
Rahmani, M., Rashidinejad, M., Carreno, E.M., Romero, R.A.: Evolutionary multi-move path-relinking for transmission network expansion planning. In: 2010 IEEE Power and Energy Society General Meeting, pp. 1–6 (2010)
Romero, R., Rider, M.J., de Silva, I.J.: A Metaheuristic to Solve the Transmission Expansion Planning. IEEE Trans. Power Systems 22(4), 2289–2291 (2007)
Fourer, R.D., Gay, M., Kernighan, B.W.: AMPL: A Modeling Language for Mathematical Programming, 2nd edn. Brooks/Cole-Thomson Learning, Pacific Grove (2003)
CPLEX Optimization Subroutine Library Guide and Reference, Version 12.1.0. CPLEX Division, ILOG, Inc., Incline Village, NV (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rahmani, M., Romero, R.A., Rider, M.J., Paredes, M. (2012). Domain Reduction Using GRASP Construction Phase for Transmission Expansion Planning Problem. In: Hao, JK., Middendorf, M. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2012. Lecture Notes in Computer Science, vol 7245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29124-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-29124-1_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29123-4
Online ISBN: 978-3-642-29124-1
eBook Packages: Computer ScienceComputer Science (R0)