能源效益在最近已日趨重要，傳統電力系統在輸送電力時沒有經過任何的安排，主要是因為缺乏使用者的資訊，像是需要使用時間的長短和預計需要的電力。然而隨著信息與通訊技術的進步，我們能夠得知使用者的資訊並且藉由排程達到更高的能源效益並且降低我們的營運成本。
我們呈現一個新的電力輸送排程問題，並且提出一個MILP的模型來解這個問題。我們的目標是要最小化發電廠的營運成本，同時滿足一些限制，像是發電量和調整發電量的等等的限制，而營運成本則是由燃料成本、開機成本以及關機成本三種所組成。實驗結果顯示，事先得知使用資訊確實能有效的降低營運成本。

Energy-efficiency is getting more important nowadays. Traditional power system delivers electricity without any schedule due to lack of usage information, such as the expected load and duration. However, as ICT technologies advance, we can make use of consumer information to achieve higher energy efficiency and lower operating cost by means of scheduling.
We present a new problem on power delivery scheduling, and propose a mixed-integer linear programming (MILP) model. The objective is to minimize power plaint’s operating cost which is composed of fuel cost, startup cost, and shutdown cost, while satisfying several constraints, e.g., generation limits, ramping constraints. Experimental results demonstrate that having usage information beforehand can lower the operating cost effectively.

[1] Wei Xu, Yuhui Zhou, and Jielin Zhu, “Energy-efficient Distribution in Smart Grid,” International Conference on Sustainable Power Generation and Supply, pp. 1-6, 2009.
[2] Jingjing Lu, Da Xie, and Qian Ai, “Research on Smart Grid in China,” Asia and Pacific Transmission & Distribution Conference & Exposition, pp. 1-4, 2009.
[3] Z. Ouyang and S. M. Shahidehpour, “An intelligent dynamic-programming for unit commitment application,” IEEE Transactions on Power Systems,, vol. 6, no. 3, pp. 1203–1209, 1991.
[4] Miguel Carrion and Jose M. Arroyo, “A Computationally Efficient Mixed-Integer Linear Formulation for the Thermal Unit Commitment Problem,” IEEE Transactions on Power Systems, vol. 21, no. 3, pp. 1371-1378, 2006.
[5] ChuanPing Cheng, ChihWen Liu, and ChunChang Liu, “Unit Commitment by Lagrangian Relaxation and Genetic Algorithms,” IEEE Transactions on Power Systems, vol. 15, no. 2, pp. 707-714, 2000.
[6] W. Ongsakul and N. Petcharaks, “Unit commitment by enhanced adaptive Lagrangian relaxation,” IEEE Transactions on Power Systems, vol. 19, no. 1, pp. 620–628, Feb. 2004.
[7] G. K. Purushothama and L. Jenkins, “Simulated annealing with local search—A hybrid algorithm for unit commitment,” IEEE Transactions on Power Systems, vol. 18, no. 1, pp. 273–278, Feb. 2003.
[8] Xiaohui Yuan, Hao Nie, Anjun Su, Liang Wang, and Yanbin Yuan, “An Improved binary particle swarm optimization for unit commitment problem,” Expert Systems with Application, vol. 36, pp. 8049-8055, 2009.
[9] Narayana Prasad Padhy, “Unit Commitment－A Bibliographical Survey,” IEEE Transactions on Power Systems, vol. 19, no. 2, pp. 1196-1205, 2004.
[10] C.-T. Hwang, J.-H. Lee, and Y.-C. Hsu, “A formal approach to the scheduling problem in high-level synthesis,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 10, No. 4, pp. 464-475, 1991.
[11] ILOG CPLEX User’s Guideline: http://class.ece.iastate.edu/ee458/CplexLargeUsersManual.pdf
[12] S. Massoud Amin and B.F. Wollenberg, “Toward a Smart Grid: power delivery for the 21st century,” IEEE Power and Energy Magazine, vol. 3, no. 5, pp. 34-41, 2005.
[13] Richard E. Brown, " Impact of Smart Grid on distribution system design," IEEE Power and Energy Society General Meeting - Conversion and Delivery of Electrical Energy in the 21st Century, pp. 1-4, 2008.
[14] A. J. Wood and B. F. Wollenberg, “Power Generation, Operation, and Control,” 2nd ed. New York: John Wiley & Sons, 1996.