2009 WRI World Congress on Computer Science and Information Engineering 2009
DOI: 10.1109/csie.2009.220
|View full text |Cite
|
Sign up to set email alerts
|

Improvement of the Fusing Genetic Algorithm and Ant Colony Algorithm in Virtual Enterprise Partner Selection Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 7 publications
0
5
0
Order By: Relevance
“…The basic idea of this research is to enhance the search speed and accuracy by taking advantage of the rapid convergence of GA in the initial search period, and the ACO uses the initial solution provided by GA as the initial pheromone. The authors' research is different from the approach by Yao et al (2009). In this research, the ACO is improved to solve the partnership selection problem by generating more dispersed solutions and modifying the scheme for updating the trail intensity.…”
Section: Literature Reviewmentioning
confidence: 95%
See 1 more Smart Citation
“…The basic idea of this research is to enhance the search speed and accuracy by taking advantage of the rapid convergence of GA in the initial search period, and the ACO uses the initial solution provided by GA as the initial pheromone. The authors' research is different from the approach by Yao et al (2009). In this research, the ACO is improved to solve the partnership selection problem by generating more dispersed solutions and modifying the scheme for updating the trail intensity.…”
Section: Literature Reviewmentioning
confidence: 95%
“…In their research, the max-min Ant system is adopted in the local pheromone updating process to limit the upper and lower bounds of the pheromone value. Yao et al (2009) integrated the GA into a max-min ACO to optimise the partner-selection problems. Their experiments demonstrated that the hybrid algorithm is feasible for partner selection, and in some aspects the hybrid algorithm is superior to GA and ACO.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Each of these has its own advantages and disadvantages; thus, numerous researchers have considered investigations of multiple methods to be notable and hold promise for overcoming the defects of individual algorithms as well as achieving complementary advantages. The hybridization of a GA and ACO has been applied to solve numerous complex combinatorial optimization problems, such as the capacitated vehicle routing problem [26], logistics distribution route optimization [9], the 0-1 knapsack problem and quality of service [10], optimization of cloud database route scheduling [11], the virtual enterprise partner selection problem [12,13], and some NP-complete problems, including the satisfaction problem, the tripartite matching problem, and the TSP [27].…”
Section: Fused Algorithm Of a Ga And Aco A Review Of The Extant Algomentioning
confidence: 99%
“…The Concept of Fusing a GA and ACO. In this paper, the basic concept of the dynamic integration of a GA and ACO comes from Yao et al [12,13] and Xiong et al [29]. We adopted a GA to generate available solutions and update initial pheromone values.…”
Section: Concept Of Fusing a Genetic Algorithm And Ant Colony Optimizmentioning
confidence: 99%
See 1 more Smart Citation