IJE TRANSACTIONS A: Basics Vol. 20, No. 1 (February 2007) 17-26   

downloaded Downloaded: 142   viewed Viewed: 1921

A. Sadegheih*

Department of Industrial Engineering, Faculty of Engineering
Yazd University, P.O. Box 89195-741, Yazd, Iran

*Corresponding Author

( Received: July 31, 2006 – Accepted in Revised Form: January 18, 2007 )

Abstract    In this paper, system planning network is formulated with mixed-integer programming. Two meta-heuristic procedures are considered for this problem. The cost function of this problem consists of the capital investment cost in discrete form, the cost of transmission losses and the power generation costs. The DC load flow equations for the network are embedded in the constraints of the mathematical model to avoid sub-optimal solutions that can arise if the enforcement of such constraints is done in an indirect way. The solution of the model gives the best line additions, and also provides information regarding the optimal generation at each generation point. This method of solution is demonstrated on the expansion of a 5 bus-bar system to 6 bus-bars.


Keywords    System Planning, Simulated Annealing, Genetic Algorithm, Mathematical Programming, Artificial Intelligence, Iterative Improvement Methods, Heuristic Techniques



1. Villasana, R., Garver, L. L. and Salon, S. J., “Transmission network planning using linear programming”, IEEE Trans. on PAS, Vol. PAS-104, No. 2, (Feb. 1985), 349-356.

2. Knight, U. G. W., “The logical design of electrical networks using linear programming methods”, Proc. IEEE, Vol. 107A, No. 33, (1960), 306-319.

3. Garver, L. L., “Transmission network estimation using linear programming”, IEEE Trans. on PAS, Vol. PAS-89, No. 7, (Sep.-Oct. 1970), 1688-1697.

4. Serna, C., Duran, J. and Camargo, A., “A model for expansion planning of transmission systems: A practical application example”, IEEE Trans., Vol. PAS-97, No. 2, (1978), 610-615.

5. Berg, G. and Sharaf, T. A. M., “Reliability constrained transmission capacity assessment”, Electric Power Systems Research, Vol. 15, (1988), 7-13.

6. Kaltenbach, J. C., Peschon, J. and Gehring, E. H., “A mathematical optimization technique for the expansion of electric power transmission system”, IEEE Trans. on PAS, Vol. PAS-89, No. 1, (1970).

7. Farrag, M. A. and El-Metwally, M. M., “New method for transmission planning using mixed-integer programming”, IEEE Proc. C, Gen. Trans. and Distrib., Vol. 135, No. 4, (1988), 319-323.

8. Sharifnia, A. and Ashtiani, H. Z., “Transmission network planning: A method for synthesis of minimum-cost secure networks”, IEEE Trans. on PAS, Vol. PAS-104, No. 8, (1985).

9. Adams, R. N. and Laughton, M. A., “Optimal planning of power networks using mixed-integer programming”, IEEE Proc. C, Gen. Trans. and Distrib., Vol. 121, No. 2, (1974), 139-147.

10. Lee, T. V. and Hick, K. L., “Transmission expansion by branch-bound integer programming with optimal cost-capacity curves”, IEEE Trans. on PAS, Vol. PAS-93, No. 5, (1974).

11. Romero, R. and Monticelli, A., “A zero-one implicit enumeration method for optimizing investments in transmission expansion planning”, IEEE Trans. on PAS, Vol. 9, No. 3, (1994), 1385-1391.

12. Padiyar, K. R. and Shanbhag, R. S., “Comparison of methods for transmission system expansion using network flow and D. C. load flow models”, Electric power and energy systems, Vol. 10, No. 1, (1989), 17-24.

13. El-Metwally, M. M. and Al-Hamouz, Z. M., “Transmission network planning using quadratic programming”, Electric Machines and Power Systems, Vol. 18, No. 2, (1990), 137-148.

14. Youssef, H. K. and Hackam, R., “New transmission planning model”, IEEE Trans. on PAS, Vol. 4, No. 1, (Feb. 1989), 9-17.

15. El-Metwally, M. M. and Harb, A. M., “Transmission planning using admittance approach and quadratic programming”, Electric Machines and Power Systems, Vol. 21, (1993), 69-83.

16. El-Sobki, S. M., El-Metwally, M. M. and Farrag, M. A., “New approach for planning high-voltage transmission networks”, IEEE Proc., Vol. 133, No. 5, (1986), 256-262.

