Optimization Theory, Methods, and Applications in Engineering 2013
View this Special IssueResearch Article  Open Access
Xunlin Jiang, Haifeng Ling, Jun Yan, Bo Li, Zhao Li, "Forecasting Electrical Energy Consumption of Equipment Maintenance Using Neural Network and Particle Swarm Optimization", Mathematical Problems in Engineering, vol. 2013, Article ID 194730, 8 pages, 2013. https://doi.org/10.1155/2013/194730
Forecasting Electrical Energy Consumption of Equipment Maintenance Using Neural Network and Particle Swarm Optimization
Abstract
Accurate forecasting of electrical energy consumption of equipment maintenance plays an important role in maintenance decision making and helps greatly in sustainable energy use. The paper presents an approach for forecasting electrical energy consumption of equipment maintenance based on artificial neural network (ANN) and particle swarm optimization (PSO). A multilayer forward ANN is used for modeling relationships between the input variables and the expected electrical energy consumption, and a new adaptive PSO algorithm is proposed for optimizing the parameters of the ANN. Experimental results demonstrate that our approach provides much better accuracies than some other competitive methods on the test data.
1. Introduction
Equipment maintenance plays a key role in resuming and keeping regular operational capabilities of military equipment [1]. Today’s military equipment becomes more and more complicated and technology intensive, which has brought a heavy burden to equipment maintenance. As a result, the demand of electrical energy is increasing rapidly, and the trend is likely to continue in the future. On the one hand, the proportion of energy cost in the total maintenance cost increases rapidly, which was about 26% during 2006~2008 and 30% in 2009 and 2010, according to our historical data. Thus, an accurate forecasting of electrical energy consumption is very important for decision making in maintenance planning and implementation. On the other hand, the total electrical energy demand in China also has increasesd dramatically in recent years, which has caused many areas and industries to suffer (typically seasonal) electricity shortage [2–4]. In such cases, if we fail to anticipate the electrical energy consumption of maintenance adequately, prearranged maintenance plans will be interrupted or even abandoned, and a lot of important equipment cannot perform expected operations, which may cause significant economic losses or even catastrophic results. For example, in 2008 there are about 28% engineering machineries waiting for repair had their maintenance programs canceled due to unanticipated electricity shortage. In consequence, in some important disaster rescue operations in China in 2009 (such as the Ms6.0 Chuxiong Earthquake and the Ms6.4 Haixi earthquake), the rescue forces had to request a number of dozers, diggers, loaders, and other machineries from other areas, which reduced rescue efficiency.
There are a number of methods and models for forecasting electric energy consumption [5]. Conventional forecasting approaches, such as principal component analysis, least error square (LES), and regression techniques [5–8], become difficult and impractical to provide an adequate forecasting of electrical energy consumption, mainly due to the ever increasing complexity and diversity of equipment maintenance demands. Moreover, those approaches have some inherent limitation and disadvantages such as requirement for large training datasets, sensitivity to noise, and low capability of handling missing data. In recent years, methods and models based on artificial intelligence (AI), including artificial neural networks (ANNs) [9], fuzzy logic and expert systems [10], have received much interest and gained popularity in forecasting electric energy consumption.
Inspired by biological nervous systems, an ANN consists of an interconnection of a number of neurons. It uses processing elements connected by links of variable weights to form a black box representation of systems [11]. One of the most widely used ANNs is the multilayer feedforward neural network, which consists of an input layer, one or more hidden layers, and an output layer. Figure 1 presents an example of such a threelayer neural network.
One of the most useful and popular applications of ANNs is forecasting, the process of which can be divided into two steps: a learning step for constructing the network model based on training data and a forecasting step for predicting targets values for real data. The learning step is performed by iteratively processing a dataset of training tuples, comparing the network's output value for each tuple with the actual known target value, according to which adjusting the weights of the network so as to minimize the meansquared error between the network's output value and the actual target value.
The most wellknown neural network learning algorithm is backpropagation (BP) [12], which calculates the gradient of the error with respect to the weights for a given input by propagating error backwards through the network. However, BP involves long training times and its performance degrades rapidly when the problem complexity increases [13]. In the recent two decades, many intelligent heuristic algorithms, such as genetic algorithms (GAs) and particle swarm optimization (PSO) algorithms, have been applied to the problem of training different kinds of ANNs [14, 15], including the multilayer feedforward neural network, and have demonstrated their efficiency and effectiveness in training ANNs for improving their forecasting accuracies [16, 17].
In this paper, we propose an approach of forecasting electrical energy consumption of equipment maintenance using ANN and PSO. We use a feedforward neural network for modeling possible relationships between the input variables and the expected electrical energy consumption and develop a new adaptive PSO for training the network. Experimental results show that our approach is superior to some stateoftheart methods.
The rest of the review paper is synthesized as follows: Section 2 reviews the related work of the application of ANNs in electrical energy consumption forecasting and the related problems, Section 3 presents our approach in detail, Section 4 presents the computational experiments and the realworld applications, and Section 5 concludes.
2. Related Work
ANNs have gained much popularity in forecasting electric loads and energy demands since 1990s. Kawashima [18] developed an ANN model for building energy prediction, which is trained by the BP algorithm. To improve performance, the algorithm is combined with a threephase annealing method which gradually reduces the learning rate in order to improve accuracy in a relatively short time. In [19] Islam et al. proposed an ANNbased weatherload and weatherenergy models, where a set of weather and other variables are identified for both models together with their correlations and contribution to the forecasted variables. The models were applied to the historical energy, load, and weather data available for the Muscat power system from 1986 to 1990, and the forecast results for 19911992 showed that monthly electric energy and load can be predicted within a maximum error of 6% and 10%. In [20] AlShehri employed aANN for forecasting the residential electrical energy in the Eastern Province of Saudi Arabia, and the forecasting result was shown to be closer to the real data than that predicted by the polynomial fit model.
Hatziargyriou and Dialynas [21] proposed an adaptive ANN for midterm energy forecasting. Their model transforms the input variables to differences or relative differences, in order to predict energy values not included in the training set. The ANN parameters, such as the finally used input variables, the number of neurons, initial values, and time periods of momentum term and training rate, are simultaneously selected by an optimization process. Sözen et al. [22] also forecasted net energy consumption in Turkey based on an ANN approach, which employs a logistic sigmoid transfer function. They showed that the statistical coefficients of multiple determinations in the experiments are equal to 0.9999 and 1 for training and test data, respectively. In [23] Ermis et al. presented an ANN model which is trained based on world energy consumption data from 1965 to 2004 and applied for forecasting world green energy consumption to the year 2050. It is estimated that world green energy and natural gas consumption will continue increasing after 2050, while world oil and coal consumption are expected to remain relatively stable after 2025 and 2045, respectively.
The work of Azadeh et al. [24] presented an integrated algorithm for forecasting monthly electrical energy consumption based on ANN, computer simulation, and design of experiments using stochastic procedures. The integrated algorithm was applied for forecasting monthly electrical energy consumption in Iran from 1994 to 2005, the result of which demonstrated the effectiveness of the algorithm. Yokoyama et al. [25] proposed a global optimization method called “Modal Trimming Method” for determining ANN parameters, where the trend and periodic change are first removed from time series data on energy demand, and the converted data is used as the main input to a neural network. Their approach was validated by the application to predict the cooling demand in a building used for a benchmark test. Geem and Roper [26] proposed an ANN model with feedforward multilayer perceptron, error backpropagation algorithm, momentum process, and scaled data and applied the model to estimate the energy demand for the Republic of Korea. Nevertheless, to our best knowledge, research on the application of ANN models together with intelligent training algorithms to the field of energy consumption forecasting is still rare.
3. The Proposed Method
3.1. Network Structure
Our method adopts a threelayer forward neural network, since an ANN can solve a problem by using one hidden layer, provided it has the proper number of neurons [27]. From the original database of equipment maintenance, the input variables are preliminary selected by a team of experts in the domains of equipment maintenance and electrical power, and a dataset of twentythree fields is filtered out. In general, the input variables can be divided into two categories. The first category is related to the equipment to be repaired. The equipment is classified as heavy equipment, medium equipment, and light equipment. The maintenance levels include major maintenance, medium maintenance, and minor maintenance. Thus we identify nine variables N_{1,1}~N_{3,3}, where the first index denotes the equipment class (1heavy, 2medium, 3light) and the second denotes the maintenance level (1major, 2medium, 3minor). The first category also contains two variables related to rated power and three variables related to maintenance time of all equipment. The second category consists of nine variables related to maintenance resources and environments. Table 1 lists the input variables of our ANN for electrical energy consumption forecasting.

