In an electricity market, every generation company (GENCO) attempts to maximize profit according to other participants bidding behaviors and power systems operating conditions. The goal of this study is to examine the optimal bidding strategy problem for GENCOs in energy and spinning reserve markets based on a hybrid GA-heuristic optimization algorithm. The heuristic optimization algorithm used...

In this paper, optimization of the backstepping controller parameters in a grid-connected single-phase inverter is studied using Imperialist competitive algorithm (ICA), Genetic Algorithm (GA) and Particle swarm optimization (PSO) algorithm. The controller is developed for the system based on state-space averaged model. By selection of a suitable Lyapunov function, stability of the proposed con...

this paper studies the hybrid flow shop scheduling where the optimization criterion is the minimization of total tardiness. first, the problem is formulated as a mixed integer linear programming model. then, to solve large problem sizes, an artificial immune algorithm hybridized with a simple local search in form of simulated annealing is proposed. two experiments are carried out to evaluate th...

America's experience with farmland preservation is a combination of modest success and inconsistent farm policies. The successes--in terms of farmland acres preserved--have been concentrated in a relatively small number of counties, mainly in the Northeast and in California (see Sokolow and Zurbrugg, 2003). But nationwide there is a split between the farm income-oriented policies of the US fede...

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

This study is devoted to discrete sizing optimization of truss structures employing an efficient discrete evolutionary meta-heuristic algorithm which uses the Newton gradient-based method as its updating scheme and it is named here as Newton Meta-heuristic Algorithm (NMA). In order to enable the NMA population-based meta-heuristic to effectively explore the discrete design space, a term contain...

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

This paper points out that the irrational calculation of the social security price of farmland leads to the relatively low price of the land requisition price. This paper begins with the analysis of the social security function of farmland to farmers and puts forward the idea that the social security value of farmland should include the following four aspects, namely, the value of the endowment...