Bi-Criterion Optimization with Multi Colony Ant Algorithms
暂无分享,去创建一个
Daniel Merkle | Martin Middendorf | Steffen Iredi | M. Middendorf | D. Merkle | Steffen Iredi | Daniel Merkle
[1] E. Lawler. A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .
[2] Joseph Y.-T. Leung,et al. Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..
[3] Chris N. Potts,et al. Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem , 1998, INFORMS J. Comput..
[4] É. Taillard,et al. MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .
[5] Richard F. Hartl,et al. An ant colony optimization approach for the single machine total tardiness problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[6] C. Mariano,et al. MOAQ an Ant-Q algorithm for multiple objective optimization problems , 1999 .
[7] 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).
[8] Marco Dorigo,et al. The ant colony optimization meta-heuristic , 1999 .
[9] Marc Gravel,et al. Scheduling a single machine where setup times are sequence dependent using an ant colony heuristic , 2000 .
[10] 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.
[11] Hartmut Schmeck,et al. Information Exchange in Multi Colony Ant Algorithms , 2000, IPDPS Workshops.
[12] Daniel Merkle,et al. An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems , 2000, EvoWorkshops.
[13] Gary B. Lamont,et al. Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art , 2000, Evolutionary Computation.