Abstract: Due to the energy savings and environmental protection they provide, plug-in electric vehicles (PEVs) are increasing in number quickly. Rapid development of PEVs brings new opportunities and challenges to the electricity distribution network’s dispatching. A high number of uncoordinated charging PEVs has significant negative impacts on the secure and economic operation of a distributi...

We study a variant of the two-phase method for general bi-objective combinatorial optimization problems. First, we analyze a basic enumerative procedure, often used in literature to solve specific bi-objective combinatorial optimization problems, making it suitable to solve general problems. We show that the procedure generates the exact set E of efficient points by solving exactly 2|E| − 1 sin...

This paper presents a way to obtain parameters of a direct-axis equivalent circuit of a synchronous generator from frequency response data using bi-objective genetic algorithms. The genetic algorithms is capable of finding a global minimum within a given search interval. The sum square error of magnitude and phase of the d-axis equivalent circuit transfer function to formulate a bi-objective op...

This paper presents a comparative study of Ant Colony and Genetic Algorithms for VLSI circuit bi-partitioning. Ant colony optimization is an optimization method based on behaviour of social insects [27] whereas Genetic algorithm is an evolutionary optimization technique based on Darwinian Theory of natural evolution and its concept of survival of the fittest [19]. Both the methods are stochasti...

This paper deals with the utilizing of the Bayesian optimization algorithm (BOA) for the Pareto bi-criteria optimization of the 0/1 knapsack problem. The main attention is focused on the incorporation of the Pareto optimality concept into classical structure of the BOA algorithm. We have modified the standard algorithm BOA for one criterion optimization utilizing the known niching techniques to...

l(bi, b + i , b − i ) = max ( 0, ρ+H(bi, b + i ))−H(bi, b − i )) ) , (1) whereH(·, ·) is the Hamming distance between hash codes, ρ is a margin between the Hamming distances of withincluster code pair {bi, b+i } and between-cluster code pair {bi, bi }. The hinge loss is a convex approximation to the 0-1 ranking error, which measures the network’s violation of the ranking order specified in the ...

We propose a natural cost function for the bi-clustering task, the monochromatic cost. This cost function is suitable for detecting meaningful homogeneous bi-clusters based on categorical valued input matrices. Such tasks arise in many applications, such as the analysis of social networks and in systemsbiology where researchers try to infer functional grouping of biological agents based on thei...

A new formulation of bi-objective optimization for the general capacitor placement and sizing problem is presented. The objectives include energy loss reduction, investment cost minimization, and maximum voltage deviation improvement. The operating and expansion constraints of the system are considered for practical needed. Also, both fixed and switched types of capacitors are included. A parti...

This paper proposes an improved approach to our previous work [11]. [11] uses Stackelberg game to model the interactions between electricity retailer and its customers and genetic algorithms are used to obtain the Stackelberg Equilibrium (SE). In this paper, we propose a bi-level programming model by considering benefits of the electricity retailer (utility company) and its customer. In the upp...