Preliminary normalization by the maximum and minimum values of each variable is executed based on the following equation: where and are the upper and lower values of the original variable, respectively, and and are the corresponding values of the normalized variable.
Given a unit in a hidden or output layer, the net input to unit , denoted by , is defined as where is the weight of the connection from unit in the previous layer to unit , is output of unit , and is acting as a threshold bias of the unit .
And we employ the widely used sigmoid transfer function to compute the output of unit from its net input:
3.2. PSO and Control Parameters
PSO is a stochastic, populationbased optimization technique that enables a number of individual solutions, called particles, to move through a hyperdimensional search space to search for the optimum or optima. Each particle has a position vector x and a velocity vector v, which are adjusted at iterations by learning from a personal best solution found by the particle itself and a global best solution gbest found by the whole swarm so far at each dimension : where is the inertia weight for controlling the velocity, and are the acceleration coefficients reflecting the weighting of “cognitive” and “social” learning, respectively, and and are two random numbers ranging from 0 to 1. Empirical studies have shown that PSO has a high efficiency in convergence to desirable optima and performs better than GAs in many problems [28–34].
Most PSO algorithms use a linear decreasing inertia weight and constant acceleration coefficients in (5). In recent years, some work has been conducted on the nonlinear and nonmonotonous change of control parameters, which has shown the ability of increasing the adaptivity and diversity of the swarm. In the work of Yang et al. [35], the inertia weight is adapted based on two characteristic parameters in the search course of PSO, namely, speed factor and aggregation degree factor. Arumugam and Rao [36] used the ratio of the global best fitness and the average of particles’ personal best fitness to determine the inertia weight in each iteration. Panigrahi et al. [37] proposed another PSO method where different particles are assigned with different inertia weights based on the ranks of the particles. In [38] Nickabadi et al. proposed a new adaptive inertia weight approach that uses the success rate of the swarm as its feedback parameter to ascertain the particles’ situation in the search space.
Zhan et al. [30] proposed an adaptive PSO that differentiates the evolutionary states as exploration, exploitation, convergence, and jumping out by evaluating the population distribution and particle fitness and uses the state information to automatically control inertia weight and acceleration coefficients at run time. Ratnaweera et al. [39] introduced a timevarying acceleration coefficient strategy where the cognitive coefficient is linearly decreased and the social coefficient is linearly increased. In [40] Zheng et al. introduced a new adaptive parameter strategy to the comprehensive learning particle swarm optimizer, which uses evolutionary information of individual particles to dynamically adapt the inertia weight and acceleration coefficient at each iteration.
3.3. An Adaptive PSO Algorithm for Evolving the ANN
Since the search process of PSO is highly complicated in the ANN training problems, here we use a selfadaptive mechanism for both the inertia weight and the acceleration coefficients. The mechanism is based on the concept of the success of a particle at an iteration, that is, whether or not a particle improves its personal best at iteration :
Based on that we compute the rate of success of the whole swarm :
That is, is the percentage of the particles which have had an improvement in the last iteration. A high value of indicates a high probability that the particles have converged to a nonoptimum point or slowly moving toward the optimum, while a low value of indicates that the particles are oscillating around the optimum without much improvement [38]. And we use the following equation for dynamically changing inertia weight of PSO:
PSO is a populationbased optimization method, which is preferred to encourage the exploration during the early stages and to enhance exploitation during the latter stages. Here we also employ a mechanism that linearly decreases the cognitive coefficient and increases the social coefficient as follows:
The dataset of our forecasting problem is partitioned into three sets: a training set, a validation set, and a testing set.
Our adaptive PSO contains a main procedure for evolving a swarm of ANNs with different structure (different number of the hidden nodes and the connection density), which is outlined in Algorithm 1, and a subprocedure for evolving a swarm of ANNs with the same structure but different connection weights, which is outlined in Algorithm 2. For each particle that represents an ANN, its fitness is defined as the root meansquared error (RMSE) of the training dataset, which is calculated as follows: where is the network output of the th training tuple and is its desired output. The fitness of particles in the mainswarm is evaluated as the best ANN obtained by its subswarms.


