this paper presents a new meta-heuristic solution to find the efficient frontier using the mean-variance approach. portfolio optimization problem is a quadratic programming model and, changes to np-hard if the number of assets and constraints has increased, and it cannot be solved using common mathematical methods in a reasonable time. therefore, a heuristic or meta-heuristic algorithm should b...

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

Main contribution of this work is improving transient stability by installing Flexible AC Transmission System (FACTS) in power systems. For do this, Unified Power Flow Controller (UPFC) has been selected. Also a novel structure has been suggested to improve classic Harmony Search algorithm and suggested improved Harmony Search (iHS) algorithm. This algorithm has been used to obtain UPFC paramet...

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

ETHNOPHARMACOLOGICAL RELEVANCE The stem bark of Garcinia livingstonei is used traditionally as a skin lightening agent. AIM OF THE STUDY To isolate and identify compounds responsible for the observed skin lightening activity of Garcinia livingstonei and to evaluate their cytotoxicity. MATERIALS AND METHODS Constituents of the stem bark and fruits of Garcinia livingstonei were isolated using...

the capacitated vehicle routing problem (cvrp) is a well-known combinatorial optimization problem that holds a central place in logistics management. the vehicle routing is an applied task in the industrial transportation for which an optimal solution will lead us to better services, save more time and ultimately increase in customer satisfaction. this problem is classified into np-hard problem...

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