Multi Objective Ant Colony Optimization

[1]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[2]  David Corne,et al.  Bounded Pareto Archiving: Theory and Practice , 2004, Metaheuristics for Multiobjective Optimisation.

[3]  Gilbert Laporte,et al.  A Combinatorial Optimization Problem Arising in Dartboard Design , 1991 .

[4]  Richard F. Hartl,et al.  An improved Ant System algorithm for theVehicle Routing Problem , 1999, Ann. Oper. Res..

[5]  Mikkel T. Jensen,et al.  Reducing the run-time complexity of multiobjective EAs: The NSGA-II and other algorithms , 2003, IEEE Trans. Evol. Comput..

[6]  Carlos M. Fonseca,et al.  Inferential Performance Assessment of Stochastic Optimisers and the Attainment Function , 2001, EMO.

[7]  Xavier Gandibleux,et al.  An Annotated Bibliography of Multiobjective Combinatorial Optimization , 2000 .

[8]  Bernd Freisleben,et al.  Fitness landscape analysis and memetic algorithms for the quadratic assignment problem , 2000, IEEE Trans. Evol. Comput..

[9]  C. Mariano,et al.  MOAQ an Ant-Q algorithm for multiple objective optimization problems , 1999 .

[10]  Elwood S. Buffa,et al.  The Facilities Layout Problem in Perspective , 1966 .

[11]  Rainer E. Burkard,et al.  Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme , 1977, Math. Methods Oper. Res..

[12]  M. Dorigo,et al.  1 Positive Feedback as a Search Strategy , 1991 .

[13]  David W. Corne,et al.  Instance Generators and Test Suites for the Multiobjective Quadratic Assignment Problem , 2003, EMO.

[14]  Marco Laumanns,et al.  On the convergence and diversity-preservation properties of multi-objective evolutionary algorithms , 2001 .

[15]  John W. Dickey,et al.  Campus building arrangement using topaz , 1972 .

[16]  É. Taillard.  COMPARISON OF ITERATIVE SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM. , 1995 .

[17]  Mihalis Yannakakis,et al.  On the approximability of trade-offs and optimal access of Web sources , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[18]  Luca Maria Gambardella,et al.  MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .

[19]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[20]  Marc Gravel,et al.  Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic , 2002, Eur. J. Oper. Res..

[21]  Thomas Stützle,et al.  Local search algorithms for combinatorial problems - analysis, improvements, and new applications , 1999, DISKI.

[22]  Arthur M. Geoffrion,et al.  Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach , 1976, Oper. Res..

[23]  Charles Fleurent,et al.  Genetic Hybrids for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[24]  R. S. Laundy,et al.  Multiple Criteria Optimisation: Theory, Computation and Application , 1989 .

[25]  A. N. Elshafei,et al.  Hospital Layout as a Quadratic Assignment Problem , 1977 .

[26]  T. Koopmans,et al.  Assignment Problems and the Location of Economic Activities , 1957 .

[27]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[28]  Thomas Stützle,et al.  Pareto Local Optimum Sets in the Biobjective Traveling Salesman Problem: An Experimental Study , 2004, Metaheuristics for Multiobjective Optimisation.

[29]  Thomas Stützle,et al.  Ant Colony Optimization Theory , 2004 .

[30]  Jacques Teghem,et al.  Two-phases Method and Branch and Bound Procedures to Solve the Bi–objective Knapsack Problem , 1998, J. Glob. Optim..

[31]  Éric D. Taillard,et al.  FANT: Fast ant system , 1998 .

[32]  É. Taillard,et al.  Adaptive memories for the Quadratic Assignment Problems , 1997 .

[33]  Daniel Merkle,et al.  Bi-Criterion Optimization with Multi Colony Ant Algorithms , 2001, EMO.

[34]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..

[35]  Marco Laumanns,et al.  Archiving With Guaranteed Convergence And Diversity In Multi-objective Optimization , 2002, GECCO.

[36]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[37]  P. Gilmore.  Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem , 1962 .

[38]  Leon Steinberg,et al.  The Backboard Wiring Problem: A Placement Algorithm , 1961 .

[39]  Horst W. Hamacher,et al.  Facilities Layout for Social Institutions , 2002 .

[40]  Matthias Ehrgott,et al.  Multicriteria Optimization , 2005 .

[41]  Éric D. Taillard,et al.  Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[42]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[43]  Marco Laumanns,et al.  Performance assessment of multiobjective optimizers: an analysis and review , 2003, IEEE Trans. Evol. Comput..

[44]  Thomas Stützle,et al.  A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices , 2006, Eur. J. Oper. Res..

[45]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[46]  Gilbert Laporte,et al.  Balancing hydraulic turbine runners: A quadratic assignment problem , 1988 .

[47]  Luca Maria Gambardella,et al.  An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem , 2000, INFORMS J. Comput..

[48]  M Dorigo,et al.  Ant colonies for the quadratic assignment problem , 1999, J. Oper. Res. Soc..

[49]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[50]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[51]  David W. Corne,et al.  Towards Landscape Analyses to Inform the Design of Hybrid Local Search for the Multiobjective Quadratic Assignment Problem , 2002, HIS.

[52]  Luca Maria Gambardella,et al.  Solving symmetric and asymmetric TSPs by ant colonies , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[53]  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).

[54]  David Connolly.  An improved annealing scheme for the QAP , 1990 .