The flowchart of the algorithm is shown in Figure 2.
4. Computational Experiment
The proposed method was applied to the actual historical data collected from seven equipment maintenance organizations from 1999 to 2011. We used the data from 1999 to 2006 and the data of 2008 as the training dataset, the data of 2007 and 2010 as the validation dataset, and the data of 2009 and 2011 as the testing dataset. Table 2 presents a summarization of the datasets.

We, respectively, implement three other approaches: the ANN trained by BP (denoted by ANN), the ANN trained by basic PSO (denoted by ANNPSO), and the nonlinear regression model optimized by PSO (denoted by RPSO) [41], in order to comparatively evaluate the performance of our method (denoted by ANNAPSO).
The experiments are conducted on a computer with Intel i5 3450 multicore processor and DDR3 8 GB memory. The basic parameters of our approach are set as , , , , , and . The maximum running time of the other approaches is set as they consume nearly the same CPU time as our method.
Tables 3 and 4, respectively, present the experimental results of the four approaches on the testing datasets of 2009 and 2011. As we can see from the results, on every test data tuple, our ANN trained by adaptive PSO achieves the minimum mean absolute percentage error (MAPE) among the four approaches. On the testing dataset of 2009, nearly all of the MAPEs of ANNAPSO are less than one percent. Roughly speaking, the testing dataset of 2011 is much more difficult than that of 2009, and thus the MAPEs of the other three approaches generally increase to a certain extent (except for the ANNPSO on organization #4), but the MAPEs of ANNAPSO decrease on organizations #1 and #6, remain zero on #7, and increase very slightly on the other four cases. Statistical tests also show the following.(i)On the dataset of 2009, our ANNAPSO has significant performance improvement over ANN in all cases and over ANNPSO and RPSO in most cases.(ii)On the dataset of 2011, the ANNAPSO always has significant performance improvement over the other three methods.
 
In column 2–4, ^{+}means that the result of ANNAPSO has statistically significant improvement over that of the comparative algorithm (using paired onetailed test at a 0.05 level of significance). 
 
In column 2–4, ^{+}means that the result of ANNAPSO has statistically significant improvement over that of the comparative algorithm (using paired onetailed test at a 0.05 level of significance). 
In summary, ANNAPSO provides the best forecasting accuracy on the testing datasets, and it is much more reliable and robust than the other three approaches.
5. Conclusion
The paper presents an approach for forecasting electrical energy consumption of equipment maintenance based on ANN trained by PSO. The ANN model is used for modeling possible relationships between the input variables and the expected electrical energy consumption, and a new PSO algorithm with adaptive control parameters is developed for evolving the ANN. Experimental results demonstrate that our approach performs better than some stateoftheart methods on the historical data of equipment maintenance in China. And we believe that the proposed method can be applied to a wider range of forecasting problems in engineering.
In practice, we find that it is often difficult to get exact values of a certain number of input variables, and currently we just use their expected or estimated values. To further improve the adaptivity and flexibility of our approach, we are testing the use of fuzzy numbers and fuzzyneural networks [42–46] in forecasting and adapting our ANNAPSO algorithm for training and evolving the fuzzyneural networks. Our future work also includes improving the algorithm by information sharing between different subswarms.
Acknowledgments
This work was supported by the Natural Science Foundation of China under Grant nos. 61020106009 and 61105073. The authors are grateful to the reviewers’ valuable comments that help to improve the paper greatly.
References
 Z. Q. Zhang, J. P. Wang, X. Y. Duan et al., Introduction To Equipment Technical Support, Military Science Press, Beijing, China, 2001.
 P. Crompton and Y. Wu, “Energy consumption in China: past trends and future directions,” Energy Economics, vol. 27, no. 1, pp. 195–208, 2005. View at: Publisher Site  Google Scholar
 D. Niu and M. Meng, “Research on seasonal increasing electric energy demand forecasting: a case in China,” Chinese Journal of Management Science, vol. 18, no. 2, pp. 108–112, 2010. View at: Google Scholar
 N. Wada, O. Saito, Y. Yamamoto, T. Morioka, and A. Tokai, “Evaluating effects on the flow of electrical and electronic equipment and energy consumption due to alternative consumption patterns in China,” Journal of Risk Research, vol. 15, no. 1, pp. 107–130, 2012. View at: Publisher Site  Google Scholar
 H. K. AlFares and M. Nazeeruddin, “Lectric load forecasting: literature survey and classification of methods,” International Journal of Systems Science, vol. 33, no. 1, pp. 23–24, 2002. View at: Publisher Site  Google Scholar
 G. A. N. Mbamalu and M. E. ElHawary, “Load forecasting via suboptimal seasonal autoregressive models and iteratively reweighted least squares estimation,” IEEE Transactions on Power Systems, vol. 8, no. 1, pp. 343–348, 1993. View at: Publisher Site  Google Scholar
 T. Haida and S. Muto, “Regression based peak load forecasting using a transformation technique,” IEEE Transactions on Power Systems, vol. 9, no. 4, pp. 1788–1794, 1994. View at: Publisher Site  Google Scholar
 A. AlShehri, “A simple forecasting model for industrial electric energy consumption,” International Journal of Energy Research, vol. 24, no. 8, pp. 719–726, 2000. View at: Publisher Site  Google Scholar
 H. S. Hippert, C. E. Pedreira, and R. C. Souza, “Neural networks for shortterm load forecasting: a review and evaluation,” IEEE Transactions on Power Systems, vol. 16, no. 1, pp. 44–55, 2001. View at: Publisher Site  Google Scholar
 K.H. Kim, J.K. Park, K.J. Hwang, and S.H. Kim, “Implementation of hybrid shortterm load forecasting system using artificial neural networks and fuzzy expert systems,” IEEE Transactions on Power Systems, vol. 10, no. 3, pp. 1534–1539, 1995. View at: Publisher Site  Google Scholar
 K. Chau, “A review on the integration of artificial intelligence into coastal modeling,” Journal of Environmental Management, vol. 80, no. 1, pp. 47–57, 2006. View at: Publisher Site  Google Scholar
 D. E. Rumelhart, G. E. Hinton, and R. J. Williams, “Learning representations by backpropagating errors,” Nature, vol. 323, no. 6088, pp. 533–536, 1986. View at: Publisher Site  Google Scholar
 S. Chen and Z. Wang, “Acceleration strategies in generalized belief propagation,” IEEE Transactions on Industrial Informatics, vol. 8, no. 1, pp. 41–48, 2012. View at: Publisher Site  Google Scholar
 G. F. Miller, P. M. Todd, and S. U. Hegde, “Designing neural networks using genetic algorithms,” in Proceedings of the 3rd International Conference on Genetic Algorithms, J. David Schaffer, Ed., pp. 379–384, Morgan Kaufmann Publishers, San Francisco, Calif, USA, 1989. View at: Publisher Site  Google Scholar
 C. Zhang, H. Shao, and Y. Li, “Particle swarm optimization for evolving artificial neural network,” in Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, vol. 4, pp. 2487–2490, October 2000. View at: Google Scholar
 J. D. Schaffer, D. Whitley, and L. J. Eshelman, “Combinations of genetic algorithms and neural networks: a survey of the state of the art,” in Proceedings of the International Workshop on Combinations of Genetic Algorithms and Neural Networks (COGANN '92), pp. 1–37, 1992. View at: Publisher Site  Google Scholar
 M. Settles, B. Rodebaugh, and T. Soule, “Comparison of genetic algorithm and particle swarm optimizer when evolving a recurrent neural network,” in Genetic and Evolutionary Computation, E. CantúPaz, J. A. Foster, K. Deb et al., Eds., vol. 2723 of Lecture Notes in Computer Science, pp. 148–149, Springer, New York, NY, USA, 2003. View at: Google Scholar
 M. Kawashima, “Artificial neural network backpropagation model with threephase annealing developed for the building energy predictor shootout,” ASHRAE Transactions, vol. 100, no. 2, pp. 1096–1103, 1994. View at: Google Scholar
 S. M. Islam, S. M. AlAlawi, and K. A. Ellithy, “Forecasting monthly electric load and energy for a fast growing utility using an artificial neural network,” Electric Power Systems Research, vol. 34, no. 1, pp. 1–9, 1995. View at: Publisher Site  Google Scholar
 A. AlShehri, “Artificial neural network for forecasting residential electrical energy,” International Journal of Energy Research, vol. 23, no. 8, pp. 649–661, 1999. View at: Publisher Site  Google Scholar
 N. D. Hatziargyriou and E. N. Dialynas, “An optimized adaptive neural network for annual midterm energy forecasting,” IEEE Transactions on Power Systems, vol. 21, no. 1, pp. 385–391, 2006. View at: Google Scholar
 A. Sözen, M. A. Akçayol, and E. Arcaklioğlu, “Forecasting net energy consumption using artificial neural network,” Energy Sources B, vol. 1, no. 2, pp. 147–155, 2006. View at: Publisher Site  Google Scholar
 K. Ermis, A. Midilli, I. Dincer, and M. A. Rosen, “Artificial neural network analysis of world green energy use,” Energy Policy, vol. 35, no. 3, pp. 1731–1743, 2007. View at: Publisher Site  Google Scholar
 A. Azadeh, S. F. Ghaderi, and S. Sohrabkhani, “A simulatedbased neural network algorithm for forecasting electrical energy consumption in Iran,” Energy Policy, vol. 36, no. 7, pp. 2637–2644, 2008. View at: Publisher Site  Google Scholar
 R. Yokoyama, T. Wakui, and R. Satake, “Prediction of energy demands using neural network with model identification by global optimization,” Energy Conversion and Management, vol. 50, no. 2, pp. 319–327, 2009. View at: Publisher Site  Google Scholar
 Z. W. Geem and W. E. Roper, “Energy demand estimation of South Korea using artificial neural network,” Energy Policy, vol. 37, no. 10, pp. 4049–4054, 2009. View at: Publisher Site  Google Scholar
 S. Haykin, Neural Networks: A Comprehensive Foundation, PrenticeHall, Englewood Cliffs, NJ, USA, 1994.
 J. Kennedy, “Bare bones particle swarms,” in Proceedings of the IEEE Swarm Intelligence Symposium, pp. 80–87, 2003. View at: Google Scholar
 N. M. Kwok, D. K. Liu, K. C. Tan, and Q. P. Ha, “An empirical study on the settings of control coefficients in particle swarm optimization,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '06), pp. 3165–3172, Vancouver, Canada, July 2006. View at: Google Scholar
 Z. H. Zhan, J. Zhang, Y. Li, and H. S. H. Chung, “Adaptive particle swarm optimization,” IEEE Transactions on Systems, Man, and Cybernetics B, vol. 39, no. 6, pp. 1362–1381, 2009. View at: Publisher Site  Google Scholar
 Y. J. Zheng, Q. Song, and S. Y. Chen, “Multiobjective fireworks optimization for variablerate fertilization in oil crop production,” Applied Soft Computing, vol. 13, no. 11, pp. 4253–4263, 2013. View at: Publisher Site  Google Scholar
 P. Lu, S. Chen, and Y. Zheng, “Artificial intelligence in civil engineering,” Mathematical Problems in Engineering, vol. 2012, Article ID 145974, 22 pages, 2012. View at: Publisher Site  Google Scholar
 Y. J. Zheng, S. Y. Chen, Y. Lin, and W. L. Wang, “Bioinspired optimization of sustainable energy systems: a review,” Mathematical Problems in Engineering, vol. 2013, Article ID 354523, 12 pages, 2013. View at: Publisher Site  Google Scholar
 Y. J. Zheng and S. Y. Chen, “Cooperative particle swarm optimization for multiobjective transportation planning,” Applied Intelligence, vol. 39, no. 1, pp. 202–216, 2013. View at: Publisher Site  Google Scholar
 X. Yang, J. Yuan, and H. Mao, “A modified particle swarm optimizer with dynamic adaptation,” Applied Mathematics and Computation, vol. 189, no. 2, pp. 1205–1213, 2007. View at: Publisher Site  Google Scholar  Zentralblatt MATH
 M. S. Arumugam and M. V. C. Rao, “On the improved performances of the particle swarm optimization algorithms with adaptive parameters, crossover operators and root mean square (RMS) variants for computing optimal control of a class of hybrid systems,” Applied Soft Computing Journal, vol. 8, no. 1, pp. 324–336, 2008. View at: Publisher Site  Google Scholar
 B. K. Panigrahi, V. R. Pandi, and S. Das, “Adaptive particle swarm optimization approach for static and dynamic economic load dispatch,” Energy Conversion and Management, vol. 49, no. 6, pp. 1407–1415, 2008. View at: Publisher Site  Google Scholar
 A. Nickabadi, M. M. Ebadzadeh, and R. Safabakhsh, “A novel particle swarm optimization algorithm with adaptive inertia weight,” Applied Soft Computing Journal, vol. 11, no. 4, pp. 3658–3670, 2011. View at: Publisher Site  Google Scholar
 A. Ratnaweera, S. K. Halgamuge, and H. C. Watson, “Selforganizing hierarchical particle swarm optimizer with timevarying acceleration coefficients,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 3, pp. 240–255, 2004. View at: Publisher Site  Google Scholar
 Y. J. Zheng, H. F. Ling, and Q. Guan, “Adaptive parameters for a modified comprehensive learning particle swarm optimizer,” Mathematical Problems in Engineering, vol. 2012, Article ID 207318, 11 pages, 2012. View at: Publisher Site  Google Scholar
 M. R. AlRashidi and K. M. ELNaggar, “Long term electric load forecasting based on particle swarm optimization,” Applied Energy, vol. 87, no. 1, pp. 320–326, 2010. View at: Publisher Site  Google Scholar
 J. S. R. Jang, “ANFIS: adaptivenetworkbased fuzzy inference system,” IEEE Transactions on Systems, Man and Cybernetics, vol. 23, no. 3, pp. 665–685, 1993. View at: Publisher Site  Google Scholar
 A. R. Solis and G. Panoutsos, “Granular computing neuralfuzzy modelling: a neutrosophic approach,” Applied Soft Computing, vol. 13, no. 9, pp. 4010–4021, 2012. View at: Google Scholar
 K. Wang and Y. J. Zheng, “A new particle swarm optimization algorithm for fuzzy optimization of armored vehicle scheme design,” Applied Intelligence, vol. 37, no. 4, pp. 520–526, 2012. View at: Publisher Site  Google Scholar
 Y. Zheng, H. Shi, and S. Chen, “Fuzzy combinatorial optimization with multiple ranking criteria: a staged tabu search framework,” Pacific Journal of Optimization, vol. 8, no. 3, pp. 457–472, 2012. View at: Google Scholar  Zentralblatt MATH
 Y. J. Zheng and H. F. Ling, “Emergency transportation planning in disaster relief supply chain management: a cooperative fuzzy optimization approach,” Soft Computing, vol. 17, no. 7, pp. 1301–1314, 2013. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2013 Xunlin Jiang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.