Multiagent Optimization System for Solving the Traveling Salesman Problem (TSP)
暂无分享,去创建一个
[1] Chris Walshaw,et al. A Multilevel Approach to the Travelling Salesman Problem , 2002, Oper. Res..
[2] Jing Liu,et al. A traveling salesman approach for predicting protein functions , 2006, Source Code for Biology and Medicine.
[3] Yanchun Liang,et al. Particle swarm optimization-based algorithms for TSP and generalized TSP , 2007, Inf. Process. Lett..
[4] Weixiong Zhang,et al. A Novel Local Search Algorithm for the Traveling Salesman Problem that Exploits Backbones , 2005, IJCAI.
[5] Yuichi Nagata,et al. The EAX Algorithm Considering Diversity Loss , 2004, PPSN.
[6] Darrell Whitley,et al. Scheduling problems and traveling salesman: the genetic edge recombination , 1989 .
[7] Jeffrey K. Olick and,et al. Social Memory Studies: From “Collective Memory” to the Historical Sociology of Mnemonic Practices , 1998 .
[8] G Gigerenzer,et al. Reasoning the fast and frugal way: models of bounded rationality. , 1996, Psychological review.
[9] David E. Goldberg,et al. Alleles, loci and the traveling salesman problem , 1985 .
[10] John R. Anderson,et al. Human Symbol Manipulation Within an Integrated Cognitive Architecture , 2005, Cogn. Sci..
[11] Edward W. Felten,et al. Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..
[12] P. Richerson,et al. The Origin and Evolution of Cultures , 2005 .
[13] David E. Goldberg,et al. AllelesLociand the Traveling Salesman Problem , 1985, ICGA.
[14] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[15] Peter Merz,et al. Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges , 2007, EvoCOP.
[16] Thomas G. Dietterich. Learning at the Knowledge Level , 1986, Machine Learning.
[17] Andrea Roli,et al. MAGMA: a multiagent architecture for metaheuristics , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).
[18] David S. Johnson,et al. Data structures for traveling salesmen , 1993, SODA '93.
[19] Shigenobu Kobayashi,et al. Deterministic Multi-step Crossover Fusion: A Handy Crossover Composition for GAs , 2002, PPSN.
[20] Shigenobu Kobayashi,et al. Edge Assembly Crossover: A High-Power Genetic Algorithm for the Travelling Salesman Problem , 1997, ICGA.
[21] Andrew B. Kahng,et al. A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..
[22] Bart Selman,et al. Algorithm portfolios , 2001, Artif. Intell..
[23] Peter Merz,et al. Reducing the Size of Travelling Salesman Problem Instances by Fixing Edges , 2008, Recent Advances in Evolutionary Computation for Combinatorial Optimization.
[24] Jiming Liu,et al. A compact multiagent system based on autonomy oriented computing , 2005, IEEE/WIC/ACM International Conference on Intelligent Agent Technology.
[25] Hajime Kita,et al. A genetic solution for the traveling salesman problem by means of a thermodynamical selection rule , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.
[26] Jiming Liu,et al. How autonomy oriented computing (AOC) tackles a computationally hard optimization problem , 2006, AAMAS '06.
[27] BENNETT G. GALEF Jr,et al. Why behaviour patterns that animals learn socially are locally adaptive , 1995, Animal Behaviour.
[28] Thomas Stützle,et al. Local search algorithms for combinatorial problems - analysis, improvements, and new applications , 1999, DISKI.
[29] A. Bandura. Social Foundations of Thought and Action: A Social Cognitive Theory , 1985 .
[30] Danny Weyns,et al. On the Role of Environments in Multiagent Systems , 2005, Informatica.
[31] Paul D. Seymour,et al. Tour Merging via Branch-Decomposition , 2003, INFORMS J. Comput..
[32] T. Valone,et al. Public Information: From Nosy Neighbors to Cultural Evolution , 2004, Science.
[33] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[34] Phil Husbands,et al. Fitness Landscapes and Evolvability , 2002, Evolutionary Computation.
[35] Allen Newell,et al. Human Problem Solving. , 1973 .
[36] Nicholas R. Jennings,et al. Intelligent agents: theory and practice , 1995, The Knowledge Engineering Review.
[37] Luca Maria Gambardella,et al. Adaptive memory programming: A unified view of metaheuristics , 1998, Eur. J. Oper. Res..
[38] A. Baddeley. Exploring the Central Executive , 1996 .
[39] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[40] Manuela M. Veloso,et al. Multiagent Systems: A Survey from a Machine Learning Perspective , 2000, Auton. Robots.
[41] Nicos Christofides,et al. Algorithms for Large-scale Travelling Salesman Problems , 1972 .
[42] G. Reinelt. The traveling salesman: computational solutions for TSP applications , 1994 .
[43] Fred W. Glover,et al. Data structures and ejection chains for solving large-scale traveling salesman problems , 2005, Eur. J. Oper. Res..
[44] Thomas Stützle,et al. MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..
[45] Teodor Gabriel Crainic,et al. Systemic Behavior of Cooperative Search Algorithms , 2002, Parallel Comput..
[46] Tad Hogg,et al. An Economics Approach to Hard Computational Problems , 1997, Science.
[47] A. Bandura. Social Foundations of Thought and Action , 1986 .
[48] Colm O'Riordan,et al. Increasing Population Diversity Through Cultural Learning , 2006, Adapt. Behav..
[49] G Zaránd,et al. Using hysteresis for optimization. , 2002, Physical review letters.
[50] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..
[51] D. J. Smith,et al. A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.
[52] Eric Bonabeau,et al. Agent-based modeling: Methods and techniques for simulating human systems , 2002, Proceedings of the National Academy of Sciences of the United States of America.
[53] L. Darrell Whitley,et al. Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, International Conference on Genetic Algorithms.
[54] Xiao-Feng Xie,et al. SWAF: Swarm Algorithm Framework for Numerical Optimization , 2004, GECCO.
[55] Moritoshi Yasunaga,et al. Implementation of an Effective Hybrid GA for Large-Scale Traveling Salesman Problems , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).
[56] Zbigniew Michalewicz,et al. Inver-over Operator for the TSP , 1998, PPSN.
[57] William J. Cook,et al. Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003, INFORMS Journal on Computing.
[58] Jon Jouis Bentley,et al. Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..
[59] José Ignacio Hidalgo,et al. A hybrid heuristic for the traveling salesman problem , 2001, IEEE Trans. Evol. Comput..
[60] Timothy J. Brazill,et al. Culture as shared cognitive representations. , 1996, Proceedings of the National Academy of Sciences of the United States of America.
[61] Weixiong Zhang,et al. Take a walk and cluster genes: a TSP-based approach to optimal rearrangement clustering , 2004, ICML.
[62] Bernd Freisleben,et al. Memetic Algorithms for the Traveling Salesman Problem , 2002, Complex Syst..
[63] Byoung-Tak Zhang,et al. Solving traveling salesman problems with DNA molecules encoding numerical values. , 2004, Bio Systems.
[64] Marie-Pierre Gleizes,et al. Self-Organisation and Emergence in MAS: An Overview , 2006, Informatica.
[65] Keld Helsgaun,et al. An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..
[66] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[67] E. Tosatti,et al. Quantum annealing of the traveling-salesman problem. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[68] Thomas Caraco,et al. Social foraging: individual learning and cultural transmission of innovations , 1994 .
[69] Jiming Liu,et al. Toward nature-inspired computing , 2006, CACM.
[70] Geoffrey Zweig. An Effective Tour Construction and Improvement Procedure for the Traveling Salesman Problem , 1995, Oper. Res..
[71] L. Darrell Whitley,et al. The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt , 1998, PPSN.
[72] I. Couzin,et al. Collective memory and spatial sorting in animal groups. , 2002, Journal of theoretical biology.
[73] Byung-Ro Moon,et al. The natural crossover for the 2D Euclidean TSP , 2000 .
[74] Ajay S. Vinze,et al. Adopting ontology to facilitate knowledge sharing , 2004, CACM.
[75] ATSPDavid S. JohnsonAT. Experimental Analysis of Heuristics for the Stsp , 2001 .
[76] Byung Ro Moon,et al. Toward minimal restriction of genetic encoding and crossovers for the two-dimensional Euclidean TSP , 2002, IEEE Trans. Evol. Comput..
[77] E. D. Taillard,et al. Ant Systems , 1999 .
[78] Schloss Birlinghoven. Evolution in Time and Space -the Parallel Genetic Algorithm , 1991 .
[79] Stephen F. Smith,et al. Combining Multiple Heuristics Online , 2007, AAAI.
[80] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.
[81] A. Glenberg,et al. What memory is for: Creating meaning in the service of action , 1997, Behavioral and Brain Sciences.
[82] M. Flinn. Culture and the evolution of social learning , 1997 .
[83] Toby Walsh,et al. The Backbone of the Travelling Salesperson , 2005, IJCAI.
[84] Cheng-Yan Kao,et al. An evolutionary algorithm for large traveling salesman problems , 2004, IEEE Trans. Syst. Man Cybern. Part B.