|
| [1] |
Pascal Van Hentenryck.
Parallel constraint satisfaction in logic programming: Preliminart
results of chip within pepsys.
In ICLP, pages 165-180, 1989.
|
| [2] |
Z. Michalewicz.
Genetic algorithms, numercial optimization and constraints.
In Proceedings of the Sixth International Converence on Genetic
Algorithms, pages 151-158, San Mateo, California, July 1995. Morgan
Kaufmann.
|
| [3] |
F. Focacci, A. Lodi, and M. Milano.
Cost-based domain filtering.
In Principle and Practice of Constraint Programming - CP'99,
pages 189-203, Berlin, Germany, 1999. Springer.
|
| [4] |
Filippo Focacci, Andrea Lodi, and Michela Milano.
Embedding relaxations in global constraints for solving tsp and
tsptw. Ann. Math. Articifial Intelligence, 34:291-311, 2002.
|
| [5] |
Filippo Focacci, Andrea Lodi, and Michela Milano.
A hybrid exact algorithm for the tsptw. INFORMS Journal on Computing, 14(4):403-417, 2002.
|
| [6] |
R.S. Garfinkel and G.L. Nemhauser. Integer Programming.
Wiley, New York, 1972.
|
| [7] |
Bruno De Backer, Vincent Furnon, Paul Shaw, Philip Kilby, and Patrick Prosser.
Solving vehicle routing problems using constraint programming and
metaheuristics. Journal of Heuristics, 6(4):501-523, 2000.
|
| [8] |
J.L. Deneubourg, S. Aron, S. Goss, and J.M. Pasteels.
The self-organizing exploratory pattern of the argentine ant. Journal Insect Behaviour, 3:159-168, 1990.
|
| [9] |
Guy Theraulaz Eric Bonabeau, Marco Dorigo. Swarm intelligence : from natural to artificial intelligence.
Oxford University Press, New York, 1999.
|
| [10] |
J. Hromkovic. Algorithmics for Hard Problems: Introduction to Combinatorial
Optimization, Randomization, Approximation and Heuristics.
Springer, Berlin, 2001.
|
| [11] |
M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of
NP-Completeness.
W.H. Freeman, San Francisco, CA, 1979.
|
| [12] |
I. Rechenberg. Evolutionsstrategie: Optimierung technischer Systeme nach
Prinzipien der biologischen Information.
Fromman, Freiburg, 1973.
|
| [13] |
J.H. Holland. Adaption in natural and artificial systems.
The University of Michigan Press, Ann Harbor, MI, 1975.
|
| [14] |
F. Glover.
Future paths for integer programming and links to artificial
intelligence. Comput. Oper. Res., 13:533-549, 1986.
|
| [15] |
M. Dorigo and L.M. Gambardella.
Ant colony system: A cooperative learning approach to the traveling
salesman problem. IEEE Transactions on Evolutionary Computation, 1:73-81,
1997.
|
| [16] |
L.J. Fogel.
Towards inductive inference automata.
In Proceedings of the International Federation for Information
Processing Congress, pages 395-399, Munich, 1962.
|
| [17] |
L.J. Fogel, A.J. Owens, and M.J. Walsh. Artificial Intelligence through Simulated Evolution.
Wiley, New York, 1966.
|
| [18] |
S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi.
Optimization by simulated annealing. Science, 220:671-680, 1983.
|
| [19] |
Bernd Meyer.
Constraint handling and Stochastic Ranking in ACO.
In IEEE Congress on evolutionary computation, Edinburgh,
September 2005.
|
| [20] |
E. Ignall and E. Schrage.
Application of the branch-and-bound technique to some flow-shop
scheduling problems. Operations Research, 13:400-412, 1965.
|
| [21] |
E.L. Lawler and D.W. Wood.
Branch-and-bound methods: A survey. Operations Research, 14(4):699-719, 1966.
|
| [22] |
E.L. Walker.
An enumerative technique for a class of combinatorial problems.
In Proc. Symposia of Applied Mathematics, volume X, 1960.
|
| [23] |
S.W. Colomb and L.D. Baumert.
Backtrack programming. Journal of the ACM, 12(4):516-524, 1966.
|
| [24] |
G. Pesant, M. Gendreau, J.-Y. Potvin, and J.-M. Rousseau.
An exact constraint logic programming algorithm for the traveling
salesman problem with time windows. Transportation Science, 32(1):12-29, 1998.
|
| [25] |
Solver.
ILOG solver 6.0 reference and user manual, 2003.
|
| [26] |
Bernd Meyer.
Personal communication, 2005.
|
| [27] |
S. Baluja.
Positive feedback as a search strategy.
Technical Report 91-016, Politecnico di Milano, Italy, 1991.
|
| [28] |
V. Maniezzo, A. Colorni, and M. Dorigo.
The ant system applied to the quadratic assignment problem.
Technical Report IRIDIA/94-28, Université Libre de Bruxelles,
Belgium, 1994.
|
| [29] |
A. Colorni, M. Dorigo, V. Maniezzo, and M. Trubian.
Ant system for job-shop scheduling. JOBREL - Belgian Journal of Operations Research, Statistics and
Computer Science, 34(1):39-53, 1994.
|
| [30] |
A. Colorni, M. Dorigo, V. Maniezzo, and M. Trubian.
An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research, 89:319-228, 1999.
|
| [31] |
L.M. Gambardella and M. Dorigo.
Ant colony system hybridized with a new local search for the
sequential ordering problem. INFORMS Journal on Computing, 12(3):237-255, 2000.
|
| [32] |
R. LeRiche, C. Knopf-Lenior, and R.T. Hafka.
A segregated genetic algorithm for constrainted structural
optimization.
In Proceedings of the 6th International Conference on Genetic
Algorithms, pages 558-565, San Mateo, 1995. Morgan Kaufmann.
|
| [33] |
J. Joines and C. Houck.
On the use of nonstationary penalty functions to solve nonlinear
constrained optimization problems with gas.
In Proceedings IEEE Int. Conference Evolutionary Computing,
pages 579-584, Piscataway, 1994.
|
| [34] |
E.L. Lawler, J.K. Lenstra, A.H.G. Kan, and D.B. Shmoys. The Traveling salesman problem : a guided tour of combinatorial
optimization.
Wiley, New York, 1985.
|
| [35] |
G.B. Danzig. Linear Programming and Extentions.
Princeton University Press, 1963.
|
| [36] |
H.P. Schwefel. Numerical Optimization of Computer Models.
John Wiley & Sons, Great Britain, 1981.
|
| [37] |
A.E. Smith and D.W. Coit.
Penalty functions.
In T. Bäck, D.B. Fogel, and Z. Michalewicz, editors, Handbook on Evolutionary Computation, pages C5.2:1-C5.2:6. Oxford
University Press, Oxford, 1997.
|
| [38] |
Z. Michalewicz, G. Nazhiyath, and M. Michalewicz.
A note on usefulness of geometrical crossover for numerical
optimization problems.
In Proceedings of the 5th Annual Conference on Evolutionary
Programming, pages 305-312, Cambridge, 1996. M.I.T. Press.
|
| [39] |
Z. Michalewicz.
A survey of constraint handling techniques in evolutionary
computation methods.
In Proceedings of the 4th Annual Conference on Evolutionary
Programming, pages 135-155, Cambridge MA, 1995. M.I.T. Press.
|
| [40] |
Bernd Meyer and Andreas Ernst.
Integrating ACO and constraint propagation.
In Ant Colony Optimization and Swarm Intelligence (ANTS
2004), Brussels, September 2004.
|
| [41] |
F. Focacci, F. Laburthe, and A. Lodi.
Local search and constraint programming.
In F. Glover and G. Kochenberger, editors, Handbook of
metaheuristics. Kluwer, Boston/MA, 2003.
|
| [42] |
Thomas P. Runarsson and Xin Yao.
Stochastic ranking for constrained evolutionary optimization. IEEE Transactions on Evolutionary Computation,
4(3):284-294, 2000.
|
| [43] |
Marco Dorigo. Optimization, learning and Natural algorithms.
PhD thesis, Poltecnico di Milano, 1992.
|
| [44] |
Z. Michalewicz and D.B. Fogel. How to Solve It: Modern Heuristics.
Springer-Verlag, Berlin, 2000.
|
| [45] |
C. Blum and A. Roli.
Metaheuristics in combinatorial optimization: Overview and conceptual
comparison. ACM Computing Surveys, 35(3):268-308, 2003.
|
| [46] |
O. Cordon, F. Herrera, and T. Stützle.
A review on the ant colony optimization metaheuristic: Basis, models
and new trends. Mathware and Soft Computing, 9(2-3):141-175, 2002.
|
| [47] |
C. Coello and A. Carlos.
A survey of constraint handling techniques used with evolutionary
algorithms.
Technical report, Laboratorio Nacional de Informtica Avanzada, 1999.
Technical Report Lania-RI-9904.
|
| [48] |
Christos H. Papadimitriou and Kenneth Steiglitz. Combinatorial Optimization - Algorithms and Complexity.
Prentice Hall, Englewood Cliffs, N.J., 1982.
|
| [49] |
M. Dorigo and G. Di Caro.
The ant colony meta-heuristic.
In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in
Optimization, pages 11-32. McGraw Hill, London, 1999.
|
| [50] |
K. Marriott and P. Stuckey. Programming With Constraints.
MIT Press, Cambridge/MA, 1998.
|
This file has been generated by bibtex2html 1.51 |