17. Albuyeh, F. and Skiles, J. J., “A transmission network planning method for comparatives studies”, IEEE Trans. on PAS, Vol. PAS-100, No. 4, (1981), 1679-1684.

18. Ekwue, A. O., “Investigations of the transmission system expansion problem”, Electric power and energy systems, Vol. 6, No. 3, (1984), 139-142.

19. Galiana, F. D., McGillis, D. T. and Marin, M. A., “Expert system in transmission planning”, Proc. IEEE, Vol. 80, No. 5, (1992), 712-726.

20. Yoshimoto, K., Yasuda, K. and Yokoyama, R., “Transmission expansion planning using neurocomputing hybridized with genetic algorithm”, Proc. 1995 IEEE Int. Conf. Evolutionary Computation, Perth, Australia, (1995), 126-131.

21. Romero, R., Gallego, R. A. and Monticelli, A., “Transmission system expansion planning by simulated annealing”, Proc. IEEE Power Industry Computer Application Conference (PICA’95), USA, (1995), 278-283.

22. Wen, F. and Chang, C. S., “Transmission network optimal planning using the tabu search method”, Electr. Power Syst. Res., Vol. 42, No. 2, (1997), 153-163.

23. Glover, F., Laguna, M., Taillard, E. and de Werra, D., (Eds.), “Tabu search”, Science Publishers, Basel Switzerland, (1993).

24. Glover, F., “Tabu search-part I”, ORSA J. Comput., Vol. 1, No. 3, (1989), 190-206.

25. Glover, F., “Tabu search-part II”, ORSA J. Comput., Vol. 2, No. 1, (1990), 4-32.

26. Bai, X. and Shahidehpour, S., “Hydro-thermal scheduling by tabu search and decomposition method”, IEEE PWRS, Vol. 11, No. 2, (1996), 968-974.

27. Wen, F. and Chang, C. S., “A tabu search approach to alarm processing in power systems”, IEE Proc. Generation, Transmission and Distribution, Vol. 144, No. 1, (1997), 31-38.

28. Bakirtzis, A., Petridis, V. and Kazarlis, S., “Genetic algorithm solution to the economic dispatch problem” IEEE Proc.-Gener. Trans. Distrib., Vol. 141, No. 4, (July 1994).

29. “Evolver user’s Guide”, Axcelis, Inc. Seattle, WA, USA, (2005).

30. Baker, J. E, “Adaptive selection methods for genetic algorithms”, In J. J. Grefenstette (Ed.), Proceedings of First International Conference on Genetic Algorithms, Erlbaum, (1985).

31. Davis, L., “Handbook of Genetic Algorithms”, Van Nostrand Reinhold, New York, (1991).

32. Goldberg, D. E., “Genetic algorithms in search optimization, and machine learning”, Addison Wesley, NY, (1989).

33. Van Laarhoven, P. J. M. and Aarts, E. H. L., “Simulated annealing: Theory and applications”, Reidel, Dordrecht, Holland, (1987).

34. Tian, P. and Yang, Z., “An improved simulated annealing algorithm with genetic characteristics and traveling salesman problem”, Journal of Information and Optimization Sciences, Vol. 14, No. 3, (1993), 241-255.

35. Sadegheih, A., “Models in the iterative improvement and heuristic methods”, WSEAS Transactions on Advances in Engineering Education, Vol. 3, (April 2006), 256-261.

36. Sadegheih, A. and Drake, P. R., “Network optimization using linear programming and genetic algorithm”, Neural Network World, International Journal on Non-Standard Computing and Artificial Intelligence, Vol. 11, No. 3, (2001), 223-233.

37. Sadegheih, A., “Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance”, Applied Mathematical Modeling, Vol. 30, (Feb. 2006), 147-154.

38. Sadegheih, A., “Design and implementation of network planning system”, 20th International Power System Conf., Nov., Tehran, Iran, (2005), 14-16.

39. Sadegheih, A., “Modeling, simulation and optimization of network planning methods”, Proceeding of the WSEAS Int. Conference on Automatic Control, Modeling and Simulation, Prague, Czech Republic, (March 2006), 12-14.

40. Sadegheih, A., “Sequence optimization and design of allocation using GA and SA”, Applied Mathematics and Computation, Accepted, (2006).


International Journal of Engineering
E-mail: office@ije.ir
Web Site: http://www.ije.ir