Nothing Special   »   [go: up one dir, main page]

×
Please click here if you are not redirected within a few seconds.
Sep 9, 2012 · A simulated annealing ant colony algorithm based on backfire method(BASAC) is presented to tackle the quadratic assignment problem (QAP).
ABSTRACT. A simulated annealing ant colony algorithm based on backfire method(BASAC) is presented to tackle the quadratic assignment problem (QAP).
A simulated annealing ant colony algorithm(ASAC) is presented to tackle the quadratic assignment problem (QAP). The simulated annealing method is introduced ...
Missing: backfire | Show results with:backfire
A simulated annealing ant colony algorithm based on backfire method(BASAC) is presented to tackle the quadratic assignment problem (QAP). The simulated ...
This paper presents HAS-QAP, a hybrid ant colony system coupled with a local search, applied to the quadratic assignment problem. HAS-QAP uses pheromone ...
People also ask
Zhu, J., Rui, T., Liao, M., Zhang, J.: Simulated annealing ant colony algorithm based on backfire method for QAP. In: Yu, X., Lienhart, R., Zha, Z., Liu, Y ...
The proposed simulation algorithm for QAP solving is discussed in the next section. In Section 5, the results of simulation is presented and compared with other ...
Mar 14, 2023 · The ant colony optimization algorithm (ACO) has the advantage of distributed computing, robustness and global optimization, and was first used ...
Therefore, we resort to five algorithms: simple greedy sorting algorithm, two simulated annealing (SA) algorithms and two ant colony optimization (ACO) ...
Missing: backfire QAP.
Jun 2, 2014 · For the other two algorithms, they are suitable for a discrete optimization problem especially Ant colony since it is based on a population ...