A new design framework is introduced for forest structure optimization based on a genetic algorithm landscape encoding and landscape ecology metrics. Landscape ecology is an important interface between the forest management community, which is a traditional user of operations research methods, and the biological conservation community which is relatively new to OR methods and whose goals are in...

As we all know, the random forest algorithm has advantages of high classification intensity and wide application range. Nevertheless, it still a lot room for improvement. This paper introduces basic idea working principle algorithm, so this proposes some improved algorithms on basis current research studies. College students, as most innovative adaptable group, have gradually become development...

in recent years, significant research efforts have been devoted to the optimal planning of power systems. substation expansion planning (sep) as a sub-system of power system planning consists of finding the most economical solution with the optimal location and size of future substations and/or feeders to meet the future demand. the large number of design variables, and combination of discrete ...

in this paper, the problem of layout optimization for x-bracing of steel frames is studied using the ant system (as). a new design method is employed to share the gravity and the lateral loads between the main frame and the bracings according to the requirements of the ibc2006 code. an algorithm is developed which is called optimum steel designer (osd). an optimization method based on an approx...

Most publications on surrogate models have focused either on the prediction quality or on the optimization performance. It is still unclear whether the prediction quality is indeed related to the suitability for optimization. Moreover, most of these studies only employ lowdimensional test cases. There are no results for popular surrogate models, such as kriging, for high-dimensional (n > 10) no...

Meta-heuristic algorithms are applied in optimization problems in a variety of fields, including engineering, economics, and computer science. In this paper, seven population-based meta-heuristic algorithms are employed for size and geometry optimization of truss structures. These algorithms consist of the Artificial Bee Colony algorithm, Cyclical Parthenogenesis Algorithm, Cuckoo Search algori...

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

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. ...