Search

Renewable energy presently occupies a prominent position in India's overall energy generation scheme. In the midst of numerous alternative energy resources, solar energy is widely used as it persists in large volumes with varying specification ratings. It is suited for both stand-alone and grid-coupled application. The Maximum Power Tracking (MPPT) scheme has a profound effect on the operating efficiency of a Photovoltaic (PV) power plant. This paper proposes an inventive hybridized Human Psychology Optimization-Perturb and Observation (HPO-PO) MPPT approach for obtaining the optimal duty cycle of the boost converter to harvest global maxima from a grid-connected Total Cost Tied (TCT) configured PV array of 4080 W. The suggested method provides enriched performance both in steady-state, as well as in rapid and randomly changing weather conditions. Comparison studies of various MPPT procedures, including Perturbation and Observation (PO), Artificial Bee Colony (ABC), and Human Psychology Optimization (HPO) in MATLAB environment, illustrate the usefulness of the evoked system in meeting its goals. The suggested MPPT procedure has offered enhanced activities in terms of voltage quality, maximum power tracking capability, and converter efficiency compared to other methods. The recommended hybridized MPPT approach is experimentally validated on a hardware set-up using a 16-bit dsPIC30F2010 Digital Signal Controller in enhancing the behavior of the grid-connected PV system. [ABSTRACT FROM AUTHOR]

In the increasingly competitive logistics industry, much more emphasis has been put on customer satisfaction by firms to distinguish themselves from their competitors. Motivated by the practices, the consistent vehicle routing problem (ConVRP) incorporates service consistency into the vehicle routing problem to improve customer satisfaction. However, the majority of the existing research considers the ConVRP in a deterministic environment while the uncertainties are not fully studied. Therefore, this paper solves the consistent vehicle routing problem under uncertain environment (UnConVRP) taking into account uncertain customer demands, travel times, and service times. Over a multi-day planning horizon, customers may have multi-day or single-day service requirements. The same driver is assigned to each customer almost at the same time each day when customers require service. The objective is to design the routes for vehicles over the planning horizon under uncertain environment while maintaining service consistency. Two uncertain programming models are established based on different decision criteria and the crisp equivalents are proposed using uncertainty theory. An efficient template-based solution framework is designed to solve the models where the artificial bee colony algorithm is embedded. Initially, the template route is constructed to guarantee the service consistency of frequent customers. Then the final daily routes can be derived from the template route. Finally, numerical experiments are performed to show the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

The Improved Artificial Bee Colony (IABC) algorithm is a variant of the well-known Artificial Bee Colony (ABC) algorithm. In IABC, a new initialization approach and a new search mechanism were added to the ABC for avoiding local optimums and a better convergence speed. New parameters were added for the new search mechanism. Specified values of these newly added parameters have a direct impact on the performance of the IABC algorithm. For better performance of the algorithm, parameter values should be subjected to change from problem to problem and also need to be updated during the run of the algorithm. In this paper, two novel parameter control methods and related algorithms have been developed in order to increase the performance of the IABC algorithm for large scale optimization problems. One of them is an adaptive parameter control which updates parameter values according to the feedback coming from the search process during the run of the algorithm. In the second method, the management of the parameter values is left to the algorithm itself, which is called self-adaptive parameter control. The adaptive IABC algorithms were examined and compared to other ABC variants and state-of-the-art algorithms on a benchmark functions suite. Through the analysis of the results of the experiments, the adaptive IABC algorithms outperformed almost all ABC variants and gave competitive results with state-of-the-art algorithms from the literature. [ABSTRACT FROM AUTHOR]