A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem

Buriol, Luciana S.; França, Paulo Morelato; Moscato, Pablo

doi:10.1023/b:heur.0000045321.59202.52

Cited by 112 publications

(67 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Here we refer the reader to the three latest GAs and MAs proposed for the ATSP, all of which have shown good performance (see Choi et al (2003), Buriol et al (2004), andXing et al (2008)). …”

Section: Given a Directed Graph G = (V A) With Nonnegative Costs Assmentioning

confidence: 99%

See 1 more Smart Citation

A new genetic algorithm for the asymmetric traveling salesman problem

Nagata

Soler

2012

Expert Systems with Applications

View full text Add to dashboard Cite

Section: Given a Directed Graph G = (V A) With Nonnegative Costs Assmentioning

confidence: 99%

“…We compare the results of our GA with configuration SEL2+EAX-1AB with those of the latest GAs or MAs proposed in the literature to solve the ATSP: the heuristics proposed by Choi et al (2003), Buriol et al (2004), and Xing et al (2008). We make comparisons for the 27 well-known instances in TSPLIB.…”

Section: Comparison With Other Algorithmsmentioning

confidence: 99%

A new genetic algorithm for the asymmetric traveling salesman problem

Nagata

Soler

2012

Expert Systems with Applications

View full text Add to dashboard Cite

“…This population structure has been used before [10] and in Ref. [11] this was the best structure in a comprehensive test of alternative topologies. The method updatePop() is responsible for making the best solutions climb the tree towards the upper agents.…”

Section: Memetic Algorithmmentioning

confidence: 99%

“…In this paper, we employ a similar MA to those successfully used before for other combinatorial optimization problems, including Number Partitioning [10] and the Asymmetric Travelling Salesman [11] problems among others. Two local search methods are used; one of them has an embedded Tabu Search [12].…”

Section: Introductionmentioning

confidence: 99%

An automatic graph layout procedure to visualize correlated data

Inostroza-Ponta

Berretta

Mendes

et al.

IFIP International Federation for Information Processing

Self Cite

View full text Add to dashboard Cite

Abstract. This paper introduces an automatic procedure to assist on the interpretation of a large dataset when a similarity metric is available. We propose a visualization approach based on a graph layout methodology that uses a Quadratic Assignment Problem (QAP) formulation. The methodology is presented using as testbed a time series dataset of the Standard & Poor's 100, one the leading stock market indicators in the United States. A weighted graph is created with the stocks represented by the nodes and the edges' weights are related to the correlation between the stocks' time series. A heuristic for clustering is then proposed; it is based on the graph partition into disconnected subgraphs allowing the identification of clusters of highly-correlated stocks. The final layout corresponds well with the perceived market notion of the different industrial sectors. We compare the output of this procedure with a traditional dendogram approach of hierarchical clustering.

show abstract

“…Algumas revisões bibliográficas sobre o PCV podem ser encontradas em [60], [59], [20]. Os problemas mais comuns envolvendo o PCV estão relacionados ao roteamento de veículos [22] A reformulação do problema encontrado em [78] para o PCV é feita da seguinte forma:…”

Section: Modelos Integrados Utilizando O Problema Do Caixeiro Viajantunclassified

Estatégias para incorporação das deçisões de sequenciamento em um problema integrado de produção de bebidas

Defalque¹

View full text Add to dashboard Cite

A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem

Cited by 112 publications

References 29 publications

A new genetic algorithm for the asymmetric traveling salesman problem

A new genetic algorithm for the asymmetric traveling salesman problem

An automatic graph layout procedure to visualize correlated data

Estatégias para incorporação das deçisões de sequenciamento em um problema integrado de produção de bebidas

Contact Info

Product

Resources

About