نتایج جستجو برای: hybrid metaheuristic algorithm

تعداد نتایج: 918861  

2012
CHEN-LONG YU JIAN CHU

Engineering optimization problems usually have several conflicting objectives, such that no single solution can be considered optimum with respect to all objectives. In recent years, many efforts have focused on hybrid metaheuristic approaches for their robustness and efficiency to solve the above-mentioned multiobjective optimization problems (MOPs). This paper proposes a novel hybrid algorith...

Journal: :Electronic Commerce Research 2014
César Lincoln C. Mattos Guilherme De A. Barreto Francisco Rodrigo Porto Cavalcanti

An operational economic model for radio resource allocation in the downlink of a multi-cell WCDMA1 system is developed in this paper, and a particle swarm optimization (PSO) based approach is proposed for its solution. Firstly, we develop an economic model for resource allocation that considers the utility of the provided service, the acceptance probability of the service by the users and the r...

2018
Absalom E Ezugwu Francis Akutsah Micheal O Olusanya Aderemi O Adewumi

The intelligent water drop algorithm is a swarm-based metaheuristic algorithm, inspired by the characteristics of water drops in the river and the environmental changes resulting from the action of the flowing river. Since its appearance as an alternative stochastic optimization method, the algorithm has found applications in solving a wide range of combinatorial and functional optimization pro...

Journal: :journal of advances in computer research 2013
ali safari mamaghani kayvan asghari mohammad reza meybodi

evolutionary algorithms are some of the most crucial random approaches tosolve the problems, but sometimes generate low quality solutions. on the otherhand, learning automata are adaptive decision-making devices, operating onunknown random environments, so it seems that if evolutionary and learningautomaton based algorithms are operated simultaneously, the quality of results willincrease sharpl...

2014
Broderick Crawford Ricardo Soto Wenceslao Palma Franklin Johnson Fernando Paredes Eduardo Olguín

We present a novel application of the Artificial Bee Colony algorithm to solve the non-unicost Set Covering Problem. The Artificial Bee Colony algorithm is a recent Swarm Metaheuristic technique based on the intelligent foraging behavior of honey bees. We present a 2-level metaheuristic approach where an Artificial Bee Colony Algorithm acts as a low-level metaheuristic and its paremeters are se...

Journal: :IJAEC 2014
Morteza Alinia Ahandani Hosein Alavi-Rad

In this research, a study was carried out to exploit the hybrid schemes combining two classical local search techniques i.e. Nelder–Mead simplex search method and bidirectional random optimization with two metaheuristic methods i.e. the shuffled frog leaping and the shuffled complex evolution, respectively. In this hybrid methodology, each subset of meta-heuristic algorithms is improved by a hy...

Journal: :European Journal of Operational Research 2017
Daniel Karapetyan Abraham P. Punnen Andrew J. Parkes

We study the Bipartite Boolean Quadratic Programming Problem (BBQP) which is an extension of the well known Boolean Quadratic Programming Problem (BQP). Applications of the BBQP include mining discrete patterns from binary data, approximating matrices by rank-one binary matrices, computing the cut-norm of a matrix, and solving optimisation problems such as maximum weight biclique, bipartite max...

An optimal artificial neural network (ANN) has been developed to predict the Nusselt number of non-Newtonian nanofluids. The resulting ANN is a multi-layer perceptron with two hidden layers consisting of six and nine neurons, respectively. The tangent sigmoid transfer function is the best for both hidden layers and the linear transfer function is the best transfer function for the output layer....

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید