Dm63 Heuristics for Combinatorial Optimization Ant Colony Optimization Exercises Outline Ant Colony Optimization: the Metaheuristic Application Examples Generalized Assignment Problem (gap) Connection between Aco and Other Metaheuristics Encodings Capacited Vehicle Routing Linear Ordering Ant Colony
暂无分享,去创建一个
[1] Roberto Montemanni,et al. Ant Colony System for a Dynamic Vehicle Routing Problem , 2005, J. Comb. Optim..
[2] M. Dorigo,et al. ACO/F-Race: Ant Colony Optimization and Racing Techniques for Combinatorial Optimization Under Uncertainty , 2005 .
[3] Shigeyoshi Tsutsui. cAS: Ant Colony Optimization with Cunning Ants , 2006, PPSN.
[4] Holger H. Hoos,et al. Improving the Ant System: A Detailed Report on the MAX-MIN Ant System , 1996 .
[5] Francesco Maffioli,et al. On the complexity of graph tree partition problems , 2004, Discret. Appl. Math..
[6] H. R. Lourenço,et al. Adaptive search heuristics for the generalized assignment problem , 2002 .
[7] Martin Grötschel,et al. The Orientation Model for Frequency Assignment Problems , 1998 .
[8] Nicolas Monmarché,et al. On how Pachycondyla apicalis ants suggest a new search algorithm , 2000, Future Gener. Comput. Syst..
[9] Michael Sampels,et al. Metaheuristics for Group Shop Scheduling , 2002, PPSN.
[10] M. Dorigo,et al. 1 Positive Feedback as a Search Strategy , 1991 .
[11] A. Gamst,et al. Some lower bounds for a class of frequency assignment problems , 1986, IEEE Transactions on Vehicular Technology.
[12] Richard F. Hartl,et al. Pareto Ant Colony Optimization: A Metaheuristic Approach to Multiobjective Portfolio Selection , 2004, Ann. Oper. Res..
[13] Marco Dorigo,et al. The hyper-cube framework for ant colony optimization , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).
[14] Dimitri P. Bertsekas,et al. Dynamic Programming and Optimal Control, Two Volume Set , 1995 .
[15] É. Taillard. COMPARISON OF ITERATIVE SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM. , 1995 .
[16] Eric C. Rosen,et al. The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..
[17] Marco Dorigo,et al. Ant colony optimization for continuous domains , 2008, Eur. J. Oper. Res..
[18] M. J. Bissett. Activity Networks , 1979 .
[19] E. Nowicki,et al. A fast tabu search algorithm for the permutation flow-shop problem , 1996 .
[20] Luca Maria Gambardella,et al. HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem , 1997 .
[21] Alistair I. Mees,et al. Convergence of an annealing algorithm , 1986, Math. Program..
[22] Mauro Birattari,et al. Model-Based Search for Combinatorial Optimization: A Critical Survey , 2004, Ann. Oper. Res..
[23] Christian Blum,et al. ACO Applied to Group Shop Scheduling: A Case Study on Intensification and Diversification , 2002, Ant Algorithms.
[24] Pascale Kuntz,et al. A Stochastic Heuristic for Visualising Graph Clusters in a Bi-Dimensional Space Prior to Partitioning , 1999, J. Heuristics.
[25] T. Lindvall. ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.
[26] Martin Zachariasen,et al. Tabu Search on the Geometric Traveling Salesman Problem , 1996 .
[27] Martin Middendorf,et al. Modeling the Dynamics of Ant Colony Optimization , 2002, Evolutionary Computation.
[28] Marco Dorigo,et al. Ant algorithms and stigmergy , 2000, Future Gener. Comput. Syst..
[29] Giorgio Gambosi,et al. Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .
[30] Laurent Keller,et al. Ant-like task allocation and recruitment in cooperative robots , 2000, Nature.
[31] Carlos Eduardo Ferreira,et al. Decomposing Matrices into Blocks , 1998, SIAM J. Optim..
[32] Benjamin W. Wah,et al. A Discrete Lagrangian-Based Global-Search Method for Solving Satisfiability Problems , 1996, J. Glob. Optim..
[33] Francisco Herrera,et al. A proposal for improving the accuracy of linguistic modeling , 2000, IEEE Trans. Fuzzy Syst..
[34] Michael Guntsch,et al. Applying Population Based ACO to Dynamic Optimization Problems , 2002, Ant Algorithms.
[35] Martin Heusse,et al. Routage et équilibrage de charge par agents dans les réseaux de communication , 2001 .
[36] Richard Bellman,et al. Mathematical Aspects Of Scheduling And Applications , 1982 .
[37] Peter Clark,et al. The CN2 Induction Algorithm , 1989, Machine Learning.
[38] Joaquín Bautista,et al. Ant Algorithms for Assembly Line Balancing , 2002, Ant Algorithms.
[39] Tim Walters,et al. Repair and Brood Selection in the Traveling Salesman Problem , 1998, PPSN.
[40] Derek H. Smith,et al. Improving heuristics for the frequency assignment problem , 1998, Eur. J. Oper. Res..
[41] Daniel Merkle,et al. Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays , 2002, Genetic Programming and Evolvable Machines.
[42] Chris N. Potts,et al. Single Machine Tardiness Sequencing Heuristics , 1991 .
[43] Martin Middendorf,et al. A Population Based Approach for ACO , 2002, EvoWorkshops.
[44] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[45] J. Ross Quinlan,et al. Combining Instance-Based and Model-Based Learning , 1993, ICML.
[46] Baldo Faieta,et al. Diversity and adaptation in populations of clustering ants , 1994 .
[47] Daniel Merkle,et al. Ant Colony Optimization with Global Pheromone Evaluation for Scheduling a Single Machine , 2004, Applied Intelligence.
[48] Chris Melhuish,et al. Stigmergy, Self-Organization, and Sorting in Collective Robotics , 1999, Artificial Life.
[49] Bart Baesens,et al. Ant-Based Approach to the Knowledge Fusion Problem , 2006, ANTS Workshop.
[50] Christian Blum,et al. Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.
[51] Nenad Mladenović,et al. An Introduction to Variable Neighborhood Search , 1997 .
[52] R. Ravi,et al. Spanning trees short or small , 1994, SODA '94.
[53] David Maxwell Chickering,et al. Learning Bayesian Networks: The Combination of Knowledge and Statistical Data , 1994, Machine Learning.
[54] Thomas Stützle,et al. Proceedings of ANTS 2000 – From Ant Colonies to Artificial Ants: Second International Workshop on Ant Algorithms , 2000 .
[55] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .
[56] Mihalis Yannakakis,et al. On the Complexity of Protein Folding , 1998, J. Comput. Biol..
[57] Francisco Herrera,et al. Analysis of the Best-Worst Ant System and Its Variants on the QAP , 2002, Ant Algorithms.
[58] G. Di Caro,et al. Ant colony optimization: a new meta-heuristic , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[59] Roberto Battiti,et al. Reactive Local Search for the Maximum Clique Problem1 , 2001, Algorithmica.
[60] Daniel Angus,et al. Multiple objective ant colony optimisation , 2009, Swarm Intelligence.
[61] Thomas Stützle,et al. Special issue on ant colony optimization , 2009, Swarm Intelligence.
[62] C. Ribeiro,et al. Essays and Surveys in Metaheuristics , 2002, Operations Research/Computer Science Interfaces Series.
[63] H. Haken,et al. Synergetics , 1988, IEEE Circuits and Devices Magazine.
[64] Tim Hesterberg,et al. Monte Carlo Strategies in Scientific Computing , 2002, Technometrics.
[65] Luca Maria Gambardella,et al. An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem , 2000, INFORMS J. Comput..
[66] Richard F. Hartl,et al. Cooperative Ant Colonies for Optimizing Resource Allocation in Transportation , 2001, EvoWorkshops.
[67] D. Atkin. OR scheduling algorithms. , 2000, Anesthesiology.
[68] Thomas Stützle,et al. On the Design of ACO for the Biobjective Quadratic Assignment Problem , 2004, ANTS Workshop.
[69] W. Gutjahr,et al. Runtime Analysis of Ant Colony Optimization with Best-So-Far Reinforcement , 2008 .
[70] Norman M. Sadeh,et al. Backtracking Techniques for the Job Shop Scheduling Constraint Satisfaction Problem , 1995, Artif. Intell..
[71] G. Robinson. Regulation of division of labor in insect societies. , 1992, Annual review of entomology.
[72] Hartmut Schmeck,et al. Ant colony optimization for resource-constrained project scheduling , 2000, IEEE Trans. Evol. Comput..
[73] Luca Maria Gambardella,et al. Using Ant Agents to Combine Reactive and Proactive Strategies for Routing in Mobile Ad-hoc Networks , 2005, Int. J. Comput. Intell. Appl..
[74] Olivier C. Martin,et al. Combining simulated annealing with local search heuristics , 1993, Ann. Oper. Res..
[75] Éric D. Taillard,et al. FANT: Fast ant system , 1998 .
[76] Marco Dorigo,et al. Ant colony optimization theory: A survey , 2005, Theor. Comput. Sci..
[77] R. Montemanni,et al. Ant colony optimization for real-world vehicle routing problems From theory to applications , .
[78] Gabriele Kotsis,et al. Parallelization strategies for the ant system , 1998 .
[79] William J. Cook,et al. Finding Tours in the TSP , 1999 .
[80] Cyril Fonlupt,et al. Parallel Ant Colonies for Combinatorial Optimization Problems , 1999, IPPS/SPDP Workshops.
[81] Mauricio G. C. Resende,et al. Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..
[82] Frank Thomson Leighton,et al. A Graph Coloring Algorithm for Large Scheduling Problems. , 1979, Journal of research of the National Bureau of Standards.
[83] Barbara P. Buttenfield,et al. Spatial metaphors for browsing large data archives , 2000 .
[84] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..
[85] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[86] W. Gutjahr. On the Finite-Time Dynamics of Ant Colony Optimization , 2006 .
[87] M Dorigo,et al. Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..
[88] Julia Handl,et al. Improved Ant-Based Clustering and Sorting , 2002, PPSN.
[89] Peter Brucker,et al. Improving Local Search Heuristics for some Scheduling Problems. Part II , 1996, Discret. Appl. Math..
[90] Thomas Stützle,et al. ACO algorithms for the quadratic assignment problem , 1999 .
[91] Imed Bouazizi,et al. ARA-the ant-colony based routing algorithm for MANETs , 2002, Proceedings. International Conference on Parallel Processing Workshop.
[92] Fred W. Glover,et al. Tabu search and finite convergence , 2002, Discret. Appl. Math..
[93] Nicos Christofides. Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.
[94] Christian Blum,et al. When Model Bias Is Stronger than Selection Pressure , 2002, PPSN.
[95] Paul A. Rubin,et al. Scheduling in a sequence dependent setup environment with genetic search , 1995, Comput. Oper. Res..
[96] Martin Middendorf,et al. Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP , 2001, EvoWorkshops.
[97] Richard F. Hartl,et al. Analyzing a Unified Ant System for the VRP and Some of Its Variants , 2003, EvoWorkshops.
[98] J. Deneubourg,et al. Modulation of trail laying in the antLasius niger (Hymenoptera: Formicidae) and its role in the collective selection of a food source , 1993, Journal of Insect Behavior.
[99] Rafael Martí,et al. Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..
[100] Luca Maria Gambardella,et al. Ant Algorithms for Discrete Optimization , 1999, Artificial Life.
[101] Jean C. Walrand,et al. High-performance communication networks , 1999 .
[102] Martin Grötschel,et al. Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..
[103] Paul A. Viola,et al. MIMIC: Finding Optima by Estimating Probability Densities , 1996, NIPS.
[104] Alice E. Smith,et al. An ant system approach to redundancy allocation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[105] M. Dorigo,et al. Ant System: An Autocatalytic Optimizing Process , 1991 .
[106] Rina Dechter,et al. Temporal Constraint Networks , 1989, Artif. Intell..
[107] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[108] Piotr Czyzżak,et al. Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization , 1998 .
[109] John W. Dickey,et al. Campus building arrangement using topaz , 1972 .
[110] Christine Solnon,et al. Ants can solve constraint satisfaction problems , 2002, IEEE Trans. Evol. Comput..
[111] Inyong Ham,et al. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .
[112] Marco Dorigo,et al. The ant colony optimization meta-heuristic , 1999 .
[113] Mika Nyströem. Solving Certain Large Instances of the Quadratic Assignment Problem: Steinberg's Examples , 1999 .
[114] Rohit Chandra,et al. Parallel programming in openMP , 2000 .
[115] Marco Dorigo,et al. AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..
[116] Krzysztof Socha,et al. ACO for Continuous and Mixed-Variable Optimization , 2004, ANTS Workshop.
[117] K. Schittkowski,et al. NONLINEAR PROGRAMMING , 2022 .
[118] Cengiz Alaettinoglu,et al. Performance comparison of routing protocols under dynamic and static file transfer connections , 1992, CCRV.
[119] Paul Morris,et al. The Breakout Method for Escaping from Local Minima , 1993, AAAI.
[120] Marco Dorigo,et al. Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks , 1998, PPSN.
[121] Marco Dorigo,et al. Ant Algorithms Solve Difficult Optimization Problems , 2001, ECAL.
[122] William J. Cook,et al. Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003, INFORMS Journal on Computing.
[123] Dirk Sudholt,et al. Analysis of different MMAS ACO algorithms on unimodal functions and plateaus , 2009, Swarm Intelligence.
[124] R. S. Laundy,et al. Multiple Criteria Optimisation: Theory, Computation and Application , 1989 .
[125] Luca Maria Gambardella,et al. Solving symmetric and asymmetric TSPs by ant colonies , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.
[126] Thomas Stützle,et al. Parallel Ant Colony Optimization for the Traveling Salesman Problem , 2006, ANTS Workshop.
[127] Hong Zhang,et al. Collective Robotics: From Social Insects to Robots , 1993, Adapt. Behav..
[128] Norman M. Sadeh,et al. Variable and Value Ordering Heuristics for the Job Shop Scheduling Constraint Satisfaction Problem , 1996, Artif. Intell..
[129] N. Franks. Teams in social insects: group retrieval of prey by army ants (Eciton burchelli, Hymenoptera: Formicidae) , 1986, Behavioral Ecology and Sociobiology.
[130] Stephen F. Smith,et al. Ant colony control for autonomous decentralized shop floor routing , 2001, Proceedings 5th International Symposium on Autonomous Decentralized Systems.
[131] J H Sudd. The transport of prey by ants. , 1965, Behaviour.
[132] Jeremy Frank,et al. Weighting for Godot: Learning Heuristics for GSAT , 1996, AAAI/IAAI, Vol. 1.
[133] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[134] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .
[135] Jon Jouis Bentley,et al. Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..
[136] P. Grassberger,et al. Growth algorithms for lattice heteropolymers at low temperatures , 2002, cond-mat/0208042.
[137] Ching-Fang Liaw,et al. A hybrid genetic algorithm for the open shop scheduling problem , 2000, Eur. J. Oper. Res..
[138] Thomas Stützle,et al. Parallelization Strategies for Ant Colony Optimization , 1998, PPSN.
[139] Roberto Tadei,et al. An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem , 2004, Oper. Res. Lett..
[140] Israel A. Wagner,et al. ANTS: Agents on Networks, Trees, and Subgraphs , 2000, Future Gener. Comput. Syst..
[141] Alain Hertz,et al. Ants can colour graphs , 1997 .
[142] Marc Gravel,et al. Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic , 2002, Eur. J. Oper. Res..
[143] Egon Balas,et al. Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .
[144] Christian Blum,et al. ACO for Maximal Constraint Satisfaction Problems , 2001 .
[145] Luca Maria Gambardella,et al. Evolving Self-Organizing Behaviors for a Swarm-Bot , 2004, Auton. Robots.
[146] Caj Cor Hurkens,et al. Upper and lower bounding techniques for frequency assignment problems , 1995 .
[147] Marco Dorigo,et al. Ant-Based Clustering and Topographic Mapping , 2006, Artificial Life.
[148] Marco Dorigo,et al. Model-Based Search for Combinatorial Optimization: A Comparative Study , 2002, PPSN.
[149] Toby Walsh,et al. Binary vs. non-binary constraints , 2002, Artif. Intell..
[150] T. Stützle,et al. MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).
[151] E. Baum. Towards practical `neural' computation for combinatorial optimization problems , 1987 .
[152] Dorit S. Hochba,et al. Approximation Algorithms for NP-Hard Problems , 1997, SIGA.
[153] Martin Heusse,et al. Adaptive Agent-Driven Routing and Load Balancing in Communication Networks , 1998, Adv. Complex Syst..
[154] Patrick Albert,et al. Integration of ACO in a Constraint Programming Language , 2008, ANTS Conference.
[155] Richard F. Hartl,et al. Applying the ANT System to the Vehicle Routing Problem , 1999 .
[156] R. Bixby,et al. On the Solution of Traveling Salesman Problems , 1998 .
[157] Georg Dorffner,et al. Ant Systems to solve operational problems , 2002 .
[158] H. Robbins. A Stochastic Approximation Method , 1951 .
[159] Richard F. Hartl,et al. An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..
[160] Jeff T. Linderoth,et al. Solving large quadratic assignment problems on computational grids , 2002, Math. Program..
[161] Francesco Mondada,et al. Probabilistic Modelling of a Bio-Inspired Collective Experiment with Real Robots , 1998, DARS.
[162] Dorothea Heiss-Czedik,et al. An Introduction to Genetic Algorithms. , 1997, Artificial Life.
[163] Jean-Louis Deneubourg,et al. Organisation spatiale du matériel provenant de l'excavation du nid chez Messor barbarus et des cadavres d'ouvrières chez Lasius niger (Hymenopterae: Formicidae) , 1996 .
[164] Patrick Jaillet,et al. Probabilistic Traveling Salesman Problems , 1985 .
[165] Jürgen Branke,et al. New Ideas for Applying Ant Colony Optimization to the Probabilistic TSP , 2003, EvoWorkshops.
[166] J. A. Lozano,et al. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .
[167] Thomas Stützle,et al. A short convergence proof for a class of ant colony optimization algorithms , 2002, IEEE Trans. Evol. Comput..
[168] Martin Grötschel,et al. On the symmetric travelling salesman problem: Solution of a 120-city problem , 1980 .
[169] Steven Minton,et al. Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..
[170] Christian Blum,et al. Metaheuristics for the edge-weighted K-cardinality tree problem , 2003 .
[171] Richard F. Hartl,et al. Insertion Based Ants for Vehicle Routing Problems with Backhauls and Time Windows , 2002, Ant Algorithms.
[172] Jean-Louis Deneubourg,et al. The dynamics of collective sorting robot-like ants and ant-like robots , 1991 .
[173] Leon Steinberg,et al. The Backboard Wiring Problem: A Placement Algorithm , 1961 .
[174] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[175] C. Mariano,et al. MOAQ an Ant-Q algorithm for multiple objective optimization problems , 1999 .
[176] Marco Dorigo,et al. Mobile agents for adaptive routing , 1998, Proceedings of the Thirty-First Hawaii International Conference on System Sciences.
[177] P.-P. Grasse. La reconstruction du nid et les coordinations interindividuelles chezBellicositermes natalensis etCubitermes sp. la théorie de la stigmergie: Essai d'interprétation du comportement des termites constructeurs , 1959, Insectes Sociaux.
[178] Patrick Jaillet,et al. A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited , 1988, Oper. Res..
[179] Torsten Braun,et al. Ants-Based Routing in Large Scale Mobile Ad-Hoc Networks , 2003, KiVS Kurzbeiträge.
[180] Marco Dorigo,et al. Ant colony optimization and its application to adaptive routing in telecommunication networks , 2004 .
[181] Francesco Mondada,et al. Mobile Robot Miniaturisation: A Tool for Investigation in Control Algorithms , 1993, ISER.
[182] Richard S. Sutton,et al. Neuronlike adaptive elements that can solve difficult learning control problems , 1983, IEEE Transactions on Systems, Man, and Cybernetics.
[183] Olli Bräysy,et al. A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows , 2003, INFORMS J. Comput..
[184] Thomas G. Dietterich. What is machine learning? , 2020, Archives of Disease in Childhood.
[185] Stephen F. Smith,et al. Wasp-like Agents for Distributed Factory Coordination , 2004, Autonomous Agents and Multi-Agent Systems.
[186] Thomas Stützle,et al. Iterated Ants: An Experimental Study for the Quadratic Assignment Problem , 2006, ANTS Workshop.
[187] Roberto Battiti,et al. The Reactive Tabu Search , 1994, INFORMS J. Comput..
[188] Horst W. Hamacher,et al. Integer programming approaches tofacilities layout models with forbidden areas , 1998, Ann. Oper. Res..
[189] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.
[190] Francisco Herrera,et al. COR: a methodology to improve ad hoc data-driven linguistic rule learning methods by inducing cooperation among rules , 2002, IEEE Trans. Syst. Man Cybern. Part B.
[191] G. R. Schreiber,et al. Cut Size Statistics of Graph Bisection Heuristics , 1999, SIAM J. Optim..
[192] Marco Dorigo,et al. Ant Colony Optimization and Stochastic Gradient Descent , 2002, Artificial Life.
[193] Riccardo Poli,et al. New ideas in optimization , 1999 .
[194] H. Mühlenbein,et al. From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.
[195] G. Thompson,et al. Algorithms for Solving Production-Scheduling Problems , 1960 .
[196] Fred W. Glover,et al. An Ejection Chain Approach for the Generalized Assignment Problem , 2004, INFORMS J. Comput..
[197] John Knox,et al. Tabu search performance on the symmetric traveling salesman problem , 1994, Comput. Oper. Res..
[198] Marc Gravel,et al. PARALLEL IMPLEMENTATION OF AN ANT COLONY OPTIMIZATION METAHEURISTIC WITH OPENMP , 2001 .
[199] Michael Jünger,et al. Provably good solutions for the traveling salesman problem , 1994, Math. Methods Oper. Res..
[200] C. Roucairol,et al. TREE ELABORATION STRATEGIES IN BRANCH-AND- BOUND ALGORITHMS FOR SOLVING THE QUADRATIC ASSIGNMENT PROBLEM , 2001 .
[201] J. L. Maryak,et al. Bayesian Heuristic Approach to Discrete and Global Optimization , 1999, Technometrics.
[202] Mauro Birattari,et al. Toward the Formal Foundation of Ant Programming , 2002, Ant Algorithms.
[203] Guy Theraulaz,et al. Adaptive Task Allocation Inspired by a Model of Division of Labor in Social Insects , 1997, BCEC.
[204] Edward G. Coffman,et al. Approximation algorithms for bin packing: a survey , 1996 .
[205] Gregory Gutin,et al. The traveling salesman problem , 2006, Discret. Optim..
[206] P. Gilmore. Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .
[207] Daniel Merkle,et al. Ant Colony Optimization with the Relative Pheromone Evaluation Method , 2002, EvoWorkshops.
[208] Gerhard Wäscher,et al. Heuristics for the integer one-dimensional cutting stock problem: A computational study , 1996 .
[209] Simon Streltsov,et al. Variance reduction algorithms for parallel replicated simulation of uniformized Markov chains , 1996, Discret. Event Dyn. Syst..
[210] Hisao Ishibuchi,et al. A simple but powerful heuristic method for generating fuzzy rules from numerical data , 1997, Fuzzy Sets Syst..
[211] Charles Fleurent,et al. Genetic and hybrid algorithms for graph coloring , 1996, Ann. Oper. Res..
[212] ATSPDavid S. JohnsonAT. Experimental Analysis of Heuristics for the Stsp , 2001 .
[213] Wlodzimierz Szwarc,et al. Algorithmic paradoxes of the single‐machine total tardiness problem , 2001 .
[214] Alex A. Freitas,et al. An Ant Colony Algorithm for Classification Rule Discovery , 2002 .
[215] David E. Goldberg,et al. A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..
[216] Mauro Birattari,et al. Updating ACO Pheromones Using Stochastic Gradient Ascent and Cross-Entropy Methods , 2002, EvoWorkshops.
[217] Heinz Mühlenbein,et al. The Equation for Response to Selection and Its Use for Prediction , 1997, Evolutionary Computation.
[218] Richard S. Sutton,et al. Learning to predict by the methods of temporal differences , 1988, Machine Learning.
[219] Alberto L. Sangiovanni-Vincentelli,et al. A theoretical framework for simulated annealing , 1991, Algorithmica.
[220] Christian Blum,et al. Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling , 2005, Comput. Oper. Res..
[221] Marco Dorigo,et al. An adaptive multi-agent routing algorithm inspired by ants behavior , 1998 .
[222] Marco Dorigo,et al. Optimization, Learning and Natural Algorithms , 1992 .
[223] Reuven Y. Rubinstein,et al. Simulation and the Monte Carlo method , 1981, Wiley series in probability and mathematical statistics.
[224] Devika Subramanian,et al. Ants and Reinforcement Learning: A Case Study in Routing in Dynamic Networks , 1997, IJCAI.
[225] K. Dill,et al. A lattice statistical mechanics model of the conformational and sequence spaces of proteins , 1989 .
[226] Z. Michalewicz,et al. A new version of ant system for subset problems , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[227] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[228] V. Rich. Personal communication , 1989, Nature.
[229] Helena Ramalhinho Dias Lourenço,et al. Iterated Local Search , 2001, Handbook of Metaheuristics.
[230] Tobias Teich,et al. A new Ant Colony Algorithm for the Job Shop Scheduling Problem , 2001 .
[231] Andrew W. Moore,et al. Gradient Descent for General Reinforcement Learning , 1998, NIPS.
[232] Daniel Brélaz,et al. New methods to color the vertices of a graph , 1979, CACM.
[233] Luca Maria Gambardella,et al. An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem , 2002, PPSN.
[234] W. Gutjahr. S-ACO: An Ant-Based Approach to Combinatorial Optimization Under Uncertainty , 2004, ANTS Workshop.
[235] Thomas Stützle,et al. An Experimental Study of the Simple Ant Colony Optimization Algorithm , 2001 .
[236] B. Bullnheimer,et al. A NEW RANK BASED VERSION OF THE ANT SYSTEM: A COMPUTATIONAL STUDY , 1997 .
[237] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..
[238] Kwang Mong Sim,et al. Ant colony optimization for routing and load-balancing: survey and new directions , 2003, IEEE Trans. Syst. Man Cybern. Part A.
[239] Guy Theraulaz,et al. A Brief History of Stigmergy , 1999, Artificial Life.
[240] Richard J. Wallace,et al. Partial Constraint Satisfaction , 1989, IJCAI.
[241] Martin Middendorf,et al. Solving Multi-criteria Optimization Problems with Population-Based ACO , 2003, EMO.
[242] Francisco Herrera,et al. A New ACO Model Integrating Evolutionary Computation Concepts: The Best-Worst Ant System , 2000 .
[243] Jin-Kao Hao,et al. Tabu Search for Graph Coloring, T-Colorings and Set T-Colorings , 1999 .
[244] Mihalis Yannakakis,et al. How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[245] R. Kolisch,et al. Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis , 1998 .
[246] G. Reinelt. The traveling salesman: computational solutions for TSP applications , 1994 .
[247] Walter J. Gutjahr,et al. A Graph-based Ant System and its convergence , 2000, Future Gener. Comput. Syst..
[248] A. Schrijver. On the History of Combinatorial Optimization (Till 1960) , 2005 .
[249] Matteo Fischetti,et al. Weighted k-cardinality trees: Complexity and polyhedral structure , 1994, Networks.
[250] Peter Clark,et al. Rule Induction with CN2: Some Recent Improvements , 1991, EWSL.
[251] Michel Gendreau,et al. A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..
[252] Corso Elvezia,et al. Ant colonies for the traveling salesman problem , 1997 .
[253] Thomas Stützle,et al. The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances , 2003 .
[254] Luca Maria Gambardella,et al. A Study of Some Properties of Ant-Q , 1996, PPSN.
[255] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[256] Michael Sampels,et al. Ant Algorithms for the University Course Timetabling Problem with Regard to the State-of-the-Art , 2003, EvoWorkshops.
[257] Martin E. Dyer,et al. Locating the Phase Transition in Binary Constraint Satisfaction Problems , 1996, Artif. Intell..
[258] E. Lawler. A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .
[259] Jakob Krarup,et al. A hospital facility layout problem finally solved , 2001, J. Intell. Manuf..
[260] Hartmut Schmeck,et al. Multi Colony Ant Algorithms , 2002, J. Heuristics.
[261] G. Croes. A Method for Solving Traveling-Salesman Problems , 1958 .
[262] Chris N. Potts,et al. A survey of algorithms for the single machine total weighted tardiness scheduling problem , 1990, Discret. Appl. Math..
[263] H. R. Lourenço,et al. Adaptive Approach Heuristics for The Generalized Assignment Problem , 1998 .
[264] J. Moy,et al. OSPF: Anatomy of an Internet Routing Protocol , 1998 .
[265] Edward W. Felten,et al. Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..
[266] John Baxter,et al. Local Optima Avoidance in Depot Location , 1981 .
[267] Vittorio Maniezzo,et al. An Ant-Based Framework for Very Strongly Constrained Problems , 2002, Ant Algorithms.
[268] Thomas Stützle,et al. An Experimental Investigation of Iterated Local Search for Coloring Graphs , 2002, EvoWorkshops.
[269] Dit-Yan Yeung,et al. Predictive Q-Routing: A Memory-based Reinforcement Learning Approach to Adaptive Traffic Control , 1995, NIPS.
[270] Andreas T. Ernst,et al. Integrating ACO and Constraint Propagation , 2004, ANTS Workshop.
[271] Qiang Yang,et al. Theory and Algorithms for Plan Merging , 1992, Artif. Intell..
[272] Richard S. Sutton,et al. Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.
[273] Christine Solnon,et al. A Study of Greedy, Local Search, and Ant Colony Optimization Approaches for Car Sequencing Problems , 2003, EvoWorkshops.
[274] Zbigniew Michalewicz,et al. An ant system for the maximum independent set problem , 2001 .
[275] Adnan Acan. An External Memory Implementation in Ant Colony Optimization , 2004, ANTS Workshop.
[276] Bart Selman,et al. Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .
[277] J. Deneubourg,et al. The self-organizing exploratory pattern of the argentine ant , 1990, Journal of Insect Behavior.
[278] Chris N. Potts,et al. Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem , 1998, INFORMS J. Comput..
[279] Ronald J. Williams,et al. Simple Statistical Gradient-Following Algorithms for Connectionist Reinforcement Learning , 2004, Machine Learning.
[280] Richard F. Hartl,et al. D-Ants: Savings Based Ants divide and conquer the vehicle routing problem , 2004, Comput. Oper. Res..
[281] Daniel Merkle,et al. An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems , 2000, EvoWorkshops.
[282] Jean-Louis Deneubourg,et al. From local actions to global tasks: stigmergy and collective robotics , 2000 .
[283] Daniel Merkle,et al. Bi-Criterion Optimization with Multi Colony Ant Algorithms , 2001, EMO.
[284] Elena Marchiori,et al. An Evolutionary Algorithm for Large Scale Set Covering Problems with Application to Airline Crew Scheduling , 2000, EvoWorkshops.
[285] Matteo Fischetti,et al. A Heuristic Method for the Set Covering Problem , 1999, Oper. Res..
[286] Daniel Merkle,et al. On the Behaviour of ACO Algorithms : Studies on Simple Problems , 2001 .
[287] Gregory F. Cooper,et al. A Bayesian method for the induction of probabilistic networks from data , 1992, Machine Learning.
[288] E. Nowicki,et al. A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .
[289] J. Ross Quinlan,et al. C4.5: Programs for Machine Learning , 1992 .
[290] Mauricio G. C. Resende,et al. Grasp: An Annotated Bibliography , 2002 .
[291] Manuel López-Ibáñez,et al. Ant colony optimization , 2010, GECCO '10.
[292] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[293] Luca Maria Gambardella,et al. MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .
[294] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[295] Hartmut Schmeck,et al. An Ant Colony Optimization approach to dynamic TSP , 2001 .
[296] Luca Maria Gambardella,et al. Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem , 1995, ICML.
[297] Silvano Martello,et al. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .
[298] Marco Dorigo,et al. An Investigation of some Properties of an "Ant Algorithm" , 1992, PPSN.
[299] Shervin Nouyan,et al. Agent-Based Approach to Dynamic Task Allocation , 2002, Ant Algorithms.
[300] A. N. Elshafei,et al. Hospital Layout as a Quadratic Assignment Problem , 1977 .
[301] Emanuel Falkenauer,et al. A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.
[302] Keah Choon Tan,et al. Minimizing Tardiness on a Single Processor with Sequence Dependent Setup Times: A Simulated Annealing Approach , 1997 .
[303] Finn V. Jensen,et al. Bayesian Networks and Decision Graphs , 2001, Statistics for Engineering and Information Science.
[304] Elena Marchiori,et al. Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem , 2002, EvoWorkshops.
[305] Marc Gravel,et al. Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times , 2002, J. Oper. Res. Soc..
[306] John S. Baras,et al. A Probabilistic Emergent Routing Algorithm for Mobile Ad Hoc Networks , 2003 .
[307] M. Resende,et al. A probabilistic heuristic for a computationally difficult set covering problem , 1989 .
[308] Michael L. Littman,et al. Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach , 1993, NIPS.
[309] Christine Solnon,et al. Solving Permutation Constraint Satisfaction Problems with Artificial Ants , 2000, ECAI.
[310] R. Haupt,et al. A survey of priority rule-based scheduling , 1989 .
[311] Jose Miguel Puerta,et al. Ant colony optimization for learning Bayesian networks , 2002, Int. J. Approx. Reason..
[312] Jürgen Branke,et al. Improved heuristics and a genetic algorithm for finding short supersequences , 1998 .
[313] ČernýV.. Thermodynamical approach to the traveling salesman problem , 1985 .
[314] Fred Glover,et al. Scatter Search and Path Relinking: Advances and Applications , 2003, Handbook of Metaheuristics.
[315] Hiroshi Matsuo,et al. An Adaptive Ant - based Routing Algorithm used routing history in Dynamic Networks , 2002 .
[316] Peter Ross,et al. A Promising Hybrid GA/Heuristic Approach for Open-Shop Scheduling Problems , 1994, ECAI.
[317] Karl F. Doerner,et al. A Savings Based Ant System For The Vehicle Routing Problem , 2002, GECCO.
[318] Gilbert Laporte,et al. Metaheuristics: A bibliography , 1996, Ann. Oper. Res..
[319] Marco Dorigo,et al. Distributed Optimization by Ant Colonies , 1992 .
[320] M. Dorigo,et al. Aco Algorithms for the Traveling Salesman Problem , 1999 .
[321] B. Freisleben,et al. Genetic local search for the TSP: new results , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).
[322] Thomas Stützle,et al. A SHORT CONVERGENCE PROOF FOR A CLASS OF ACO ALGORITHMS , 2002 .
[323] Richard F. Hartl,et al. Cooperative Ant Colony Optimization on Clusters and Grids , 2004 .
[324] Y. Kermarrec,et al. Adaptive routing and load balancing of ephemeral connections , 2000, 1st European Conference on Universal Multiservice Networks. ECUMN'2000 (Cat. No.00EX423).
[325] Mauro Birattari,et al. An Insect-Based Algorithm for the Dynamic Task Allocation Problem , 2005, Künstliche Intell..
[326] Andrew J. Davenport,et al. GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement , 1994, AAAI.
[327] Éric D. Taillard,et al. Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..
[328] Frank Neumann,et al. Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Runtime Analysis of a Simple Ant Colony Optimization Algorithm Runtime Analysis of a Simple Ant Colony Optimization Algorithm , 2022 .
[329] Hartmut Schmeck,et al. Pheromone evaluation in Ant Colony Optimization , 2000, 2000 26th Annual Conference of the IEEE Industrial Electronics Society. IECON 2000. 2000 IEEE International Conference on Industrial Electronics, Control and Instrumentation. 21st Century Technologies.
[330] Israel A. Wagner,et al. Smell as a Computational Resource - A Lesson We Can Learn from the Ant , 1996, ISTCS.
[331] Andrew W. Moore,et al. Reinforcement Learning: A Survey , 1996, J. Artif. Intell. Res..
[332] Jin-Kao Hao,et al. Hybrid Evolutionary Algorithms for Graph Coloring , 1999, J. Comb. Optim..
[333] Martin Middendorf,et al. An Island Model Based Ant System with Lookahead for the Shortest Supersequence Problem , 1998, PPSN.
[334] Thomas Stützle,et al. Experiments with Variants of Ant Algorithms , 2002 .
[335] Marco Dorigo,et al. Search bias in ant colony optimization: on the role of competition-balanced systems , 2005, IEEE Transactions on Evolutionary Computation.
[336] David S. Johnson,et al. The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .
[337] Geoffrey I. Webb,et al. MultiBoosting: A Technique for Combining Boosting and Wagging , 2000, Machine Learning.
[338] Barbara Webb,et al. Swarm Intelligence: From Natural to Artificial Systems , 2002, Connect. Sci..
[339] Jon Crowcroft,et al. Analysis of shortest-path routing algorithms in a dynamic network environment , 1992, CCRV.
[340] Christian Blum,et al. Theoretical and practical aspects of ant colony optimization , 2004 .
[341] Ingo Rechenberg,et al. Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution , 1973 .
[342] Thomas Stützle,et al. A Comparison Between ACO Algorithms for the Set Covering Problem , 2004, ANTS Workshop.
[343] Christine Solnon,et al. Searching for Maximum Cliques with Ant Colony Optimization , 2003, EvoWorkshops.
[344] Thomas Stützle,et al. A Racing Algorithm for Configuring Metaheuristics , 2002, GECCO.
[345] Nicolas Monmarché,et al. An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem , 2002, Eur. J. Oper. Res..
[346] Panos M. Pardalos,et al. Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP , 2000, Discret. Appl. Math..
[347] Chris N. Potts,et al. An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem , 2002, INFORMS J. Comput..
[348] A. Khanna,et al. The revised ARPANET routing metric , 1989, SIGCOMM '89.
[349] Rich Caruana,et al. Removing the Genetics from the Standard Genetic Algorithm , 1995, ICML.
[350] Thomas Stützle,et al. An Ant Approach to the Flow Shop Problem , 1998 .
[351] Ram V. Rachamadugu,et al. Accurate myopic heuristics for tardiness scheduling , 1984 .
[352] Christian Blum,et al. New metaheuristic approaches for the edge-weighted k-cardinality tree problem , 2005, Comput. Oper. Res..
[353] M. C. Sinclair,et al. Ant colony optimisation for virtual-wavelength-path routing and wavelength allocation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[354] Thomas Stützle,et al. MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..
[355] Saïd Hanafi,et al. On the Convergence of Tabu Search , 2001, J. Heuristics.
[356] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[357] Keld Helsgaun,et al. An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..
[358] C. J. Eyckelhof,et al. Ant Systems for a Dynamic TSP - Ants Caught in a Traffic Jam , 2002 .
[359] Sönke Hartmann,et al. Self-adapting genetic algorithms with an application to project scheduling , 1999 .
[360] Frank Thomson Leighton,et al. Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete , 1998, RECOMB '98.
[361] Walter J. Gutjahr,et al. Mathematical runtime analysis of ACO algorithms: survey on an emerging issue , 2007, Swarm Intelligence.
[362] Carlo Mannino,et al. Models and solution techniques for frequency assignment problems , 2003, 4OR.
[363] Frederick Ducatelle,et al. Ant colony optimization and local search for bin packing and cutting stock problems , 2004, J. Oper. Res. Soc..
[364] Teofilo F. Gonzalez,et al. P-Complete Approximation Problems , 1976, J. ACM.
[365] J. Deneubourg,et al. Self-organized shortcuts in the Argentine ant , 1989, Naturwissenschaften.
[366] Thomas Stützle,et al. Special Section on Ant Colony Optimization , 2002 .
[367] Luca Maria Gambardella,et al. Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic , 2002, Ant Algorithms.
[368] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[369] Christian Blum,et al. On A Particularity In Model-based Search , 2002, GECCO.
[370] F. Glover,et al. In Modern Heuristic Techniques for Combinatorial Problems , 1993 .
[371] Walter J. Gutjahr,et al. A Converging ACO Algorithm for Stochastic Combinatorial Optimization , 2003, SAGA.
[372] G. Clarke,et al. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .
[373] J. Deneubourg,et al. Self-organization mechanisms in ant societies. I. Trail recruitment to newly discovered food sources , 1987 .
[374] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[375] Thomas Stützle,et al. Local search algorithms for combinatorial problems - analysis, improvements, and new applications , 1999, DISKI.
[376] A. Hasman,et al. Probabilistic reasoning in intelligent systems: Networks of plausible inference , 1991 .
[377] Eugene C. Freuder,et al. Heuristic Methods for Over-Constrained Constraint Satisfaction Problems , 1995, Over-Constrained Systems.
[378] Marco Dorigo,et al. Ant system for Job-shop Scheduling , 1994 .
[379] Alex Alves Freitas,et al. Data mining with an ant colony optimization algorithm , 2002, IEEE Trans. Evol. Comput..
[380] Holger H. Hoos,et al. An ant colony optimisation algorithm for the 2D and 3D hydrophobic polar protein folding problem , 2005, BMC Bioinformatics.
[381] L. W. Jacobs,et al. Note: A local-search heuristic for large set-covering problems , 1995 .
[382] F. Glover. HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .
[383] H. Paessens,et al. The savings algorithm for the vehicle routing problem , 1988 .
[384] Lawrence J. Fogel,et al. Artificial Intelligence through Simulated Evolution , 1966 .
[385] Jerry M. Mendel,et al. Generating fuzzy rules by learning from examples , 1992, IEEE Trans. Syst. Man Cybern..
[386] Yves Crama,et al. Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.
[387] Rina Dechter,et al. Tree-Clustering Schemes for Constraint-Processing , 1988, AAAI.
[388] N. Franks,et al. Brood sorting by ants: distributing the workload over the work-surface , 1992, Behavioral Ecology and Sociobiology.
[389] Janet Bruten,et al. Ant-like agents for load balancing in telecommunications networks , 1997, AGENTS '97.
[390] Rolf H. Möhring,et al. Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..
[391] Franz Oppacher,et al. Connection Management using Adaptive Mobile Agents , 1998 .
[392] Chandrasekharan Rajendran,et al. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..
[393] Alain Hertz,et al. A TUTORIAL ON TABU SEARCH , 1992 .
[394] Rainer E. Burkard,et al. Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme , 1977, Math. Methods Oper. Res..
[395] R. Bland,et al. Large travelling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation , 1989 .
[396] Jin-Kao Hao,et al. Tabu Search for Maximal Constraint Satisfaction Problems , 1997, CP.
[397] Richard S. Sutton,et al. Reinforcement Learning with Replacing Eligibility Traces , 2005, Machine Learning.
[398] Matthijs den Besten,et al. Ant Colony Optimization for the Total Weighted Tardiness Problem , 2000, PPSN.
[399] L. Darrell Whitley,et al. Lamarckian Evolution, The Baldwin Effect and Function Optimization , 1994, PPSN.
[400] Léon J. M. Rothkrantz,et al. Ant-Based Load Balancing in Telecommunications Networks , 1996, Adapt. Behav..
[401] Jose Miguel Puerta,et al. Searching for the best elimination sequence in Bayesian networks by using ant colony optimization , 2002, Pattern Recognit. Lett..
[402] Hans W. Guesgen,et al. A Perspective of Constraint-Based Reasoning , 1992, Lecture Notes in Computer Science.
[403] Andrew B. Kahng,et al. A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..
[404] Thomas Stützle,et al. Special issue on Ant Algorithms , 2000 .
[405] Luca Maria Gambardella,et al. AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks , 2005, Eur. Trans. Telecommun..
[406] Holger H. Hoos,et al. An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem , 2002, Ant Algorithms.
[407] Thomas Stützle,et al. Ant colony optimization: artificial ants as a computational intelligence technique , 2006 .
[408] Marco Dorigo,et al. HC-ACO: The Hyper-Cube Framework for Ant Colony Optimization , 2001 .
[409] Fred W. Glover,et al. Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems , 1996, Discret. Appl. Math..
[410] Antonella Carbonaro,et al. An ANTS heuristic for the frequency assignment problem , 2000, Future Gener. Comput. Syst..
[411] William E. Hart,et al. Protein structure prediction with evolutionary algorithms , 1999 .
[412] Vittorio Maniezzo,et al. Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem , 1999, INFORMS J. Comput..
[413] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[414] Francesco Maffioli,et al. Coloured Ant System and Local Search to Design Local Telecommunication Networks , 2001, EvoWorkshops.
[415] R. Rubinstein. The Cross-Entropy Method for Combinatorial and Continuous Optimization , 1999 .
[416] Guy Theraulaz,et al. Dynamic Scheduling and Division of Labor in Social Insects , 2000, Adapt. Behav..
[417] Mauro Dell'Amico,et al. Annotated Bibliographies in Combinatorial Optimization , 1997 .
[418] Gianni A. Di Caro,et al. AntNet: A Mobile Agents Approach to Adaptive Routing , 1999 .
[419] Jin-Kao Hao,et al. A hybrid approach for the 0-1 multidimensional knapsack problem , 2001, IJCAI 2001.
[420] Walter J. Gutjahr,et al. ACO algorithms with guaranteed convergence to the optimal solution , 2002, Inf. Process. Lett..
[421] Michael J. B. Krieger,et al. The call of duty: Self-organised task allocation in a population of up to twelve mobile robots , 2000, Robotics Auton. Syst..
[422] Richard J. Wallace,et al. Analysis of Heuristic Methods for Partial Constraint Satisfaction Problems , 1996, CP.
[423] Bruce E. Hajek,et al. Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..
[424] M. Yamamoto,et al. On the Modelling of Bio-Inspired Collective Experiments with Real Robots , 1997 .
[425] Marco Dorigo,et al. Two Ant Colony Algorithms for Best-Effort Routing in Datagram Networks , 1998 .
[426] Ulrich Faigle,et al. Some Convergence Results for Probabilistic Tabu Search , 1992, INFORMS J. Comput..
[427] Vittorio Maniezzo,et al. The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..
[428] G. Theraulaz,et al. Inspiration for optimization from social insect behaviour , 2000, Nature.