Thang Nguyen

As conventionally understood, corruption relies on a set of universally agreed rules that determine what constitutes the appropriate allocation of organizational resources. This article explores whether rule-based approaches to corruption are applicable where business organizations, such as public private partnerships, and the public fundamentally disagree about what constitutes an appropriate allocation of resources. Drawing on empirical research about PPPs in Vietnam, this article compares how government, business organizations, and the public conceptualize the transfer of public assets into private ownership. It argues that a public interest approach to corruption is needed where PPPs privatize public assets within the law, but against the express wishes of the public.

This paper applies a proposed modified stochastic fractal search algorithm (MSFS) for dealing with all constraints of optimal reactive power dispatch (ORPD) and finding optimal solutions for three different cases including power loss optimization, voltage deviation optimization, and L-index optimization. The proposed MSFS method is newly constructed in the paper by modifying three new solution update mechanisms on standard stochastic fractal search algorithm (SSFS). The first modification is to keep only one formula and abandon one formula in the diffusion process while the second modification and the third modification are used in the first update and the second update. In two updates of SSFS, solutions with low quality are updated with high probability while other solutions with high quality do not get chances to be updated. This manner results in the fact that some promising solutions around the high quality solutions can be missed. In order to tackle this restriction, the second modification of MSFS is to newly update the worst solutions in the first update and the best solutions in the second update. In the third modification, all existing formulas of SSFS in the two updates are abandoned and the same new proposed technique is used for updating such solutions in two updates. Compared to SSFS, the three modifications can bring advantages to MSFS such as using smaller number of produced solutions per iteration, spending shorter execution time, finding better optimal solutions, and owning more stable search ability. Furthermore, the proposed method also sees its effectiveness and robustness over SSFS by testing on IEEE 30-bus system and IEEE 118-bus system with three different single objectives for each system. The proposed method can find less minimum, average, and maximum for all the cases in addition to faster search speed. Besides, the proposed method is also compared to other methods such as PSO-based method group, GA-based method group, DE-based method group, and other recent methods. Result comparisons also indicate that the proposed method can be more efficient than almost all these methods with respect to less minimum and smaller values of control parameters. As a result, evaluation of the performance of the proposed method is that it should be used for seeking solutions of ORPD problem.

This paper presents a novel improved firefly algorithm (IFA) to deal the problem of the optimal operation of thermal generating units (OOTGU) with the purpose of reducing the total electricity generation fuel cost. The proposed IFA is developed based on combining three improvements. The first is to be based on the radius between two solutions, the second is updated step size for each considered solution based on different new equations, and the third is to slightly modify a formula producing new solutions by using normally distributed random numbers and canceling uniform random numbers of conventional firefly algorithm (FA). The effect of each proposed improvement on IFA is investigated by executing five benchmark functions and two different systems. The performance of IFA is investigated on six other study cases consisting of different types of objective function and complex level of constraints. The objective function considers single fuel with quadratic form and nonconvex form, and multifuels with the sum of several quadratic and nonconvex functions while a set of constraints taken into account are power loss, prohibited zone, ramp rate limit, spinning reserve, and all constraints in transmission power networks. The obtained results indicate the proposed improvements in terms of high optimal solution quality, stabilization of search ability, and fast convergence compared with FA. In addition, the comparisons with other methods also lead to a conclusion that the proposed method is a very promising optimization tool for systems with quadratic fuel cost function and with complicated constraints.

Network reconfiguration is one of the most effective methods to reduce line power loss in the distribution system, which causes higher losses than the other parts of the power system. This paper proposes a modified symbiotic organisms search algorithm to solve the NR problem. For the purpose of enhancing the effectiveness of MSOS, the mutualism and parasitism strategies of the original symbiotic organisms search have been modified to create better new solutions. In the mutualism strategy, the so-far best solution is updated immediately as soon as new solutions are created. In the parasitism strategy, the update is only implemented for the first half of control variables, whereas another half still remains unchanged. The comparison results between MSOS and SOS on twenty-five benchmark functions and different scales of test distribution systems with 14, 33, 69, and 119 nodes show that the improvement level of MSOS over SOS is significant with higher success rates and better quality of gained solutions. Similarly, MSOS also reaches better results than other methods in the literature. Consequently, MSOS can be a favorable method for determining the most appropriate configurations for the distribution systems.

In this paper, a proposed modified stochastic fractal search algorithm is applied to find the most appropriate site and size of capacitor banks for distribution systems with 33, 69, and 85 buses. Two single-objective functions are considered to be reduction of power loss and reduction of total cost of energy loss and capacitor investment while satisfying limit of capacitors, limit of conductor, and power balance of the systems. MSFS was developed by performing three new mechanisms including new diffusion mechanism and two new update mechanisms on the conventional stochastic fractal search algorithm. As a result, MSFS can reduce 0.002%, 0.003%, and 0.18% of the total power loss from SFS for the three study systems. As compared to other methods, MSFS can reduce power loss from 0.07% to 3.98% for the first system, from 3.7% to 7.3% for the second system, and from 0.92% to 6.98% for the third system. For the reduction of total cost, the improvement level of the proposed method over SFS and two other methods is more significant. It is 0.03%, 1.22%, and 5.76% for the second system and 2.31%, 0.87%, and 3.77% for the third system. It is emphasized that the proposed method can find the global optimal solutions for all study cases while SFS was still implementing search process nearby or far away from the solutions. Furthermore, MSFS can converge to the best solutions much faster than these compared methods. Consequently, it can be concluded that the proposed method is very effective for finding the best location and size of added capacitors in distribution power systems.